A dataflow programming framework for linear optical distributed quantum computing
arXiv:2601.08389 · doi:10.22331/q-2026-01-19-1972
Abstract
Photonic systems offer a promising platform for interconnecting quantum processors and enabling scalable, networked architectures. Designing and verifying such architectures requires a unified formalism that integrates linear algebraic reasoning with probabilistic and control-flow structures. In this work, we introduce a graphical framework for distributed quantum computing that brings together linear optics, the ZX-calculus, and dataflow programming. Our language supports the formal analysis and optimization of distributed protocols involving both qubits and photonic modes, with explicit interfaces for classical control and feedforward, all expressed within a synchronous dataflow model with discrete-time dynamics. Within this setting, we classify entangling photonic fusion measurements, show how their induced Pauli errors can be corrected via a novel flow structure for fusion networks, and establish correctness proofs for new repeat-until-success protocols enabling arbitrary fusions. Layer by layer, we construct qubit architectures incorporating practical optical components such as beam splitters, switches, and photon sources, with graphical proofs that they are deterministic and support universal quantum computation. Together, these results establish a foundation for verifiable compilation and automated optimization in networked quantum computing.
References in corpus (67)
- Resource-efficient linear optical quantum computation
- Large Scale Modular Quantum Computer Architecture with Atomic Memory and Photonic Interconnects
- All photonic quantum repeaters
- Theoretical framework for quantum networks
- Quantum Circuits Architecture
- Deterministic Generation of a Cluster State of Entangled Photons
- High-speed linear optics quantum computing using active feed-forward
- A photonic cluster state machine gun
- Distributed Quantum Computation Based-on Small Quantum Registers
- Repeat-Until-Success Quantum Computing
- Universal resources for measurement-based quantum computation
- From three-photon GHZ states to ballistic universal quantum computation
- Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus
- 3/4-efficient Bell measurement with passive linear optics and unentangled ancillae
- Distributed Quantum Computing across an Optical Network Link
- Reducing T-count with the ZX-calculus
- Scalable boson-sampling with time-bin encoding using a loop-based architecture
- Generalized Flow and Determinism in Measurement-based Quantum Computation
- Compiler Design for Distributed Quantum Computing
- Description of a quantum convolutional code
- Quantum networks with neutral atom processing nodes
- Quantum-scissors device for optical state truncation: A proposal for practical realization
- Classical simulation of photonic linear optics with lost particles
- The ZX calculus is a language for surface code lattice surgery
- There and back again: A circuit extraction tale
- Experimental implementation of the optimal linear-optical controlled phase gate
- Minimally complex ion traps as modules for quantum communication and computing
- High-threshold quantum computing by fusing one-dimensional cluster states
- Geometry of abstraction in quantum computation
- Unifying flavors of fault tolerance with the ZX calculus
- DisCoPy: Monoidal Categories in Python
- Distributing circuits over heterogeneous, modular quantum computing network architectures
- Scalable Networking of Neutral-Atom Qubits: Nanofiber-Based Approach for Multiprocessor Fault-Tolerant Quantum Computer
- Quantum Shift Register Circuits
- Floquetifying the Colour Code
- Scalable feedback control of single photon sources for photonic quantum technologies
- Deterministic and reconfigurable graph state generation with a single solid-state quantum emitter
- A Spin-Optical Quantum Computing Architecture
- Graph States, Pivot Minor, and Universality of (X,Z)-measurements
- Generating entanglement with linear optics
- Fiber-compatible photonic feed-forward with 99% fidelity
- A local and scalable lattice renormalization method for ballistic quantum computation
- Nearly deterministic Bell measurement with multiphoton entanglement for efficient quantum information processing
- Creation of Entangled Photonic States Using Linear Optics
- OneQ: A Compilation Framework for Photonic One-Way Quantum Computation
- Relating Measurement Patterns to Circuits via Pauli Flow
- Graph-theoretical optimization of fusion-based graph state generation
- Open Diagrams via Coend Calculus
- Site percolation thresholds on triangular lattice with complex neighborhoods
- A compiler for universal photonic quantum computers
- Phase-free ZX diagrams are CSS codes (...or how to graphically grok the surface code)
- Complete Flow-Preserving Rewrite Rules for MBQC Patterns with Pauli Measurements
- Switch networks for photonic fusion-based quantum computing
- Flow-preserving ZX-calculus Rewrite Rules for Optimisation and Obfuscation
- Quantum Linear Optics via String Diagrams
- Light-Matter Interaction in the ZXW Calculus
- Graphical CSS Code Transformation Using ZX Calculus
- Optimal compilation of parametrised quantum circuits
- Floquetifying stabiliser codes with distance-preserving rewrites
- Enhanced Fault-tolerance in Photonic Quantum Computing: Comparing the Honeycomb Floquet Code and the Surface Code in Tailored Architecture
- DisCoPy for the quantum computer scientist
- Flexible entangled state generation in linear optics
- Fault Tolerance by Construction
- ZX-calculus is Complete for Finite-Dimensional Hilbert Spaces
- Optyx: A ZX-based Python library for networked quantum architectures
- String Diagrams for Premonoidal Categories
- Coinductive Streams in Monoidal Categories