Work

Demand-Driven Routing Space for Lattice-Surgery Compilation

Year: 2026

Type: preprint

Abstract: Lattice-surgery compilation places logical qubits on a grid of surface-code tiles and routes their interactions. Sparse static layouts limit routing contention but reserve space that often remains idle. Reducing this reservation requires balancing area savings against additional gate serialization and qubit movement. In this paper, we present a co-designed dynamic architecture and compiler that allocates routing space according to circuit demand. The architecture preserves a fixed virtual qubit floorplan while allowing its physical spacing to change between execution stages. The compiler coordinates placement, scheduling, and routing to implement lattice surgeries using fewer physical qubits. Across our application benchmarks, our method reduces space-time volume by 55.6% in geometric mean and compiles 75.5 times faster than the evaluated DasCot configuration. A circuit-synthesis case study shows how our compiler exposes optimization tradeoffs.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2610.30747

Authors: Wang, Hanyu, Lin, Wan-Hsuan, Chen, Zihan, Zhang, Eddy Z., Cong, Jason

Institutions: University of California, Los Angeles, QuEra Computing (United States), Rutgers, The State University of New Jersey

Language: English

Topic: Quantum Computing Algorithms and Architecture

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: National Science Foundation, Google

Awards: QLCI-CI: NSF Quantum Leap Challenge Institute for Present and Future Quantum Computing, NQVL:QSTD:Design: Open-Stack Rydberg Atom Quantum Computing Laboratory (ORAQL), CCF: FET: Small: Toward Scalable Quantum Circuit Optimization with Structural Gadgets

OpenAlex ID: W7223259442

Cites: 82

Cited by:

Related to: 10