A circuit-level protocol and analysis for twist-based lattice surgery

• URL: http://arxiv.org/abs/2201.05678v1
• Date: Fri, 14 Jan 2022 21:16:27 GMT
• Title: A circuit-level protocol and analysis for twist-based lattice surgery
• Authors: Christopher Chamberland and Earl T. Campbell
• Abstract summary: Lattice surgery is a technique for performing fault-tolerant quantum computation in two dimensions. We provide an explicit twist-based lattice surgery protocol and its requisite connectivity layout. We also provide new stabilizer measurement circuits for measuring twist defects.
• Score: 3.222802562733787
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Lattice surgery is a measurement-based technique for performing fault-tolerant quantum computation in two dimensions. When using the surface code, the most general lattice surgery operations require lattice irregularities called twist defects. However, implementing twist-based lattice surgery may require additional resources, such as extra device connectivity, and could lower the threshold and overall performance for the surface code. Here we provide an explicit twist-based lattice surgery protocol and its requisite connectivity layout. We also provide new stabilizer measurement circuits for measuring twist defects which are compatible with our chosen gate scheduling. We undertake the first circuit-level error correction simulations during twist-based lattice surgery using a biased depolarizing noise model. Our results indicate a slight decrease in the threshold for timelike logical failures compared to lattice surgery protocols with no twist defects in the bulk. However, comfortably below threshold (i.e. with CNOT infidelities below $5 \times 10^{-3}$), the performance degradation is mild and in fact preferable over proposed alternative twist-free schemes. Lastly, we provide an efficient scheme for measuring $Y$ operators along boundaries of surface codes which bypasses certain steps that were required in previous schemes.

Related papers

• Type-Based Verification of Connectivity Constraints in Lattice Surgery [0.196629787330046]
  Fault-tolerant quantum computation using lattice surgery can be abstracted as operations on graphs. $mathcalQ_LS$ is a first-order quantum programming language to formalize the execution model of surgery operations.
  arXiv  Detail & Related papers  (2024-08-31T19:31:19Z)
• Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
  We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations. We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes. Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
  arXiv  Detail & Related papers  (2023-12-21T17:40:18Z)
• Improved Pairwise Measurement-Based Surface Code [0.0]
  We devise a new realization of the surface code on a rectangular lattice of qubits utilizing single-qubit and nearest-neighbor two-qubit Pauli measurements. This realization gains substantial advantages over prior pairwise measurement-based realizations of the surface code.
  arXiv  Detail & Related papers  (2023-10-19T17:59:55Z)
• Fast Flux-Activated Leakage Reduction for Superconducting Quantum Circuits [84.60542868688235]
  leakage out of the computational subspace arising from the multi-level structure of qubit implementations. We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation. We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
  arXiv  Detail & Related papers  (2023-09-13T16:21:32Z)
• New magic state distillation factories optimized by temporally encoded lattice surgery [0.0]
  Timelike failures during lattice surgery protocols can result in logical failures during the execution of an algorithm. We introduce an improved TELS protocol and subsequently augment it with the ability to correct low-weight classical errors. We also explore large families of classical error correcting codes for a wide range of parallelizable Pauli set sizes.
  arXiv  Detail & Related papers  (2022-10-28T00:34:37Z)
• Software mitigation of coherent two-qubit gate errors [55.878249096379804]
  Two-qubit gates are important components of quantum computing. But unwanted interactions between qubits (so-called parasitic gates) can degrade the performance of quantum applications. We present two software methods to mitigate parasitic two-qubit gate errors.
  arXiv  Detail & Related papers  (2021-11-08T17:37:27Z)
• Machine Learning for Continuous Quantum Error Correction on Superconducting Qubits [1.8249709209063887]
  Continuous quantum error correction has been found to have certain advantages over discrete quantum error correction. We propose a machine learning algorithm for continuous quantum error correction based on the use of a recurrent neural network.
  arXiv  Detail & Related papers  (2021-10-20T05:13:37Z)
• Universal quantum computing with twist-free and temporally encoded lattice surgery [3.222802562733787]
  We introduce a decoder capable of correcting spacelike and timelike errors during lattice surgery protocols. We compute logical failure rates of a lattice surgery protocol for a biased circuit-level noise model. We propose a layout for a quantum processor that is more efficient for rectangular surface codes exploiting noise bias.
  arXiv  Detail & Related papers  (2021-09-06T21:18:01Z)
• Performance of teleportation-based error correction circuits for bosonic codes with noisy measurements [58.720142291102135]
  We analyze the error-correction capabilities of rotation-symmetric codes using a teleportation-based error-correction circuit. We find that with the currently achievable measurement efficiencies in microwave optics, bosonic rotation codes undergo a substantial decrease in their break-even potential.
  arXiv  Detail & Related papers  (2021-08-02T16:12:13Z)
• Fault-tolerant parity readout on a shuttling-based trapped-ion quantum computer [64.47265213752996]
  We experimentally demonstrate a fault-tolerant weight-4 parity check measurement scheme. We achieve a flag-conditioned parity measurement single-shot fidelity of 93.2(2)%. The scheme is an essential building block in a broad class of stabilizer quantum error correction protocols.
  arXiv  Detail & Related papers  (2021-07-13T20:08:04Z)
• Efficient and robust certification of genuine multipartite entanglement in noisy quantum error correction circuits [58.720142291102135]
  We introduce a conditional witnessing technique to certify genuine multipartite entanglement (GME) We prove that the detection of entanglement in a linear number of bipartitions by a number of measurements scales linearly, suffices to certify GME. We apply our method to the noisy readout of stabilizer operators of the distance-three topological color code and its flag-based fault-tolerant version.
  arXiv  Detail & Related papers  (2020-10-06T18:00:07Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.