6 papers
Do Not Let CNOTs Overwhelm the Decoder: Scheduling Transversal Gates for Fast FTQC
Shota Ikari, Yuga Hirai, Yasunari Suzuki +2
Transversal CNOT (TCNOT) gates can accelerate fault-tolerant quantum computation (FTQC) in the surface code by reducing the number of syndrome extraction rounds required between lo…
No More Hooks in the Surface Code: Distance-Preserving Syndrome Extraction for Arbitrary Layouts at Minimum Depth
Yuga Hirai, Shota Ikari, Yosuke Ueno +1
Hook errors are a major challenge in implementing logical operations with the surface code, because they can reduce the fault distance below the code distance. This motivates syndr…
Bounded-depth spacetime lattice surgery for resource-efficient fault-tolerant quantum computation
Kou Hamada, Hiroki Hamaguchi, Yosuke Ueno +3
Fault-tolerant quantum computing based on lattice surgery requires place-and-route compilation with low spacetime overhead. Routing, in particular, faces a basic tension between su…
A Spacetime Volume Implementation of a Logical S Gate in the Surface Code
Yuga Hirai, Shota Ikari, Yosuke Ueno +1
The logical S gate implemented via twist defect braiding in the surface code is one of the major sources of overhead in fault-tolerant quantum computing, since an S-gate correction…
Design automation and space-time reduction for surface-code logical operations using a SAT-based EDA kernel compatible with general encodings
Wang Liao, Rei Tokami, Yasunari Suzuki
Fault-tolerant quantum computers (FTQCs) based on surface codes and lattice surgery have been widely studied, and there is strong demand for a framework that can identify logical o…
Online Job Scheduler for Fault-tolerant Quantum Multiprogramming
Shin Nishio, Ryo Wakizaka, Daisuke Sakuma +2
Fault-tolerant quantum computers are expected to be offered as cloud services due to their significant resource and infrastructure requirements. Quantum multiprogramming, which run…