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.
Gottesman, Opportunities and challenges in fault- tolerant quantum computation, arXiv:2210.15844 (2022)
8 Pith papers cite this work. Polarity classification is still indexing.
8
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
roles
background 2polarities
background 2representative citing papers
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.
Pinnacle Architecture using QLDPC codes reduces physical qubits needed to factor RSA-2048 to under 100,000 at 10^{-3} error rate.
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.
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 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.
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.
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.
citing papers explorer
-
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.
-
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.
-
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.