A local and scalable lattice renormalization method for ballistic quantum computation

Abstract

A recent proposal has shown that it is possible to perform linear-optics quantum computation using a ballistic generation of the lattice. Yet, due to the probabilistic generation of its cluster state, it is not possible to use the fault-tolerant Raussendorf lattice, which requires a lower failure rate during the entanglement-generation process. Previous work in this area showed proof-of-principle linear-optics quantum computation, while this paper presents an approach to it which is more practical, satisfying several key constraints. We develop a classical measurement scheme, that purifies a large faulty lattice to a smaller lattice with entanglement faults below threshold. A single application of this method can reduce the entanglement error rate to $7\%$ for an input failure rate of $25\%$. Thus, we can show that it is possible to achieve fault tolerance for ballistic methods.

References in corpus (15)

• Surface codes: Towards practical large-scale quantum computation
• Photonic quantum technologies
• Silica-on-Silicon Waveguide Quantum Circuits
• Multi-party entanglement in graph states
• An addressable quantum dot qubit with fault-tolerant control fidelity
• Fault-tolerant quantum computation with high threshold in two dimensions
• A fault-tolerant addressable spin qubit in a natural silicon quantum dot
• From three-photon GHZ states to ballistic universal quantum computation
• 3/4-efficient Bell measurement with passive linear optics and unentangled ancillae
• Fault-tolerant quantum error detection
• Percolation, renormalization, and quantum computing with non-deterministic gates
• Producing cluster states in charge qubits and flux qubits
• Efficient one-step generation of large cluster states with solid-state circuits
• Fault-tolerant quantum computation with non-deterministic entangling gates
• Physical-depth architectural requirements for generating universal photonic cluster states

Cited by in corpus (14)

• High-threshold quantum computing by fusing one-dimensional cluster states
• All-photonic architectural roadmap for scalable quantum computing using Greenberger-Horne-Zeilinger states
• Looped Pipelines Enabling Effective 3D Qubit Lattices in a Strictly 2D Device
• Timing constraints imposed by classical digital control systems on photonic implementations of measurement-based quantum computing
• Encoded-Fusion-Based Quantum Computation for High Thresholds with Linear Optics
• Loss-tolerant architecture for quantum computing with quantum emitters
• Parity-encoding-based quantum computing with Bayesian error tracking
• A Photonic Parameter-shift Rule: Enabling Gradient Computation for Photonic Quantum Computers
• Fault-tolerant structures for measurement-based quantum computation on a network
• Efficient percolation simulations for lossy photonic fusion networks
• A dataflow programming framework for linear optical distributed quantum computing
• Timing constraints due to real-time graph traversal algorithms on incomplete cluster states in photonic measurement-based quantum computing
• Photonic Hybrid Quantum Computing
• Building a fusion-based quantum computer using teleported gates