REVIEW 14 cited by
Opportunities and Challenges in 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
I will give an overview of what I see as some of the most important future directions in the theory of fault-tolerant quantum computation. In particular, I will give a brief summary of the major problems that need to be solved in fault tolerance based on low-density parity check codes and in hardware-specific fault tolerance. I will then conclude with a discussion of a possible new paradigm for designing fault-tolerant protocols based on a space-time picture of quantum circuits.
Forward citations
Cited by 14 Pith papers
-
LightStim: A Framework for QEC Protocol Evaluation and Prototyping with Automated DEM Construction
LightStim automates DEM construction for QEC protocols via an augmented Pauli tableau during compilation, matching public tools on detector counts and error rates while enabling new cross-code designs.
-
A framework for low-overhead quantum fault tolerance via spacetime lifting
Spacetime lifting constructs fault complexes with almost-linear fault distance in spacetime cost, outperforming prior constructions and supporting fault-tolerant logical teleportation via cluster-state protocols.
-
Novelty-Based Generation of Continuous Landscapes with Diverse Local Optima Networks
LightStim automates DEM construction for QEC protocols via a record-augmented Pauli tableau tracker, validated across memory, logical operations, distillation, and a novel cross-code lattice surgery design.
-
The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes
Pinnacle Architecture using QLDPC codes reduces physical qubits needed to factor RSA-2048 to under 100,000 at 10^{-3} error rate.
-
Error detection without post-selection in adaptive quantum circuits
Error detection is integrated into adaptive quantum circuits for non-equilibrium phase transition simulations by mapping errors to resets, achieving post-selection-free logical simulations near break-even on current hardware.
-
Compressing Syndrome Measurement Sequences
Fault-tolerant syndrome extraction can be compressed from r stabilizer measurements to O(d log r) by combining stabilizer generators through the parity check matrix of a classical code.
-
Demonstration of logical qubits and repeated error correction with better-than-physical error rates
Logical error rates in [[7,1,3]] and [[12,2,4]] codes are suppressed 9.8-800 times below physical rates on trapped-ion hardware, with repeated correction cycles approaching the error rate of two physical CNOTs.
-
Gauging the Spacetime Code
Gauging the spacetime code produces a lattice gauge theory inheriting circuit fault tolerance, with applications to foliated MBQC, classical memory in mixed topological states, and learnable Pauli noise degrees of freedom.
-
LightStim: A Framework for QEC Protocol Evaluation and Prototyping with Automated DEM Construction
A tree-encoded fusion scheme and MemTree compiler suppress fusion erasure errors in photonic MBQC, achieving large execution-time reductions over prior compilers with real-hardware validation.
-
Novelty-Based Generation of Continuous Landscapes with Diverse Local Optima Networks
Novelty search generates diverse continuous multimodal landscapes with direct basin definitions, enabling low-cost local optima networks whose features predict evolutionary algorithm performance.
-
A Pathway to Practical Quantum Advantage in Solving Navier-Stokes Equations
A spectral-sparsity-based quantum solver is claimed to solve 2^80-cell Navier-Stokes problems in 42.6 days with 8.71 million physical qubits, a 1,100x speedup over a classical supercomputer.
-
Quantum Error Correction in Adversarial Regimes
The paper gives a generalized Knill-Laflamme condition for quantum list-decodable codes and a pseudorandom-unitary protocol for unambiguous list decoding that is claimed to be secure against polynomial-time quantum ad...
-
Dynamics and rupture of doped Motility Induced Phase Peparation
Adding passive particles to a phase-separated active suspension can produce a stable, self-sustained drift of the dense slab.
-
Towards Quantum Optimised Malware Containment
A hybrid quantum approach is proposed to achieve quadratic speedups in influence estimation and edge removal optimization for malware containment modeled as a network influence minimisation problem.
Discussion (0). Sign in to comment.