Measurement sequences for magic state distillation

• URL: http://arxiv.org/abs/2007.07929v3
• Date: Mon, 18 Jan 2021 05:40:36 GMT
• Title: Measurement sequences for magic state distillation
• Abstract summary: We present measurement sequences for magic state distillation protocols which can suppress arbitrary errors on any part of a protocol. Our protocol operates on a two-dimensional square grid by measurements of $ZZ$ on horizontal pairs of qubits, $XX$ on vertical pairs, and $Z,X$ on single qubits.
• Score: 0.30458514384586394
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Magic state distillation uses special codes to suppress errors in input states, which are often tailored to a Clifford-twirled error model. We present detailed measurement sequences for magic state distillation protocols which can suppress arbitrary errors on any part of a protocol, assuming the independence of errors across qubits. Provided with input magic states, our protocol operates on a two-dimensional square grid by measurements of $ZZ$ on horizontal pairs of qubits, $XX$ on vertical pairs, and $Z,X$ on single qubits.

Related papers

• Exploring the landscape of compact magic-state distillation factories [0.0]
  We show that classical error-correcting codes offer a simpler framework for deriving magic state distillation protocols.<n>We derive a series of no-go theorems that relate key figures of merit, including the number of qubits, the protocol depth, the factory distance, and the prefactor in the output error rate.<n>Our results also include new distillation protocols with the smallest number of qubits for a given distance in the literature.
  arXiv  Detail & Related papers  (2026-06-05T18:00:00Z)
• Magic state distillation with permutation-invariant codes and a two-qubit example [3.437656066916039]
  Magic state distillation protocols aim to create clean copies of magic states from many noisier copies.<n>We present a protocol based on permutation-invariant gnu codes, as small as two qubits.<n>The protocol achieves a 0.5 error threshold and 1/2 distillation rate, surpassing prior schemes for comparable codes.
  arXiv  Detail & Related papers  (2026-03-04T17:27:43Z)
• Distilling Magic States in the Bicycle Architecture [2.0424354398563294]
  Magic State Distillation is considered to be one of the promising methods for supplying the non-Clifford resources required to achieve universal fault tolerance.<n> Conventional MSD protocols implemented in surface codes often require multiple code blocks and lattice surgery rounds, resulting in substantial qubit overhead, especially at low target error rates.
  arXiv  Detail & Related papers  (2026-02-24T04:57:42Z)
• Efficient benchmarking of logical magic state [8.565601028339385]
  We show that benchmarking schemes measuring one copy of the magic state per round requires $Omega (1/epsilon2)$ samples for single-qubit magic states.<n>We propose two approaches to overcome this limitation: (i) Bell measurements on two copies of the twirled state and (ii) single-copy schemes leveraging twirled multi-qubit magic states.
  arXiv  Detail & Related papers  (2025-05-14T18:00:04Z)
• Feedforward suppression of readout-induced faults in quantum error correction [0.0]
  Method consists of an adaptive readout sequence conditioned on each check qubit's readout result from the previous cycle. For readout errors, correlated preparation errors and measurement-induced leakage that are stronger in a particular qubit state, this feedforward protocol can suppress the physical qubit errors.
  arXiv  Detail & Related papers  (2025-04-17T16:50:26Z)
• Universal quantum computation via scalable measurement-free error correction [45.29832252085144]
  We show that universal quantum computation can be made fault-tolerant in a scenario where the error-correction is implemented without mid-circuit measurements. We introduce a measurement-free deformation protocol of the Bacon-Shor code to realize a logical $mathitCCZ$ gate. In particular, our findings support that below-breakeven logical performance is achievable with a circuit-level error rate below $10-3$.
  arXiv  Detail & Related papers  (2024-12-19T18:55:44Z)
• Fault-Tolerant Computing with Single Qudit Encoding [49.89725935672549]
  We discuss stabilizer quantum-error correction codes implemented in a single multi-level qudit. These codes can be customized to the specific physical errors on the qudit, effectively suppressing them. We demonstrate a Fault-Tolerant implementation on molecular spin qudits, showcasing nearly exponential error suppression with only linear qudit size growth.
  arXiv  Detail & Related papers  (2023-07-20T10:51:23Z)
• Demonstrating a long-coherence dual-rail erasure qubit using tunable transmons [59.63080344946083]
  We show that a "dual-rail qubit" consisting of a pair of resonantly coupled transmons can form a highly coherent erasure qubit. We demonstrate mid-circuit detection of erasure errors while introducing $ 0.1%$ dephasing error per check. This work establishes transmon-based dual-rail qubits as an attractive building block for hardware-efficient quantum error correction.
  arXiv  Detail & Related papers  (2023-07-17T18:00:01Z)
• Mitigation of Crosstalk Errors in a Quantum Measurement and Its Applications [1.433758865948252]
  We present a framework for mitigating measurement errors, for both individual and crosstalk errors. The mitigation protocol is realized in IBMQ Sydney and applied to the certification of entanglement-generating circuits.
  arXiv  Detail & Related papers  (2021-12-20T16:20:49Z)
• Experimental Characterization of Fault-Tolerant Circuits in Small-Scale Quantum Processors [67.47400131519277]
  A code's logical gate set may be deemed fault-tolerant for gate sequences larger than 10 gates. Some circuits did not satisfy the fault tolerance criterion. It is most accurate to assess the fault tolerance criterion when the circuits tested are restricted to those that give rise to an output state with a low dimension.
  arXiv  Detail & Related papers  (2021-12-08T01:52:36Z)
• 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)
• Entanglement purification by counting and locating errors with entangling measurements [62.997667081978825]
  We consider entanglement purification protocols for multiple copies of qubit states. We use high-dimensional auxiliary entangled systems to learn about number and positions of errors in the noisy ensemble.
  arXiv  Detail & Related papers  (2020-11-13T19:02:33Z)
• Measurement Error Mitigation in Quantum Computers Through Classical Bit-Flip Correction [1.6872254218310017]
  We develop a classical bit-flip correction method to mitigate measurement errors on quantum computers. This method can be applied to any operator, any number of qubits, and any realistic bit-flip probability.
  arXiv  Detail & Related papers  (2020-07-07T17:52:12Z)
• Cellular automaton decoders for topological quantum codes with noisy measurements and beyond [68.8204255655161]
  We propose an error correction procedure based on a cellular automaton, the sweep rule, which is applicable to a broad range of codes beyond topological quantum codes. For simplicity, we focus on the three-dimensional (3D) toric code on the rhombic dodecahedral lattice with boundaries and prove that the resulting local decoder has a non-zero error threshold. We find that this error correction procedure is remarkably robust against measurement errors and is also essentially insensitive to the details of the lattice and noise model.
  arXiv  Detail & Related papers  (2020-04-15T18:00:01Z)
• Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits [1.2891210250935146]
  We introduce a new concept which we call redundant ancilla encoding. We show that our scheme can produce magic states using an order of magnitude fewer qubits and space-time overhead.
  arXiv  Detail & Related papers  (2020-03-06T06:24:02Z)
• Rigorous measurement error correction [0.0]
  We review an experimental technique used to correct state preparation and measurement errors on gate-based quantum computers. We show how to obtain $Gamma$ from gate set tomography and apply the error correction technique to single IBM Q superconducting qubits.
  arXiv  Detail & Related papers  (2020-02-04T18:58:06Z)

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.