Numerical Implementation of Just-In-Time Decoding in Novel Lattice Slices Through the Three-Dimensional Surface Code

Abstract

We build on recent work by B. Brown (Sci. Adv. 6, eaay4929 (2020)) to develop and simulate an explicit recipe for a just-in-time decoding scheme in three 3D surface codes, which can be used to implement a transversal (non-Clifford) $\overline{CCZ}$ between three 2D surface codes in time linear in the code distance. We present a fully detailed set of bounded-height lattice slices through the 3D codes which retain the code distance and measurement-error detecting properties of the full 3D code and admit a dimension-jumping process which expands from/collapses to 2D surface codes supported on the boundaries of each slice. At each timestep of the procedure the slices agree on a common set of overlapping qubits on which $CCZ$ should be applied. We use these slices to simulate the performance of a simple JIT decoder against stochastic $X$ and measurement errors and find evidence for a threshold $p_c\sim 0.1\%$ in all three codes. We expect that this threshold could be improved by optimisation of the decoder.

19 pages, 11 figures. Additional supplementary materials at https://github.com/tRowans/JIT-supplementary-materials. v2; removed some claims regarding issues with staircase slices and changed one reference. v3; Minor changes and clarifications based on reviewer comments. Some additional references added including one to a github repo containing the full source code

References in corpus (14)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Surface codes: Towards practical large-scale quantum computation
• Fault-tolerant quantum computation with high threshold in two dimensions
• Topological Quantum Distillation
• Restrictions on Transversal Encoded Quantum Gate Sets
• Quantum computing with nearest neighbor interactions and error rates over 1%
• Topological Computation without Braiding
• Decoding Across the Quantum LDPC Code Landscape
• Universal transversal gates with color codes - a simplified approach
• Single-shot error correction of three-dimensional homological product codes
• Demonstration of quantum volume 64 on a superconducting quantum computing system
• Cellular automaton decoders for topological quantum codes with noisy measurements and beyond
• Universal Fault-Tolerant Quantum Computing with Stabiliser Codes
• A four-dimensional toric code with non-Clifford transversal gates

Cited by in corpus (12)

• High threshold codes for neutral atom qubits with biased erasure errors
• The Impact of Hardware Specifications on Reaching Quantum Advantage in the Fault Tolerant Regime
• Quantum computation from dynamic automorphism codes
• Universal Fault-Tolerant Quantum Computing with Stabiliser Codes
• Low-overhead non-Clifford fault-tolerant circuits for all non-chiral abelian topological phases
• Non-Pauli Errors in the Three-Dimensional Surface Code
• Single-shot preparation of hypergraph product codes via dimension jump
• Magic tricycles: Efficient magic state generation with finite block-length quantum LDPC codes
• Intrinsic Heralding and Optimal Decoders for Non-Abelian Topological Order
• Color code with a logical control-$S$ gate using transversal $T$ rotations
• Universal fault tolerant quantum computation in 2D without getting tied in knots
• Planar fault-tolerant circuits for non-Clifford gates on the 2D color code