Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2610.37991

Reducing the cost of ancilla purification for Majorana quantum computation

Piotr Ćwikliński, Łukasz Fojcik, Michał Studziński

quant-phcond-mat.str-elSubmitted Oct 27, 2026• Announced Oct 29, 2026• 0 citations• Revised Oct 30, 2026 (v2)
v1 · Oct 27, 2026v2 · Oct 30, 2026
arXivHTMLPDF

Abstract

Braiding Majorana zero modes does not by itself provide a universal set of quantum gates. Additional operations can be supplied through ancillary states, whose preparation need not have the same protection as braiding. Here, we consider purification of the non-Gaussian ancilla used for an entangling gate in Bravyi's scheme. We keep his elementary braid-and-fusion comparison and change how its outputs are combined. An additional layer compares the product of the three stabilizer signs. The first accepted errors giving an incorrect output then require three faulty input blocks rather than two. As a result, the preparation error decreases cubically instead of quadratically, and the asymptotic raw-copy overhead is reduced. We also construct a preliminary sequence in which a processed block is paired with a fresh copy from the same noisy source. For independent inputs supported in the even-parity sector and ideal purification operations, this sequence establishes a sufficient distillability fidelity of 59.95 percent after free Gaussian twirling. At a common source fidelity, it reduces the expected cost of preparing an input for the recurrence by more than seven orders of magnitude relative to the balanced construction studied here. Finally, we examine imperfect purification operations in an effective syndrome-noise model. The additional layer leaves the leading operation-error coefficient unchanged, although a nonzero error floor remains.

AI Summary

The paper studies purification of Bravyi’s eight-Majorana non-Gaussian ancilla, which supplies an entangling Clifford gate; a separate resource is needed for non-Clifford gates. It retains the braid-and-fusion two-copy comparison and changes its composition, using Gaussian frame changes to select stabilizer products while retaining unequal syndrome populations between layers. A fourth layer compares the product of three stabilizers on two independently prepared three-layer outputs. Accepted incorrect outputs then require three faulty raw blocks rather than two, giving $\epsilon_{\mathrm{out}}=(384/343)\epsilon^3+O(\epsilon^4)$. The isotropic recurrence’s unstable fidelity fixed point decreases from $0.61560748$ to $0.60471167$, and its asymptotic expected-copy overhead becomes $O([\log(1/\delta)]^{\log_3 16})$, versus exponent $3$ previously. Integer fault enumerators, exact recurrence polynomials, and root counting establish these claims. A twelve-stage initialization sequence includes one comparison between a processed block and a fresh source copy. Exact rational verification certifies distillability for independent even-parity inputs with target overlap $F\geq0.5995$, after Gaussian twirling. At $F=0.5997$, its expected seed cost is about $1.04\times10^6$ copies, versus $1.76\times10^{13}$ for the stated balanced benchmark; neither construction is proved optimal. Near the certified endpoint, subsequent purification remains costly: the prescribed schedule needs about $2.78\times10^{20}$ copies to reach infidelity $10^{-6}$. An effective syndrome-noise model gives the same leading operation-error floor, $17\lambda/7$, for both recurrences, not a hardware threshold. Costs assume perfect storage and exclude routing and timing. Arbitrary correlated inputs and unconditioned parity noise are not covered. Distillability for the isotropic family remains unresolved between the convex-Gaussian boundary $F=1/2$ and $0.5995$.

Little sign of AI-generated textStrong assumptions

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
21 pages, 3 figures

Related papers

Single-copy entanglement purification: a robust approach for diverse noise sources

Sajede Harraz, Shuang Cong

Effectively managing various types of decoherence is crucial for leveraging entanglement in quantum information processing and quantum computing. In this paper, we propose purification circuits that deterministically produce a maximally entangled state from a single copy of an imperfect entangled pair affected by various noise sources. Unlike conventional methods, our approach eliminates the need for multiple copies of the entangled state, pre-purification operations, and imposes no restrictions on the initial entanglement fidelity of the imperfect pair. Our method utilizes ancilla qubits and CNOT gates to address errors from Pauli X and Z (bit flip and phase flip), as well as combinations of these errors that create general mixed entangled states and amplitude-damped entangled states. Our analysis shows that noisy CNOT gates impact fidelity minimally, with only the final two gates being critical. We validate our approach through mathematical analysis and practical implementation in Qiskit, demonstrating its effectiveness and robustness.

