Fermion lattices can be simulated on same-size qubit lattices with O(1) interaction overhead by dynamically reorienting the Jordan-Wigner transformation.
hub Mixed citations
Low overhead quantum computation using lattice surgery
Mixed citation behavior. Most common role is background (60%).
19
Pith papers citing it
Background
60% of classified citations
hub tools
citation-role summary
background 4
method 1
citation-polarity summary
fields
quant-ph 19representative citing papers
AI pre-decoders achieve O(1 μs) per round decoding runtimes on GPUs for surface codes while improving logical error rates over global decoding alone and enabling data-driven noise weight estimation.
KOVAL-Q uses SAT solving to optimize and verify surface-code logical operations with general encodings, finding d-cycle CNOTs and 2d-cycle rotations that reduce FTQC application runtime by about 10 percent.
Magic state cultivation prepares high-fidelity T states with an order of magnitude fewer qubit-rounds than prior distillation methods by gradually growing them within a surface code under depolarizing noise.
Lattice-surgery scheduling is mapped to 3D path embedding and solved with look-ahead Dijkstra projection, yielding 3.8x lower execution time on quantum phase estimation benchmarks versus greedy scheduling.
A symmetry-leveraging framework for fault-tolerant ancilla preparation in quantum BCH codes yields lower spatial overhead and logical error rates than standard distillation in simulations up to 127 qubits.
The biplanar architecture maps Fermi-Hubbard spin sectors to two planes, eliminating swaps and cutting each Trotter step depth to 4t_synth + 90 logical timesteps versus 6t_synth + 354 in single-plane methods, yielding an estimated 2-hour runtime for L=8 with 1.35 million physical qubits under a 1% 1
Triage is an adaptive parallel window decoding scheduler that reduces average logical error rates by 52.6% compared to standard temporal parallelism while keeping stalls low under scarce classical resources.
FTPrimitiveBench is a new benchmark suite for testing surface-code logical primitives under Pauli-biased, measurement-biased, and spatially non-uniform noise models, revealing that noise structure interacts distinctly with each primitive and decoder.
A defect-adaptive lattice surgery technique reconstructs joint logical parities on irregular surface-code patches via GF(2) binary synthesis from seam measurements and pre-merge constraints, yielding executable rules or failure certificates while preserving effective distance.
The paper introduces concrete code deformation procedures for dense surface code packing, proposes hook-error-avoiding CNOT scheduling for syndrome extraction, and reports Monte Carlo simulations showing lower logical error rates than standard surface codes at large distances and low physical error,
A resource estimation framework for distributed fault-tolerant quantum computers based on lattice surgery identifies feasible hardware configurations for eight applications across thousands of setups, showing that architecture design must be guided by resource analysis for scalability.
Quantum sieving for SVP in dimension 400 needs ~10^13 physical qubits and ~10^31 years under optimistic assumptions, offering no practical speedup over classical methods.
GeneCS compiler reduces ancillary qubits and checks by over 85% on average for single- and cross-code logical operations on stabilizer codes while preserving error rates and scaling to over 10,000 qubits.
Catalyst towers reduce runtime and spacetime volume for continuous rotations in surface codes at small and medium distances in phase oracle and variational state preparation circuits for option pricing.
Simulations show non-local CNOT achieves up to 10x lower logical error than teleportation and distributed qLDPC needs d≈11 at p=10^{-4} or d≈29 at p=10^{-3} (with p_ebit=10p) for <10^{-12} error.
Quantum amplitude estimation algorithm for credit risk economic capital with qubit and runtime estimates on assumed future hardware.
NMR spectral simulations in zero/ultralow fields for small molecules and proteins are identified as promising applications for fault-tolerant quantum computation via qubitized dynamics circuits.
citing papers explorer
-
Fermion lattices can be simulated by same-size qubit lattices with $\mathcal{O}(1)$ interaction overhead
Fermion lattices can be simulated on same-size qubit lattices with O(1) interaction overhead by dynamically reorienting the Jordan-Wigner transformation.
-
Fast and accurate AI-based pre-decoders for surface codes
AI pre-decoders achieve O(1 μs) per round decoding runtimes on GPUs for surface codes while improving logical error rates over global decoding alone and enabling data-driven noise weight estimation.
-
Design automation and space-time reduction for surface-code logical operations using a SAT-based EDA kernel compatible with general encodings
KOVAL-Q uses SAT solving to optimize and verify surface-code logical operations with general encodings, finding d-cycle CNOTs and 2d-cycle rotations that reduce FTQC application runtime by about 10 percent.
-
Magic state cultivation: growing T states as cheap as CNOT gates
Magic state cultivation prepares high-fidelity T states with an order of magnitude fewer qubit-rounds than prior distillation methods by gradually growing them within a surface code under depolarizing noise.
-
Efficient and high-performance routing of lattice-surgery paths on three-dimensional lattice
Lattice-surgery scheduling is mapped to 3D path embedding and solved with look-ahead Dijkstra projection, yielding 3.8x lower execution time on quantum phase estimation benchmarks versus greedy scheduling.
-
Efficient Fault-Tolerant Ancilla Preparation for Quantum BCH codes via Cyclic Symmetry
A symmetry-leveraging framework for fault-tolerant ancilla preparation in quantum BCH codes yields lower spatial overhead and logical error rates than standard distillation in simulations up to 127 qubits.
-
Two Layers, No Swaps: Biplanar SPOQC Architecture Improves Runtime of Fermi-Hubbard Simulation
The biplanar architecture maps Fermi-Hubbard spin sectors to two planes, eliminating swaps and cutting each Trotter step depth to 4t_synth + 90 logical timesteps versus 6t_synth + 354 in single-plane methods, yielding an estimated 2-hour runtime for L=8 with 1.35 million physical qubits under a 1% 1
-
Triage: An Adaptive Parallel Window Decoding Scheduler for Real-time Fault-Tolerant Quantum Computation
Triage is an adaptive parallel window decoding scheduler that reduces average logical error rates by 52.6% compared to standard temporal parallelism while keeping stalls low under scarce classical resources.
-
FTPrimitiveBench: A Benchmark Suite For Logical Computation Under Hardware-Motivated and Biased Noise Models
FTPrimitiveBench is a new benchmark suite for testing surface-code logical primitives under Pauli-biased, measurement-biased, and spatially non-uniform noise models, revealing that noise structure interacts distinctly with each primitive and decoder.
-
Defect-Adaptive Lattice Surgery on Irregular Boundary Surface-Code Patches
A defect-adaptive lattice surgery technique reconstructs joint logical parities on irregular surface-code patches via GF(2) binary synthesis from seam measurements and pre-merge constraints, yielding executable rules or failure certificates while preserving effective distance.
-
Dense packing of the surface code: code deformation procedures and hook-error-avoiding gate scheduling
The paper introduces concrete code deformation procedures for dense surface code packing, proposes hook-error-avoiding CNOT scheduling for syndrome extraction, and reports Monte Carlo simulations showing lower logical error rates than standard surface codes at large distances and low physical error,
-
Architecting Distributed Quantum Computers: Design Insights from Resource Estimation
A resource estimation framework for distributed fault-tolerant quantum computers based on lattice surgery identifies feasible hardware configurations for eight applications across thousands of setups, showing that architecture design must be guided by resource analysis for scalability.
-
On the practicality of quantum sieving algorithms for the shortest vector problem
Quantum sieving for SVP in dimension 400 needs ~10^13 physical qubits and ~10^31 years under optimistic assumptions, offering no practical speedup over classical methods.
-
GeneCS: Synthesizing Resource-Efficient Code Surgery for Arbitrary Quantum Stabilizer Codes
GeneCS compiler reduces ancillary qubits and checks by over 85% on average for single- and cross-code logical operations on stabilizer codes while preserving error rates and scaling to over 10,000 qubits.
-
Space and Time Cost of Continuous Rotations in Surface Codes
Catalyst towers reduce runtime and spacetime volume for continuous rotations in surface codes at small and medium distances in phase oracle and variational state preparation circuits for option pricing.
-
Transversal Fault Tolerant Distributed Quantum Computing Operations
Simulations show non-local CNOT achieves up to 10x lower logical error than teleportation and distributed qLDPC needs d≈11 at p=10^{-4} or d≈29 at p=10^{-3} (with p_ebit=10p) for <10^{-12} error.
-
Credit Risk Analysis using Quantum Computers
Quantum amplitude estimation algorithm for credit risk economic capital with qubit and runtime estimates on assumed future hardware.
-
Prospects for NMR Spectral Prediction on Fault-Tolerant Quantum Computers
NMR spectral simulations in zero/ultralow fields for small molecules and proteins are identified as promising applications for fault-tolerant quantum computation via qubitized dynamics circuits.
- LightStim: A Framework for QEC Protocol Evaluation and Prototyping with Automated DEM Construction