Efficient percolation simulations for lossy photonic fusion networks
arXiv:2312.04639 · doi:10.1103/PhysRevResearch.6.033273
Abstract
The study of percolation phenomena has various applications ranging from social networks or materials science to quantum information. The most common percolation models are bond- or site-percolation for which the Newman-Ziff algorithm enables an efficient simulation. Here, we consider several non-standard percolation models that appear in the context of measurement-based photonic quantum computing with so-called graph states and fusion networks. The associated percolation thresholds determine the tolerance to photon loss in such systems and we develop modifications of the Newman-Ziff algorithm to perform the corresponding percolation simulation efficiently. We demonstrate our algorithms by using them to characterize exemplary fusion networks and graph states. The used source code is provided as an open-source repository.
References in corpus (59)
- Topological quantum memory
- Measurement-based quantum computation with cluster states
- Improved Simulation of Stabilizer Circuits
- Interfacing single photons and single quantum dots with photonic nanostructures
- Resource-efficient linear optical quantum computation
- Realization of a multi-node quantum network of remote solid-state qubits
- Efficient high-fidelity quantum computation using matter qubits and linear optics
- A bright and fast source of coherent single photons
- A fast Monte Carlo algorithm for site or bond percolation
- Efficient Monte Carlo algorithm and high-precision results for percolation
- Deterministic Generation of a Cluster State of Entangled Photons
- A fault-tolerant one-way quantum computer
- A photon-photon quantum gate based on a single atom in an optical resonator
- A photonic cluster state machine gun
- Repeat-Until-Success Quantum Computing
- Entanglement Percolation in Quantum Networks
- How good must single photon sources and detectors be for efficient linear optical quantum computation?
- From three-photon GHZ states to ballistic universal quantum computation
- Single-photon quantum hardware: towards scalable photonic quantum technology with a quantum advantage
- 3/4-efficient Bell measurement with passive linear optics and unentangled ancillae
- Efficient quantum computation with probabilistic quantum gates
- Quantum Hypergraph States
- Bond and Site Percolation in Three Dimensions
- Fault tolerant quantum computation with very high threshold for loss errors
- Optically generated 2-dimensional photonic cluster state from coupled quantum dots
- Thresholds for topological codes in the presence of loss
- Repeat-Until-Success quantum computing using stationary and flying qubits
- Simultaneous analysis of three-dimensional percolation models
- Percolation, renormalization, and quantum computing with non-deterministic gates
- Triggered single-photon generation and resonance fluorescence in ultra-low loss integrated photonic circuits
- Deterministic generation of all-photonic quantum repeaters from solid-state emitters
- Scaling behavior of explosive percolation on the square lattice
- Square lattice site percolation at increasing ranges of neighbor interactions
- Diamond Integrated Quantum Photonics: A Review
- Photon sorters and QND detectors using single photon emitters
- Bell-state measurement exceeding 50% success probability with linear optics
- Simple cubic random-site percolation thresholds for complex neighbourhoods
- Deterministic correction of qubit loss
- Calculation of percolation thresholds in high dimensions for fcc, bcc, and diamond lattices
- Photonic source of heralded GHZ states
- High-threshold quantum computing by fusing one-dimensional cluster states
- Optimal preparation of graph states
- Photonic resource state generation from a minimal number of quantum emitters
- Fault-tolerant quantum computation with non-deterministic entangling gates
- Mapping graph state orbits under local complementation
- Deterministic photon source of genuine three-qubit entanglement
- Bond percolation on simple cubic lattices with extended neighborhoods
- Self-Correcting Quantum Memories Beyond the Percolation Threshold
- Physical-depth architectural requirements for generating universal photonic cluster states
- A Spin-Optical Quantum Computing Architecture
- A local and scalable lattice renormalization method for ballistic quantum computation
- Twins Percolation for Qubit Losses in Topological Color Codes
- Percolation thresholds on triangular lattice for neighbourhoods containing sites up-to the fifth coordination zone
- Newman-Ziff algorithm for the bootstrap percolation: application to the Archimedean lattices
- Loss-tolerant architecture for quantum computing with quantum emitters
- Method for estimating critical exponents in percolation processes with low sampling
- Site and bond percolation on four-dimensional simple hypercubic lattices with extended neighborhoods
- Analytical percolation theory for topological color codes under qubit loss
- Sublattice-selective percolation on bipartite planar lattices