EPJ Quantum Technology•Apr 1, 2025•1 citation

The power of noisy fermionic quantum computation

Fernando de Melo, Piotr Ćwikliński, Barbara M. Terhal

We consider the realization of universal quantum computation through braiding of Majorana fermions supplemented by unprotected preparation of noisy ancillae. It has been shown by Bravyi (2006 Phys. Rev. A 73 042313) that under the assumption of perfect braiding operations, universal quantum computation is possible if the noise rate on a particular four-fermion ancilla is below 40%. We show that beyond a noise rate of 89% on this ancilla the quantum computation can be efficiently simulated classically: we explicitly show that the noisy ancilla is a convex mixture of Gaussian fermionic states in this region, while for noise rates below 53% we prove that the state is not a mixture of Gaussian states. These results are obtained by generalizing concepts in entanglement theory to the setting of Gaussian states and their convex mixtures. In particular, we develop a complete set of criteria, namely the existence of a Gaussian-symmetric extension, which determine whether a state is a convex mixture of Gaussian states.

arXiv:1208.5334•New Journal of Physics•Jan 9, 2013•49 citations

Nearly Optimal T-Count for Symmetry-Based Quantum State Purification

Jialiang Tang, Junhong Nie, Keming He +2 more

Protecting quantum information from noise is essential for reliable quantum computation and quantum memories. Quantum state purification addresses this challenge by processing multiple noisy copies of an unknown quantum state to produce an output state of higher fidelity. Here we establish nearly tight upper and lower bounds on the non-Clifford resources required to implement the symmetric-projection purification protocol. For $n$ copies of a $d$-dimensional system, we construct a Clifford+T circuit that block-encodes the symmetric projector with operator-norm error at most $ε$ using $\widetilde{O}(n)$ T gates, where the tilde-$O$ notation suppresses polylogarithmic factors in $n$, $d$, and $1/ε$. Conversely, using stabilizer nullity, we prove that any Clifford+T implementation of such a block encoding with error $ε<\frac{1}{2}\sqrt{1-1/n}$ requires at least $2n-2$ T gates, even allowing arbitrary positive normalization and clean stabilizer ancillas. Taken together, these results establish the nearly optimal scaling of non-Clifford cost with the number of copies and uncover the fundamental resource requirements for coherent symmetry projection in quantum state purification.

quant-pharXiv:2610.12098•Oct 9, 2026•0 citations

Extremely Low-Cost Magic State Preparation toward Fault-Tolerant Quantum Computing

Jianshuo Gao, Xiao Yuan, Yuan Yao

Fault-tolerant preparation of non-Clifford resource states is a major contributor to the overhead of quantum computation, motivating protocols that achieve high output fidelity with minimal qubit and circuit costs. We introduce a low-cost magic-state preparation protocol in which the choice of stabilizer generators is co-designed with the flag gadgets, allowing the syndrome-extraction circuit itself to filter correlated faults across a non-Clifford layer. The protocol prepares a logical plus state in the 15-qubit quantum Reed-Muller code, applies a transversal T gate, and gauge-fixes the same register into the seven-qubit Steane code. By reorganizing equivalent Z-type stabilizer generators into jointly flagged measurement groups, the protocol eliminates all accepted logical-error contributions arising from one or two circuit faults under destructive error detection. Under a uniform circuit-level depolarizing noise model, the postselected infidelity is $210.2p^3+O(p^4)$. At $p=10^{-3}$, exact low-order enumeration combined with stratified sampling bounds the infidelity by $2.2\times10^{-7}$ at 99.9% joint confidence, while retaining an acceptance probability of 86.9%. The complete circuit requires only 19 qubits and 82 CNOT gates. These results demonstrate that stabilizer-generator design can substantially reduce the cost of postselected magic-state preparation, although corrected operation and the fidelity of an unmeasured output block require separate analysis.

