A Language for Quantifying Quantum Network Behavior
summary
A domain specific language called PBKAT models Bell pair distribution with probabilistic actions (e.g. create succeeds 0.81, swap 0.6) plus nondeterministic schedulers and produces a convex set of distributions over final multisets by compiling expressions to an automaton. An embedded Haskell DSL and prototype tool compute all traces, verify and optimize protocols, and scales to real examples: evaluation on 16 protocols finishes under 10 minutes using <= 8 GB of RAM.
AI-written summary · about
chapters (9)
- 0:00Quantum network protocols intro
- 1:06Bell pairs as resources
- 2:11Classical vs quantum networks
- 2:53Quantum protocol example
- 4:00Quantifying with PBcat
- 5:02PBcat language features
- 9:01PBcat components and semantics
- 10:49Tool implementation results
- 11:10Summary and Q&A
related talks
17mAn Algebraic Language for Specifying Quantum Networks
23mA feasible and unitary programming language with quantum control
30mQuantum Computing for Programming Languages Researchers
18mAutomated distribution of quantum circuits via hypergraph partitioning
15mToward A Quantum Programming Language for Higher Level Formal Verification
21mQuantum Bayesian Networks For Path Accuracy in Manufacturing
22mIntroducing BRAT
24mSemantics for Variational Quantum Programming