Skip to content
aiqbench takeQuantum Computing

aiqbench analysis

This research introduces a family of magic state distillation protocols that utilize qubit recycling and code doubling to operate at arbitrary distances with a fixed number of logical qubits. By reusing idle qubits, these methods achieve high fidelity states more compactly than previous approaches, directly addressing resource constraints in fault-tolerant quantum computing. The work advances the practical efficiency of magic state injection, a critical component for realizing universal quantum gates on error-corrected hardware.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Constant sized support state distillation with qubit recycling

arXiv2 min read

arXiv:2609.17044v1 Announce Type: new 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.

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.

arXiv:2609.17044 [quant-ph]

(or arXiv:2609.17044v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2609.17044 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 275 words

Related coverage