quant-pharXiv:2609.12698•Sep 14, 2026•0 citations

Universal quantum computation with ideal Clifford gates and noisy ancillas

Sergey B. Bravyi, Alexei Kitaev

We consider a model of quantum computation in which the set of elementary operations is limited to Clifford unitaries, the creation of the state $\ensuremath{\mid}0⟩$, and qubit measurement in the computational basis. In addition, we allow the creation of a one-qubit ancilla in a mixed state $\ensuremath{\rho}$, which should be regarded as a parameter of the model. Our goal is to determine for which $\ensuremath{\rho}$ universal quantum computation (UQC) can be efficiently simulated. To answer this question, we construct purification protocols that consume several copies of $\ensuremath{\rho}$ and produce a single output qubit with higher polarization. The protocols allow one to increase the polarization only along certain ``magic'' directions. If the polarization of $\ensuremath{\rho}$ along a magic direction exceeds a threshold value (about 65%), the purification asymptotically yields a pure state, which we call a magic state. We show that the Clifford group operations combined with magic states preparation are sufficient for UQC. The connection of our results with the Gottesman-Knill theorem is discussed.

arXiv:quant-ph/0403025•Physical Review A•Feb 22, 2005•1,818 citations

Distilling Qubit Unitary Operations: A No-Go Theorem and Minimal Realization

Jiayi Zhao, Yu-Ao Chen, Guocheng Zhen +3 more

Quantum gates executed on physical hardware are inevitably degraded by environmental noise. While state purification effectively distills static quantum resources, the dynamic execution of quantum algorithms requires a higher-order approach to mitigate errors on the operations themselves. In this work, we investigate universal unitary purification: the task of utilizing a quantum higher-order operation to partially restore the ideal action of an unknown unitary corrupted by a known noise model. We consider deterministic purification of unknown single-qubit unitaries under independent depolarizing noise with ideal auxiliary operations. We prove that within the indefinite causal order (ICO) framework, no nontrivial 2-slot higher-order operation can universally purify the set of single-qubit unitaries. Overcoming this strict limitation, we establish that a 3-slot parallel architecture provides the minimal realization for nontrivial purification. We analytically derive the optimal average fidelity over all 3-slot ICO strategies and show that a parallel strategy attains it, strictly surpassing trivial strategies through input encoding and joint decoding of the channel outputs and a quantum memory. Furthermore, we provide a concrete quantum circuit construction attaining this optimum. Our results clarify the possibilities and limitations of purifying unknown qubit unitaries under depolarizing noise, offering insights for robust gate design.

