Optimal local unitary encoding circuits for the surface code

Abstract

The surface code is a leading candidate quantum error correcting code, owing to its high threshold, and compatibility with existing experimental architectures. Bravyi et al. (2006) showed that encoding a state in the surface code using local unitary operations requires time at least linear in the lattice size $L$, however the most efficient known method for encoding an unknown state, introduced by Dennis et al. (2002), has $O(L^2)$ time complexity. Here, we present an optimal local unitary encoding circuit for the planar surface code that uses exactly $2L$ time steps to encode an unknown state in a distance $L$ planar code. We further show how an $O(L)$ complexity local unitary encoder for the toric code can be found by enforcing locality in the $O(\log L)$-depth non-local renormalisation encoder. We relate these techniques by providing an $O(L)$ local unitary circuit to convert between a toric code and a planar code, and also provide optimal encoders for the rectangular, rotated and 3D surface codes. Furthermore, we show how our encoding circuit for the planar code can be used to prepare fermionic states in the compact mapping, a recently introduced fermion to qubit mapping that has a stabiliser structure similar to that of the surface code and is particularly efficient for simulating the Fermi-Hubbard model.

arXiv comment17 pages, 13 figures

References in corpus (44)

• Quantum Computing in the NISQ era and beyond
• Fault-tolerant quantum computation by anyons
• Topological quantum memory
• Fermionic quantum computation
• State preservation by repetitive error detection in a superconducting quantum circuit
• Fault-tolerant quantum computation with high threshold in two dimensions
• Lieb-Robinson bounds and the generation of correlations and topological quantum order
• Quantum error correction in a solid-state hybrid spin register
• Surface code quantum computing by lattice surgery
• The Bravyi-Kitaev transformation for quantum computation of electronic structure
• High threshold universal quantum computation on the surface code
• Universal control and error correction in multi-qubit spin registers in diamond
• Quantum orders in an exact soluble model
• Experimental Quantum Computations on a Topologically Encoded Qubit
• The XZZX Surface Code
• Repeated quantum error correction on a continuously encoded qubit by real-time feedback
• Efficient Distributed Quantum Computing
• Mapping local Hamiltonians of fermions to local Hamiltonians of spins
• Optimal Resources for Topological 2D Stabilizer Codes: Comparative Study
• Entanglement renormalization and topological order
• Fault-tolerant quantum error detection
• Unfolding the color code
• Constructions and Noise Threshold of Hyperbolic Surface Codes
• Efficient Computations of Encodings for Quantum Error Correction
• Adiabatic Preparation of Topological Order
• A Compact Fermion to Qubit Mapping
• Superfast encodings for fermionic quantum simulation
• Operator Locality in Quantum Simulation of Fermionic Models
• Universal topological phase of 2D stabilizer codes
• A magic state's fidelity can be superior to the operations that created it
• Linear-Time Maximum Likelihood Decoding of Surface Codes over the Quantum Erasure Channel
• Linear Depth Stabilizer and Quantum Fourier Transformation Circuits with no Auxiliary Qubits in Finite Neighbor Quantum Architectures
• Experimental quantum coding against photon loss error
• Local spin operators for fermion simulations
• Classification of quantum phases and topology of logical operators in an exactly solved model of quantum codes
• Quantum codes for quantum simulation of Fermions on a square lattice of qubits
• Majorana loop stabilizer codes for error correction of fermionic quantum simulations
• Experimental exploration of five-qubit quantum error correcting code with superconducting qubits
• Error- and Loss-Tolerances of Surface Codes with General Lattice Structures
• Protecting quantum memories using coherent parity check codes
• Variational circuit compiler for quantum error correction
• Generating topological order: no speedup by dissipation
• Simple scheme for encoding and decoding a qubit in unknown state for various topological codes
• Generating topological order from a 2D cluster state using a duality mapping

Cited by in corpus (10)

• Universal Fault-Tolerant Quantum Computing with Stabiliser Codes
• Low-depth simulations of fermionic systems on square-grid quantum hardware
• CSS code surgery as a universal construction
• Efficient fault-tolerant code switching via one-way transversal CNOT gates
• Quantum circuits for toric code and X-cube fracton model
• Emergent unitary designs for encoded qubits from coherent errors and syndrome measurements
• Logical Error Rates for the Surface Code Under a Mixed Coherent and Stochastic Circuit-Level Noise Model Inspired by Trapped Ions
• From Magic State Distillation to Dynamical Systems
• Near-Term Fermionic Simulation with Subspace Noise Tailored Quantum Error Mitigation
• Scalable Simulation of Fermionic Encoding Performance on Noisy Quantum Computers