REVIEW 9 cited by
Fault-tolerant quantum computation
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Recently, it was realized that use of the properties of quantum mechanics might speed up certain computations dramatically. Interest in quantum computation has since been growing. One of the main difficulties of realizing quantum computation is that decoherence tends to destroy the information in a superposition of states in a quantum computer, thus making long computations impossible. A futher difficulty is that inaccuracies in quantum state transformations throughout the computation accumulate, rendering the output of long computations unreliable. It was previously known that a quantum circuit with t gates could tolerate O(1/t) amounts of inaccuracy and decoherence per gate. We show, for any quantum computation with t gates, how to build a polynomial size quantum circuit that can tolerate O(1/(log t)^c) amounts of inaccuracy and decoherence per gate, for some constant c. We do this by showing how to compute using quantum error correcting codes. These codes were previously known to provide resistance to errors while storing and transmitting quantum data.
Forward citations
Cited by 9 Pith papers
-
A distillation-teleportation protocol for fault-tolerant QRAM
An adaptive distillation-teleportation protocol implements a fault-tolerant QRAM query with poly(n) quantum resources and 1/poly(n) device fidelity, at the cost of an exponential classical dataset update each round.
-
Restrictions on non-Clifford fault tolerance and ruling out beyond-SQL quantum metrology
Constant signal-aligned noise makes asymptotic beyond-SQL quantum sensing impossible for any protocol, including encoded, biased, adaptive, and nonstabilizer schemes.
-
A superconducting surface-code processor with lattice-surgery logical operations
Experimental realization of lattice surgery on two d=3 surface-code logical qubits in superconducting hardware, with logical Bell state, Deutsch-Jozsa algorithm, and conditioned non-Clifford gate fidelity of 0.943.
-
Arbitrary-Distance Quantum Error Correction with Gauss's Law for $\mathbb Z_2$ Lattice Gauge Theory
Gauss's law constraints in Z2 lattice gauge theory can be made into quantum error-correcting codes of arbitrary distance, with provably optimal encoding rate within the constructed family.
-
Efficient simulation of logical magic state preparation protocols
A classical simulation method that propagates circuit-level Pauli noise to a Clifford error makes logical magic-state preparation protocols simulable in time polynomial in qubits and the target state's stabilizer rank.
-
An apologia for islands
Entanglement islands and Page curves can arise in massless gravity without an external bath, and compactly supported gauge-invariant operators exist in islands around generic symmetry-breaking black hole backgrounds.
-
Kagome edge states under lattice termination, spin-orbit coupling, and magnetic order
Using exact tight-binding calculations, the authors show kagome edge states are termination-dependent in the pristine lattice, become termination-independent helical modes with Kane-Mele spin-orbit coupling, and form ...
-
A Resource Comparison of Logical T-State Preparation
Compares resource costs of logical T-state preparation via distillation, cultivation, and code switching using native metrics from existing literature plus a Shor factoring case study.
-
Design Automation in Quantum Error Correction
A comprehensive review of automated tools and methods for designing quantum error-corrected circuits, with case studies on T-gate optimization, surface-code layout, ML decoders, and verification.
Discussion (0). Sign in to comment.