Universal quantum computing with twist-free and temporally encoded lattice surgery

• URL: http://arxiv.org/abs/2109.02746v3
• Date: Sat, 15 Jan 2022 23:45:03 GMT
• Title: Universal quantum computing with twist-free and temporally encoded lattice surgery
• Authors: Christopher Chamberland and Earl T. Campbell
• Abstract summary: 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.
• Score: 3.222802562733787
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Lattice surgery protocols allow for the efficient implementation of universal gate sets with two-dimensional topological codes where qubits are constrained to interact with one another locally. In this work, we first introduce a decoder capable of correcting spacelike and timelike errors during lattice surgery protocols. Afterwards, we compute logical failure rates of a lattice surgery protocol for a biased circuit-level noise model. We then provide a new protocol for performing twist-free lattice surgery, where we avoid twist defects in the bulk of the lattice. Our twist-free protocol eliminates the extra circuit components and gate scheduling complexities associated with the measurement of higher weight stabilizers when using twist defects. We also provide a protocol for temporally encoded lattice surgery that can be used to reduce both runtimes and the total space-time costs of quantum algorithms. Lastly, we propose a layout for a quantum processor that is more efficient for rectangular surface codes exploiting noise bias, and which is compatible with the other techniques mentioned above.

Related papers

• Realizing Lattice Surgery on Two Distance-Three Repetition Codes with Superconducting Qubits [31.25958618453706]
  We demonstrate lattice surgery between two distance-three repetition-code qubits by splitting a single distance-three surface-code qubit. We achieve an improvement in the value of the decoded $ZZ$ logical two-qubit observable compared to a similar non-encoded circuit.
  arXiv  Detail & Related papers  (2025-01-08T16:49:27Z)
• Snakes and Ladders: Adapting the surface code to defects [36.136619420474766]
  We develop a suite of novel and highly performant methods for adapting surface code patches in the presence of defective qubits and gates. Compared to prior works, our methods significantly improve the code distance of the adapted surface code patches for realistic defect rates.
  arXiv  Detail & Related papers  (2024-12-16T07:27:24Z)
• Accelerating Error Correction Code Transformers [56.75773430667148]
  We introduce a novel acceleration method for transformer-based decoders. We achieve a 90% compression ratio and reduce arithmetic operation energy consumption by at least 224 times on modern hardware.
  arXiv  Detail & Related papers  (2024-10-08T11:07:55Z)
• Modular decoding: parallelizable real-time decoding for quantum computers [55.41644538483948]
  Real-time quantum computation will require decoding algorithms capable of extracting logical outcomes from a stream of data generated by noisy quantum hardware. We propose modular decoding, an approach capable of addressing this challenge with minimal additional communication and without sacrificing decoding accuracy. We introduce the edge-vertex decomposition, a concrete instance of modular decoding for lattice-surgery style fault-tolerant blocks.
  arXiv  Detail & Related papers  (2023-03-08T19:26:10Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Transversal Injection: A method for direct encoding of ancilla states for non-Clifford gates using stabiliser codes [55.90903601048249]
  We introduce a protocol to potentially reduce this overhead for non-Clifford gates. Preliminary results hint at high quality fidelities at larger distances.
  arXiv  Detail & Related papers  (2022-11-18T06:03:10Z)
• 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)
• A circuit-level protocol and analysis for twist-based lattice surgery [3.222802562733787]
  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.
  arXiv  Detail & Related papers  (2022-01-14T21:16:27Z)
• 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)
• 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)
• Dynamically Corrected Nonadiabatic Holonomic Quantum Gates [2.436681150766912]
  The noise-resilience feature of nonadiabatic holonomic quantum computation (NHQC) still needs to be improved. We propose a general protocol of universal NHQC with simplified control, which can greatly suppress the effect of accompanied X errors. Numerical simulation shows that the performance of our gate can be much better than previous protocols.
  arXiv  Detail & Related papers  (2020-12-16T15:52:38Z)

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.