Recognition: unknown
Fault-Tolerant Postselected Quantum Computation: Schemes
read the original 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.
This paper has not been read by Pith yet.
Forward citations
Cited by 4 Pith papers
-
Imaginarity-generating power of unitaries: A resource-theoretic approach
Unitaries have an exactly quantifiable purity-constrained imaginarity-generating power that depends on intrinsic unitary properties and concentrates near its maximum for typical Haar-random dynamics in high dimensions.
-
Hybrid Path-Sums for Hybrid Quantum Programs
Hybrid Path-Sums offer a new symbolic framework with rewriting rules and assertions to represent, simplify, and verify properties of hybrid quantum-classical programs.
-
Local distillation from Reed Muller codes unfolding
Local 2D and 3D Reed-Muller distillation factories achieve output infidelities down to 8.256e-9 for CCZ states and 1.1811e-17 for T states from 10^{-3} input infidelity.
-
Fault-Tolerant Quantum Computing with Trapped Ions: The Walking Cat Architecture
A trapped-ion architecture based on LDPC codes and cat-state factories achieves 110 logical qubits and one million T gates per day using 2514 physical qubits, with estimates for Heisenberg model simulation on 100 site...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.