Physical-depth architectural requirements for generating universal photonic cluster states
arXiv:1706.07325 · doi:10.1088/2058-9565/aa913b
Abstract
Most leading proposals for linear-optical quantum computing (LOQC) use cluster states, which act as a universal resource for measurement-based (one-way) quantum computation (MBQC). In ballistic approaches to LOQC, cluster states are generated passively from small entangled resource states using so-called fusion operations. Results from percolation theory have previously been used to argue that universal cluster states can be generated in the ballistic approach using schemes which exceed the critical threshold for percolation, but these results consider cluster states with unbounded size. Here we consider how successful percolation can be maintained using a physical architecture with fixed physical depth, assuming that the cluster state is continuously generated and measured, and therefore that only a finite portion of it is visible at any one point in time. We show that universal LOQC can be implemented using a constant-size device with modest physical depth, and that percolation can be exploited using simple pathfinding strategies without the need for high-complexity algorithms.
arXiv comment18 pages, 10 figures
References in corpus (21)
- Review article: Linear optical quantum computing
- Measurement-based quantum computation with cluster states
- Multi-party entanglement in graph states
- Resource-efficient linear optical quantum computation
- Optical quantum computation using cluster states
- A fast Monte Carlo algorithm for site or bond percolation
- Silicon Quantum Photonics
- 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
- Loss tolerance in one-way quantum computation via counterfactual error correction
- 3/4-efficient Bell measurement with passive linear optics and unentangled ancillae
- Bond and Site Percolation in Three Dimensions
- Thresholds for topological codes in the presence of loss
- Percolation, renormalization, and quantum computing with non-deterministic gates
- Resource costs for fault-tolerant linear optical quantum computing
- Cellular-automaton decoders for topological quantum memories
- Phase transition of computational power in the resource states for one-way quantum computation
- Relative multiplexing for minimizing switching in linear-optical quantum computing
- A simple scheme for universal linear optics quantum computing with constant experimental complexity using fiber-loops
- Near-deterministic creation of universal cluster states with probabilistic Bell measurements and 3-qubit resource states
- An introduction to one-way quantum computing in distributed architectures
Cited by in corpus (15)
- Photonic quantum information processing: a concise review
- Advances in silicon quantum photonics
- Deterministic correction of qubit loss
- Mapping graph state orbits under local complementation
- Universal MBQC with generalised parity-phase interactions and Pauli measurements
- Hard limits on the postselectability of optical graph states
- A local and scalable lattice renormalization method for ballistic quantum computation
- Timing constraints imposed by classical digital control systems on photonic implementations of measurement-based quantum computing
- Loss-tolerant teleportation on large stabilizer states
- Loss-tolerant architecture for quantum computing with quantum emitters
- Frequency-encoded linear cluster states with coherent Raman photons
- Efficient percolation simulations for lossy photonic fusion networks
- Quantum Theory from Principles, Quantum Software from Diagrams
- Heralded photonic graph states with inefficient quantum emitters
- Timing constraints due to real-time graph traversal algorithms on incomplete cluster states in photonic measurement-based quantum computing