An Algebraic Language for Specifying Quantum Networks
Anita Buckley, Pavel Chuprikov, Rodrigo Otoni, Robert Soulé, Robert Rand, Patrick Eugster
Abstract
Quantum networks connect quantum capable nodes in order to achieve capabilities that are impossible only using classical information. Their fundamental unit of communication is the Bell pair , which consists of two entangled quantum bits. Unfortunately, Bell pairs are fragile and difficult to transmit directly, necessitating a network of repeaters, along with software and hardware that can ensure the desired results. Challenging intrinsic features of quantum networks, such as dealing with resource competition, motivate formal reasoning about quantum network protocols. To this end, we developed BellKAT, a novel specification language for quantum networks based upon Kleene algebra. To cater to the specific needs of quantum networks, we designed an algebraic structure, called BellSKA, which we use as the basis of BellKAT’s denotational semantics. BellKAT’s constructs describe entanglement distribution rules that allow for modular specification. We give BellKAT a sound and complete equational theory, allowing us to verify network protocols. We provide a prototype tool to showcase the expressiveness of BellKAT and how to optimize and verify networks in practice.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext f8c7a95e-46d4-4e62-a472-42291c891c44Cited by top-tier papers1
Ask how each one uses itBuilds on2
- Guarded Kleene algebra with tests: verification of uninterpreted programs in nearly linear timeSteffen Smolka, Nate Foster, Justin Hsu, Tobias Kappé et al.POPL 2020 · 32 citations
- Algebraic reasoning of Quantum programs via non-idempotent Kleene algebraYuxiang Peng, Mingsheng Ying, Xiaodi WuPLDI 2022 · 13 citations
Related papers
- Network Change Validation with Relational NetKATHan Xu, Zachary Kincaid, Ratul Mahajan, David WalkerPOPL 2026 · 1 citation
- Weighted NetKAT: A Programming Language for Quantitative Network VerificationEmmanuel Suárez Acevedo, Tiago Ferreira, Kevin Batz, Oliver Bøving et al.PLDI 2026 · 1 citation
- Kleene algebra modulo theories: a framework for concrete KATsMichael Greenberg, Ryan Beckett, Eric Hayden CampbellPLDI 2022 · 7 citations
- CoqQ: Foundational Verification of Quantum ProgramsLi Zhou, Gilles Barthe, Pierre-Yves Strub, Junyi Liu et al.POPL 2023 · 33 citations
- Concurrent Entanglement Routing for Quantum Networks: Model and DesignsShouqian Shi, Chen QianSIGCOMM 2020 · 187 citations
