Noise thresholds for optical quantum computers

Abstract

In this paper we numerically investigate the fault-tolerant threshold for optical cluster-state quantum computing. We allow both photon loss noise and depolarizing noise (as a general proxy for all local noise), and obtain a threshold region of allowed pairs of values for the two types of noise. Roughly speaking, our results show that scalable optical quantum computing is possible for photon loss probabilities less than 0.003, and for depolarization probabilities less than 0.0001.

4 pages

References in corpus (12)

• Measurement-based quantum computation with cluster states
• Experimental One-Way Quantum Computing
• Quantum Computing with Very Noisy Devices
• Resource-efficient linear optical quantum computation
• Optical quantum computation using cluster states
• Overhead and noise threshold of fault-tolerant quantum error correction
• Experimental Controlled-NOT Logic Gate for Single Photons in the Coincidence Basis
• Fault-tolerant quantum computation with cluster states
• Experimental demonstration of a non-destructive controlled-NOT quantum gate for two independent photon-qubits
• Deterministic linear optics quantum computation utilizing linked photon circuits
• Experimental nonlinear sign shift for linear optics quantum computation
• Quantum information processing with noisy cluster states

Cited by in corpus (77)

• Review article: Linear optical quantum computing
• Measurement-based quantum computation
• Universal Quantum Computation with Continuous-Variable Cluster States
• Experimental entanglement of six photons in graph states
• A photonic cluster state machine gun
• One-Way Quantum Computing in the Optical Frequency Comb
• Prospective applications of optical quantum memories
• How good must single photon sources and detectors be for efficient linear optical quantum computation?
• Loss tolerance in one-way quantum computation via counterfactual error correction
• High-threshold fault-tolerant quantum computation with analog quantum error correction
• Experimental demonstration of graph-state quantum secret sharing
• Fault tolerant quantum computation with very high threshold for loss errors
• Thresholds for topological codes in the presence of loss
• Demonstration of unconditional one-way quantum computations for continuous variables
• Blind topological measurement-based quantum computation
• Experimental demonstration of a graph state quantum error-correction code
• Percolation, renormalization, and quantum computing with non-deterministic gates
• Resource costs for fault-tolerant linear optical quantum computing
• Cat codes with optimal decoherence suppression for a lossy bosonic channel
• Error Analysis For Encoding A Qubit In An Oscillator
• High-fidelity operation of quantum photonic circuits
• Error Correction and Degeneracy in Surface Codes Suffering Loss
• Producing cluster states in charge qubits and flux qubits
• Fundamentals of universality in one-way quantum computation
• Scalable Generation of Graph-State Entanglement through Realistic Linear Optics
• Noise thresholds for optical cluster-state quantum computation
• Proposal for implementing universal superadiabatic geometric quantum gates in nitrogen-vacancy centers
• The efficiencies of generating cluster states with weak non-linearities
• Efficient quantum circuits for one-way quantum computing
• Potential and limits to cluster state quantum computing using probabilistic gates
• Simple proof of fault tolerance in the graph-state model
• Verifiable fault-tolerance in measurement-based quantum computation
• Fault-Tolerant Topological One-Way Quantum Computation with Probabilistic Two-Qubit Gates
• Quantum Optical Systems for the Implementation of Quantum Information Processing
• Quantum simulation of interacting high-dimensional systems: the influence of noise
• Distributed quantum information processing with minimal local resources
• Experimental Demonstration of Decoherence-Free One-Way Information Transfer
• Level Reduction and the Quantum Threshold Theorem
• Purification of large bicolorable graph states
• Error models for mode-mismatch in linear optics quantum computing
• Temporal-mode continuous-variable 3-dimensional cluster state for topologically-protected measurement-based quantum computation
• One-way quantum computation with four-dimensional photonic qudits
• Loss Tolerant Linear Optical Quantum Memory By Measurement Based Quantum Computing
• Minimal resources for linear optical one-way computing
• Quantum Computation with Topological Codes: from qubit to topological fault-tolerance
• Quantum variational learning for quantum error-correcting codes
• Single-qubit rotations in 2D optical lattices with multi-qubit addressing
• Experimental implementation of a fully controllable depolarizing quantum operation
• Cluster state preparation using gates operating at arbitrary success probabilities
• Topological One-Way Quantum Computation on Verified Logical Cluster States
• Linear-optical processing cannot increase photon efficiency
• Cluster-based architecture for fault-tolerant quantum computation
• Improving the Fidelity of Optical Zeno Gates via Distillation
• Randomized benchmarking in measurement-based quantum computing
• One-way quantum computing in a decoherence-free subspace
• Error tolerance and tradeoffs in loss- and failure-tolerant quantum computing schemes
• Phase map decompositions for unitaries
• Measurement-Based Time Evolution for Quantum Simulation of Fermionic Systems
• Linear optical quantum computation with imperfect entangled photon-pair sources and inefficient non-photon-number-resolving detectors
• Optical Zeno Gate: Bounds for Fault Tolerant Operation
• Atomic cluster state build up with macroscopic heralding
• Loss-tolerant transmission of multiphoton-qubit information via hybrid entanglement
• Boosting photonic quantum computation with moderate nonlinearity
• Fault-tolerant linear optics quantum computation by error-detecting quantum state transfer
• Preservation of loss in linear-optical processing
• Construction of optimal resources for concatenated quantum protocols
• Generation of graph-state streams
• Percolation in quantum computation and communication
• Quantum Merlin-Arthur with noisy channel
• High-Threshold Low-Overhead Fault-Tolerant Classical Computation and the Replacement of Measurements with Unitary Quantum Gates
• Efficient entanglement purification based on noise guessing decoding
• Computational quantum-classical boundary of complex and noisy quantum systems
• Improving noise threshold for optical quantum computing with the EPR photon source
• Error metric for non-trace-preserving quantum operations
• Theory of qubit noise characterization using the long-time cavity transmission
• Quantum Computing Using Crossed Atomic Beams
• Rigorous no-go theorems for heralded linear-optical state generation tasks