quant-pharXiv:2604.01048•Apr 2, 2026•3 citations
Braiding Majorana zero modes does not by itself provide a universal set of quantum gates. Additional operations can be supplied through ancillary states, whose preparation need not have the same protection as braiding. Here, we consider purification of the non-Gaussian ancilla used for an entangling gate in Bravyi's scheme. We keep his elementary braid-and-fusion comparison and change how its outputs are combined. An additional layer compares the product of the three stabilizer signs. The first accepted errors giving an incorrect output then require three faulty input blocks rather than two. As a result, the preparation error decreases cubically instead of quadratically, and the asymptotic raw-copy overhead is reduced. We also construct a preliminary sequence in which a processed block is paired with a fresh copy from the same noisy source. For independent inputs supported in the even-parity sector and ideal purification operations, this sequence establishes a sufficient distillability fidelity of 59.95 percent after free Gaussian twirling. At a common source fidelity, it reduces the expected cost of preparing an input for the recurrence by more than seven orders of magnitude relative to the balanced construction studied here. Finally, we examine imperfect purification operations in an effective syndrome-noise model. The additional layer leaves the leading operation-error coefficient unchanged, although a nonzero error floor remains.
The paper studies purification of Bravyi’s eight-Majorana non-Gaussian ancilla, which supplies an entangling Clifford gate; a separate resource is needed for non-Clifford gates. It retains the braid-and-fusion two-copy comparison and changes its composition, using Gaussian frame changes to select stabilizer products while retaining unequal syndrome populations between layers.
A fourth layer compares the product of three stabilizers on two independently prepared three-layer outputs. Accepted incorrect outputs then require three faulty raw blocks rather than two, giving ϵout=(384/343)ϵ3+O(ϵ4)\epsilon_{\mathrm{out}}=(384/343)\epsilon^3+O(\epsilon^4)ϵout​=(384/343)ϵ3+O(ϵ4). The isotropic recurrence’s unstable fidelity fixed point decreases from 0.615607480.615607480.61560748 to 0.604711670.604711670.60471167, and its asymptotic expected-copy overhead becomes O([log⁡(1/δ)]log⁡316)O([\log(1/\delta)]^{\log_3 16})O([log(1/δ)]log3​16), versus exponent 333 previously. Integer fault enumerators, exact recurrence polynomials, and root counting establish these claims.
A twelve-stage initialization sequence includes one comparison between a processed block and a fresh source copy. Exact rational verification certifies distillability for independent even-parity inputs with target overlap F≥0.5995F\geq0.5995F≥0.5995, after Gaussian twirling. At F=0.5997F=0.5997F=0.5997, its expected seed cost is about 1.04×1061.04\times10^61.04×106 copies, versus 1.76×10131.76\times10^{13}1.76×1013 for the stated balanced benchmark; neither construction is proved optimal. Near the certified endpoint, subsequent purification remains costly: the prescribed schedule needs about 2.78×10202.78\times10^{20}2.78×1020 copies to reach infidelity 10−610^{-6}10−6.
An effective syndrome-noise model gives the same leading operation-error floor, 17λ/717\lambda/717λ/7, for both recurrences, not a hardware threshold. Costs assume perfect storage and exclude routing and timing. Arbitrary correlated inputs and unconditioned parity noise are not covered. Distillability for the isotropic family remains unresolved between the convex-Gaussian boundary F=1/2F=1/2F=1/2 and 0.59950.59950.5995.
Effectively managing various types of decoherence is crucial for leveraging entanglement in quantum information processing and quantum computing. In this paper, we propose purification circuits that deterministically produce a maximally entangled state from a single copy of an imperfect entangled pair affected by various noise sources. Unlike conventional methods, our approach eliminates the need for multiple copies of the entangled state, pre-purification operations, and imposes no restrictions on the initial entanglement fidelity of the imperfect pair. Our method utilizes ancilla qubits and CNOT gates to address errors from Pauli X and Z (bit flip and phase flip), as well as combinations of these errors that create general mixed entangled states and amplitude-damped entangled states. Our analysis shows that noisy CNOT gates impact fidelity minimally, with only the final two gates being critical. We validate our approach through mathematical analysis and practical implementation in Qiskit, demonstrating its effectiveness and robustness.
We consider the realization of universal quantum computation through braiding of Majorana fermions supplemented by unprotected preparation of noisy ancillae. It has been shown by Bravyi (2006 Phys. Rev. A 73 042313) that under the assumption of perfect braiding operations, universal quantum computation is possible if the noise rate on a particular four-fermion ancilla is below 40%. We show that beyond a noise rate of 89% on this ancilla the quantum computation can be efficiently simulated classically: we explicitly show that the noisy ancilla is a convex mixture of Gaussian fermionic states in this region, while for noise rates below 53% we prove that the state is not a mixture of Gaussian states. These results are obtained by generalizing concepts in entanglement theory to the setting of Gaussian states and their convex mixtures. In particular, we develop a complete set of criteria, namely the existence of a Gaussian-symmetric extension, which determine whether a state is a convex mixture of Gaussian states.
Protecting quantum information from noise is essential for reliable quantum computation and quantum memories. Quantum state purification addresses this challenge by processing multiple noisy copies of an unknown quantum state to produce an output state of higher fidelity. Here we establish nearly tight upper and lower bounds on the non-Clifford resources required to implement the symmetric-projection purification protocol. For nnn copies of a ddd-dimensional system, we construct a Clifford+T circuit that block-encodes the symmetric projector with operator-norm error at most εεε using O~(n)\widetilde{O}(n)O(n) T gates, where the tilde-OOO notation suppresses polylogarithmic factors in nnn, ddd, and 1/ε1/ε1/ε. Conversely, using stabilizer nullity, we prove that any Clifford+T implementation of such a block encoding with error ε<121−1/nε<\frac{1}{2}\sqrt{1-1/n}ε<21​1−1/n​ requires at least 2n−22n-22n−2 T gates, even allowing arbitrary positive normalization and clean stabilizer ancillas. Taken together, these results establish the nearly optimal scaling of non-Clifford cost with the number of copies and uncover the fundamental resource requirements for coherent symmetry projection in quantum state purification.
Fault-tolerant preparation of non-Clifford resource states is a major contributor to the overhead of quantum computation, motivating protocols that achieve high output fidelity with minimal qubit and circuit costs. We introduce a low-cost magic-state preparation protocol in which the choice of stabilizer generators is co-designed with the flag gadgets, allowing the syndrome-extraction circuit itself to filter correlated faults across a non-Clifford layer. The protocol prepares a logical plus state in the 15-qubit quantum Reed-Muller code, applies a transversal T gate, and gauge-fixes the same register into the seven-qubit Steane code. By reorganizing equivalent Z-type stabilizer generators into jointly flagged measurement groups, the protocol eliminates all accepted logical-error contributions arising from one or two circuit faults under destructive error detection. Under a uniform circuit-level depolarizing noise model, the postselected infidelity is 210.2p3+O(p4)210.2p^3+O(p^4)210.2p3+O(p4). At p=10−3p=10^{-3}p=10−3, exact low-order enumeration combined with stratified sampling bounds the infidelity by 2.2×10−72.2\times10^{-7}2.2×10−7 at 99.9% joint confidence, while retaining an acceptance probability of 86.9%. The complete circuit requires only 19 qubits and 82 CNOT gates. These results demonstrate that stabilizer-generator design can substantially reduce the cost of postselected magic-state preparation, although corrected operation and the fidelity of an unmeasured output block require separate analysis.
We consider a model of quantum computation in which the set of elementary operations is limited to Clifford unitaries, the creation of the state $\ensuremath{\mid}0⟩$, and qubit measurement in the computational basis. In addition, we allow the creation of a one-qubit ancilla in a mixed state $\ensuremath{\rho}$, which should be regarded as a parameter of the model. Our goal is to determine for which $\ensuremath{\rho}$ universal quantum computation (UQC) can be efficiently simulated. To answer this question, we construct purification protocols that consume several copies of $\ensuremath{\rho}$ and produce a single output qubit with higher polarization. The protocols allow one to increase the polarization only along certain ``magic'' directions. If the polarization of $\ensuremath{\rho}$ along a magic direction exceeds a threshold value (about 65%), the purification asymptotically yields a pure state, which we call a magic state. We show that the Clifford group operations combined with magic states preparation are sufficient for UQC. The connection of our results with the Gottesman-Knill theorem is discussed.
Quantum gates executed on physical hardware are inevitably degraded by environmental noise. While state purification effectively distills static quantum resources, the dynamic execution of quantum algorithms requires a higher-order approach to mitigate errors on the operations themselves. In this work, we investigate universal unitary purification: the task of utilizing a quantum higher-order operation to partially restore the ideal action of an unknown unitary corrupted by a known noise model. We consider deterministic purification of unknown single-qubit unitaries under independent depolarizing noise with ideal auxiliary operations. We prove that within the indefinite causal order (ICO) framework, no nontrivial 2-slot higher-order operation can universally purify the set of single-qubit unitaries. Overcoming this strict limitation, we establish that a 3-slot parallel architecture provides the minimal realization for nontrivial purification. We analytically derive the optimal average fidelity over all 3-slot ICO strategies and show that a parallel strategy attains it, strictly surpassing trivial strategies through input encoding and joint decoding of the channel outputs and a quantum memory. Furthermore, we provide a concrete quantum circuit construction attaining this optimum. Our results clarify the possibilities and limitations of purifying unknown qubit unitaries under depolarizing noise, offering insights for robust gate design.