Double-slice routing provides bounded-depth spacetime routing for lattice surgery with termination guarantees, cutting compilation cost by up to 2.4x versus single-slice baselines and 7.5x with mapping optimizations on Hamiltonian simulation workloads.
High-performance and scalable fault-tolerant quantum computation with lattice surgery on a 2.5 d architecture
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 4verdicts
UNVERDICTED 4roles
background 1polarities
background 1representative citing papers
A workload-aware surface-code architecture with ancilla-centric patches and T-gate-based floorplanning reduces required data tiles by up to 21% while maintaining near-optimal cycles per instruction and reaching 90% efficiency for 10 concurrent programs.
O3LS reduces space overhead by up to 46.7% and time overhead by up to 36% in lattice surgery while suppressing logical error rates by up to an order of magnitude compared with prior layout and scheduling approaches.
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,
citing papers explorer
-
Bounded-depth spacetime lattice surgery for resource-efficient fault-tolerant quantum computation
Double-slice routing provides bounded-depth spacetime routing for lattice surgery with termination guarantees, cutting compilation cost by up to 2.4x versus single-slice baselines and 7.5x with mapping optimizations on Hamiltonian simulation workloads.
-
Toward designing workload-aware Surface Code Architectures
A workload-aware surface-code architecture with ancilla-centric patches and T-gate-based floorplanning reduces required data tiles by up to 21% while maintaining near-optimal cycles per instruction and reaching 90% efficiency for 10 concurrent programs.
-
O3LS: Optimizing Lattice Surgery via Automatic Layout Searching and Loose Scheduling
O3LS reduces space overhead by up to 46.7% and time overhead by up to 36% in lattice surgery while suppressing logical error rates by up to an order of magnitude compared with prior layout and scheduling approaches.
-
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,