Fault-Tolerant Postselected Quantum Computation: Schemes

Abstract

Postselected quantum computation is distinguished from regular quantum computation by accepting the output only if measurement outcomes satisfy predetermined conditions. The output must be accepted with nonzero probability. Methods for implementing postselected quantum computation with noisy gates are proposed. These methods are based on error-detecting codes. Conditionally on detecting no errors, it is expected that the encoded computation can be made to be arbitrarily accurate. Although the probability of success of the encoded computation decreases dramatically with accuracy, it is possible to apply the proposed methods to the problem of preparing arbitrary stabilizer states in large error-correcting codes with local residual errors. Together with teleported error-correction, this may improve the error tolerance of non-postselected quantum computation.

17 pages

Cited by in corpus (39)

• Quantum Computing with Very Noisy Devices
• Restrictions on Transversal Encoded Quantum Gate Sets
• Improved magic states distillation for quantum universality
• Multilevel distillation of magic states for quantum computing
• Experimental demonstration of a graph state quantum error-correction code
• Quantum Algorithm for Spectral Measurement with Lower Gate Count
• Codes and Protocols for Distilling $T$, controlled-$S$, and Toffoli Gates
• Applications of coherent classical communication and the Schur transform to quantum information theory
• Surface code compilation via edge-disjoint paths
• Distillation with sublogarithmic overhead
• Catalysis of entanglement and other quantum resources
• Level Reduction and the Quantum Threshold Theorem
• Quantum Resources Required to Block-Encode a Matrix of Classical Data
• Morphing quantum codes
• Error-detection-based quantum fault tolerance against discrete Pauli noise
• Protecting Expressive Circuits with a Quantum Error Detection Code
• Composite Toffoli gate with two-round error detection
• The Quantum Schur Transform: I. Efficient Qudit Circuits
• Sampling Overhead Analysis of Quantum Error Mitigation: Uncoded vs. Coded Systems
• Information Complexity of Quantum Gates
• Magic State Distillation from Entangled States
• Towers of generalized divisible quantum codes
• Logic Synthesis for Fault-Tolerant Quantum Computers
• Towards Large-Scale Quantum Computation
• Magic State Distillation at Intermediate Size
• Concatenation Schemes for Topological Fault-tolerant Quantum Error Correction
• Accuracy threshold for postselected quantum computation
• Fault-tolerant ancilla preparation and noise threshold lower bounds for the 23-qubit Golay code
• Variations on the Choi-Jamiolkowski isomorphism
• Measurement sequences for magic state distillation
• Postselection threshold against biased noise
• An upper bound on quantum fault tolerant thresholds
• Low Overhead Qutrit Magic State Distillation
• High-fidelity quantum state preparation using neighboring optimal control
• Finding the disjointness of stabilizer codes is NP-complete
• The robustness of magic state distillation against errors in Clifford gates
• Implementation of non-local operations for arbitrary high-dimensional systems with qubit quantum channel
• Efficient classical simulation of cluster state quantum circuits with alternative inputs
• Hybrid Path-Sums for Hybrid Quantum Programs