skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Surface Code Compilation via Edge-Disjoint Paths

Journal Article · · PRX Quantum

We provide an efficient algorithm to compile quantum circuits for fault-tolerant execution. We target surface codes, which form a two-dimensional grid of logical qubits with nearest-neighbor logical operations. Embedding an input circuit’s qubits in surface codes can result in long-range two-qubit operations across the grid. We show how to prepare many long-range Bell pairs on qubits connected by edge-disjoint paths of ancillae in constant depth that can be used to perform these long-range operations. This forms one core part of our edge-disjoint path compilation (EDPC) algorithm, by easily performing many parallel long-range Clifford operations in constant depth. It also allows us to establish a connection between surface code compilation and several well-studied edge-disjoint path problems. Similar techniques allow us to perform non-Clifford single-qubit rotations far from magic state distillation factories. In this case, we can easily find the maximum set of paths by a max-flow reduction, which forms the other major part of EDPC. EDPC has the best asymptotic worst-case performance guarantees on the circuit depth for compiling parallel operations when compared to related compilation methods based on swap gates and network coding. EDPC also shows a quadratic depth improvement over sequential Pauli-based compilation for parallel rotations requiring magic resources. We implement EDPC and find significantly improved performance for circuits built from parallel controlled-not (CNOT) gates, and for circuits that implement the multicontrolled X gate CkNOT .

Research Organization:
Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
Sponsoring Organization:
USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR)
Grant/Contract Number:
SC0019040; 89233218CNA000001
OSTI ID:
1869727
Alternate ID(s):
OSTI ID: 1878073
Report Number(s):
LA-UR-22-24266; PQRUAG; 020342
Journal Information:
PRX Quantum, Journal Name: PRX Quantum Vol. 3 Journal Issue: 2; ISSN 2691-3399
Publisher:
American Physical SocietyCopyright Statement
Country of Publication:
United States
Language:
English

References (29)

Quantum Repeaters: The Role of Imperfect Local Operations in Quantum Communication journal December 1998
Mapping of lattice surgery-based quantum circuits on surface code architectures journal September 2018
Poking Holes and Cutting Corners to Achieve Clifford Gates with the Surface Code journal May 2017
Universal quantum computation with ideal Clifford gates and noisy ancillas journal February 2005
Approximating disjoint-path problems using packing integer programs journal January 2004
Advantages of a modular high-level quantum programming framework journal April 2019
How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits journal April 2021
Quantum computing with realistically noisy devices journal March 2005
Routing Permutations on Graphs via Matchings journal May 1994
Quantum network coding for quantum repeaters journal September 2012
Elucidating reaction mechanisms on quantum computers journal July 2017
Scalable designs for quasiparticle-poisoning-protected topological quantum computation with Majorana zero modes journal June 2017
Surface code quantum computing by lattice surgery journal December 2012
Maximal Flow Through a Network journal January 1956
Low-overhead constructions for the fault-tolerant Toffoli gate journal February 2013
Fault-tolerant quantum computation by anyons journal January 2003
Quantum linear network coding for entanglement distribution in restricted architectures journal November 2020
Surface code quantum computing with error rates over 1% journal February 2011
On the capacities of bipartite hamiltonians and unitary gates journal August 2003
Soundness and completeness of quantum root-mean-square errors journal January 2019
Surface codes: Towards practical large-scale quantum computation journal September 2012
Network information flow journal July 2000
A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery journal March 2019
Optimization of the surface code design for Majorana-based qubits journal October 2020
Approximation algorithms for combinatorial problems journal December 1974
Quantum Network Communication—The Butterfly and Beyond journal July 2010
Topological and Subsystem Codes on Low-Degree Graphs with Flag Qubits journal January 2020
The surface code with a twist journal April 2017
Optimal ancilla-free Clifford+T approximation of z-rotations journal September 2016

Similar Records

Direct Randomized Benchmarking for Multiqubit Devices
Journal Article · Fri Jul 19 00:00:00 EDT 2019 · Physical Review Letters · OSTI ID:1869727

Virtualized Logical Qubits: A 2.5D Architecture for Error-Corrected Quantum Computing
Conference · Thu Oct 01 00:00:00 EDT 2020 · 2020 53rd Annual IEEE/ACM International Symposium on Microarchitecture (MICRO) · OSTI ID:1869727

Quantum error mitigation by Pauli check sandwiching
Journal Article · Mon Feb 06 00:00:00 EST 2023 · Scientific Reports · OSTI ID:1869727

Related Subjects