Magic state distillation with permutation-invariant codes and a two-qubit example

• URL: http://arxiv.org/abs/2603.04310v1
• Date: Wed, 04 Mar 2026 17:27:43 GMT
• Title: Magic state distillation with permutation-invariant codes and a two-qubit example
• Abstract summary: 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.
• Score: 3.437656066916039
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Magic states, by allowing non-Clifford gates through gate teleportation, are important building blocks of fault-tolerant quantum computation. Magic state distillation protocols aim to create clean copies of magic states from many noisier copies. However, the prevailing protocols require substantial qubit overhead. We present a distillation protocol based on permutation-invariant gnu codes, as small as two qubits. The two-qubit protocol achieves a 0.5 error threshold and 1/2 distillation rate, surpassing prior schemes for comparable codes. Our protocol furthermore distils magic states with arbitrary magic by varying the position of the ideal input states on the Bloch sphere. We achieve this by departing from the usual magic state distillation formalism, allowing the use of non-Clifford gates in the distillation protocol, and allowing the form of the output state to differ from the input state. Our protocol is compatible for use in tandem with existing magic state distillation protocols to enhance their performance.

Related papers

• Constant sized support state distillation with qubit recycling [0.0]
  We provide a family of protocols able to produce diagonal states at every level of the Clifford hierarchy.<n>We show that the protocols we derive can be performed at arbitrary high distance on a fix number of logical qubits.
  arXiv  Detail & Related papers  (2026-09-15T11:52:36Z)
• Magic Gate Teleportation: Structure, Useful Resource States, and Simpler Feedforward [42.683145133940975]
  We develop a theory of quantum gate teleportation protocols that implement non-Clifford gates on arbitrary input states.<n>We identify conditions under which the feedforward operators can be implemented by Pauli operators.
  arXiv  Detail & Related papers  (2026-07-09T14:03:43Z)
• Efficient Magic State Factory Via Transversal Non-Clifford Gate [1.9038688902168008]
  Magic-state preparation is a central component of fault-tolerant quantum computing.<n>We carry out end-to-end simulations of magic-state preparation using code switching.<n>We propose two fault-tolerant magic-state preparation protocols.
  arXiv  Detail & Related papers  (2026-06-15T04:15:03Z)
• 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)
• Magic state cultivation on a superconducting quantum processor [108.15404500422814]
  We present an experimental study of magic state cultivation on a superconducting quantum processor.<n>Cultivation reduces the error by a factor of 40, with a state fidelity of 0.9999(1).
  arXiv  Detail & Related papers  (2025-12-15T21:29:40Z)
• 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.<n>We introduce a measurement-free deformation protocol of the Bacon-Shor code to realize a logical $mathitCCZ$ gate.<n>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)
• Experimental Demonstration of Logical Magic State Distillation [62.77974948443222]
  We present the experimental realization of magic state distillation with logical qubits on a neutral-atom quantum computer.<n>Our approach makes use of a dynamically reconfigurable architecture to encode and perform quantum operations on many logical qubits in parallel.
  arXiv  Detail & Related papers  (2024-12-19T18:38:46Z)
• Near-term $n$ to $k$ distillation protocols using graph codes [0.0]
  Noisy hardware forms one of the main hurdles to the realization of a near-term quantum internet. We consider here an experimentally relevant class of distillation protocols, which distill $n$ to $k$ end-to-end entangled pairs. We leverage this correspondence to find provably optimal distillation protocols in this class for several tasks important for the quantum internet.
  arXiv  Detail & Related papers  (2023-03-20T21:46:17Z)
• 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)
• Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs. Super-Quantum Encoders [67.12391801199688]
  We investigate dense coding by imposing various locality restrictions to our decoder. In this task, the sender Alice and the receiver Bob share an entangled state.
  arXiv  Detail & Related papers  (2021-09-26T07:29:54Z)
• Enumerating all bilocal Clifford distillation protocols through symmetry reduction [0.0]
  Entanglement distillation is an essential building block in quantum communication protocols. We study the class of near-term implementable distillation protocols that use bilocal Clifford operations. We present circuits that achieve the highest fidelity with perfect operations and no decoherence.
  arXiv  Detail & Related papers  (2021-03-05T13:45:16Z)
• 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 sequences for magic state distillation [0.30458514384586394]
  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.
  arXiv  Detail & Related papers  (2020-07-15T18:17:19Z)
• 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)

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.