Constant sized support state distillation with qubit recycling

• URL: http://arxiv.org/abs/2609.17044v1
• Date: Tue, 15 Sep 2026 11:52:36 GMT
• Title: Constant sized support state distillation with qubit recycling
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In order to circumvent that no universal set of gates can be achieved on a given quantum error-correcting codes, additional gates can be performed through magic state injection. This however requires to have access to high fidelity magic state, which can be obtained by the distillation of low quality states to fewer higher quality ones. In this paper, we provide a family of distillation protocols able to produce diagonal states at every level of the Clifford hierarchy. This family is obtained recursively using code doubling techniques and leveraging qubit recycling, the fact that some idle qubits of the protocols can be measured and re-used. At a given level of the Clifford hierarchy, we show that the protocols we derive can be performed at arbitrary high distance on a fix number of logical qubits. This family recovers many known efficient protocols, and uncovers new ones, such as a $111 \to 1$ protocol for $|T\rangle$ state distillation at distance $7$, which are the most compact in term of volume. Finally, we discuss possible extension of this framework for distillation protocols producing more than one output state.

Related papers

• 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)
• 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)
• Optimality of universal conclusive entanglement purification protocols [75.52645767671567]
  We establish fundamental limits for conclusive protocols distilling perfect Bell states from a pure two-qubit states.<n>We prove that a known protocol achieves these bounds, confirming its optimality.
  arXiv  Detail & Related papers  (2025-09-11T13:04:17Z)
• 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)
• Improving entanglement purification through coherent superposition of roles [44.99833362998488]
  Entanglement purification and distillation protocols are essential for harnessing the full potential of quantum communication technologies.<n>We introduce a superposed entanglement purification design strategy, leveraging coherent superpositions of the roles of entangled states to enhance purification efficiency.
  arXiv  Detail & Related papers  (2024-08-01T18:00:52Z)
• 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)
• 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)

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.