Reducing the cost of ancilla purification for Majorana quantum computation
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.
Related
- Proposing one-sided tetrons as topological qubits for Majorana-based quantum computation
- Reducing the Entanglement Cost of Distributed Bipartite Quantum Computation with Constant Qubit Overhead
- Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions
- Evaluation of the quantum Fisher information for large systems via an ancilla
- Generation of arbitrary quantum states in cavity-atom systems with a three-level ancilla
BibTeX
@misc{cwiklinski2026reducing,
title = {{Reducing the cost of ancilla purification for Majorana quantum computation}},
author = {Piotr Ćwikliński and Łukasz Fojcik and Michał Studziński},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.37991},
eprint = {2610.37991},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.37991},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Reducing the cost of ancilla purification for Majorana quantum computation
AU - Piotr {Ć}wikli{ń}ski
AU - Łukasz Fojcik
AU - Michał Studzi{ń}ski
PY - 2026
DA - 2026/10/27
PB - arXiv
DO - 10.48550/arxiv.2610.37991
UR - https://arxiv.org/abs/2610.37991
AB - 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.
ER -