Fault-tolerant quantum computation with non-deterministic entangling gates

Abstract

Performing entangling gates between physical qubits is necessary for building a large-scale universal quantum computer, but in some physical implementations - for example, those that are based on linear optics or networks of ion traps - entangling gates can only be implemented probabilistically. In this work, we study the fault-tolerant performance of a topological cluster state scheme with local non-deterministic entanglement generation, where failed entangling gates (which correspond to bonds on the lattice representation of the cluster state) lead to a defective three-dimensional lattice with missing bonds. We present two approaches for dealing with missing bonds; the first is a non-adaptive scheme that requires no additional quantum processing, and the second is an adaptive scheme in which qubits can be measured in an alternative basis to effectively remove them from the lattice, hence eliminating their damaging effect and leading to better threshold performance. We find that a fault-tolerance threshold can still be observed with a bond-loss rate of 6.5% for the non-adaptive scheme, and a bond-loss rate as high as 14.5% for the adaptive scheme.

5 pages, 3 figures

References in corpus (7)

• Quantum computing with trapped ions
• Resource-efficient linear optical quantum computation
• Topological fault-tolerance in cluster state quantum computation
• From three-photon GHZ states to ballistic universal quantum computation
• Fast simulation of stabilizer circuits using a graph state representation
• Fault-tolerance thresholds for the surface code with fabrication errors
• Freely Scalable Quantum Technologies using Cells of 5-to-50 Qubits with Very Lossy and Noisy Photonic Links

Cited by in corpus (26)

• Photonic quantum information processing: a concise review
• Blueprint for a Scalable Photonic Fault-Tolerant Quantum Computer
• Resource-efficient and fault-tolerant topological quantum computation with hybrid entanglement of light
• High-threshold quantum computing by fusing one-dimensional cluster states
• All-photonic architectural roadmap for scalable quantum computing using Greenberger-Horne-Zeilinger states
• Programmable photonic integrated meshes for modular generation of optical entanglement links
• High photon-loss threshold quantum computing using GHZ-state measurements
• Looped Pipelines Enabling Effective 3D Qubit Lattices in a Strictly 2D Device
• A Spin-Optical Quantum Computing Architecture
• Information processing at the speed of light
• Highly photon loss tolerant quantum computing using hybrid qubits
• A local and scalable lattice renormalization method for ballistic quantum computation
• Tailored cluster states with high threshold under biased noise
• Graph-theoretical optimization of fusion-based graph state generation
• Tailoring fusion-based error correction for high thresholds to biased fusion failures
• Encoded-Fusion-Based Quantum Computation for High Thresholds with Linear Optics
• Loss-tolerant architecture for quantum computing with quantum emitters
• A Photonic Parameter-shift Rule: Enabling Gradient Computation for Photonic Quantum Computers
• Parity-encoding-based quantum computing with Bayesian error tracking
• Fault-tolerant structures for measurement-based quantum computation on a network
• Efficient percolation simulations for lossy photonic fusion networks
• Accommodating Fabrication Defects on Floquet Codes with Minimal Hardware Requirements
• Photonic Hybrid Quantum Computing
• Optical Quantum Computing
• Multiplexed bi-layered realization of fault-tolerant quantum computation over optically networked trapped-ion modules
• Nonlinear photonic architecture for fault-tolerant quantum computing