Physical realization of the measurement-based primitives for universal Majorana (fermionic) quantum computation: nondestructive multi-Majorana parity measurements, ancilla and encoded-state preparation, and their fault-tolerance error models and overheads

Bravyi and Kitaev's foundational model of fermionic quantum computation (Annals of Physics 298, 211 (2002)) showed that a set of gates on Majorana fermion operators containing the four-particle interaction $\exp\!\left(i\tfrac{\pi}{4}c_0c_1c_2c_3\right)$ is universal, that this gate is 'particularly difficult to realize' physically, and that it can be replaced by a measurement-based protocol requiring (i) two-Majorana unitaries, (ii) preparation of ancilla Majorana pairs, (iii) eigenvalue measurements of two Majoranas, and (iv) nondestructive quantum-non-demolition eigenvalue measurements of four Majoranas, with adaptive corrections. Later theory resolved the computational-content side: measurement-only topological quantum computation, Majorana-stabilizer codes such as the Majorana surface and color codes, and improved fermion-to-qubit encodings all exist. What remains open is exactly the question the source paper left open: which of these primitives can be physically realized in candidate experimental platforms (semiconductor-superconductor Majorana nanowire devices, fractional quantum Hall states, and related systems), with what readout fidelities, quasiparticle-poisoning rates, and resource overheads, so that measurement-based fermionic/Majorana quantum computation can be operated fault-tolerantly. As of 2026 only first single-shot parity measurements have been reported (Nature 638, 651 (2025), in InAs-Al hybrid devices, and Nature 650, 334 (2026), in a minimal Kitaev chain); the topological interpretation of the first is disputed in a published exchange (Nature 654, E22 and E27 (2026)), and no fault-tolerant Majorana computation exists.

Background

A local fermionic mode (LFM) is a fermionic site that is either empty or occupied by one fermion; the Fock space of $m$ LFMs has the same dimension as the Hilbert space of $m$ qubits, but under the standard Jordan-Wigner correspondence a single fermionic creation or annihilation operator becomes a Pauli string of length $O(m)$, so simulating one fermionic gate costs $O(m)$ qubit gates. Bravyi and Kitaev (2002) introduced alternative encodings (now called the Bravyi-Kitaev transformation and the 'superfast' or edge-qubit stabilizer encoding) that reduce this cost to $O(\log m)$, and to a constant for geometrically local gates on graphs of bounded degree. A Majorana fermion operator $c_j$ is a Hermitian fermionic operator satisfying $\{c_j,c_k\}=2\delta_{jk}$; each LFM is a pair of Majoranas, $a_k=(c_{2k}+ic_{2k+1})/2$. They proved that the two-gate set $\{\exp(i\tfrac{\pi}{8}c_0c_1),\ \exp(i\tfrac{\pi}{4}c_0c_1c_2c_3)\}$ is universal for quantum computation, and that this cannot be improved: gates acting on three or fewer Majoranas at a time generate only transformations $Uc_jU^{\dagger}=\sum_k\beta_{jk}c_k$ with $\beta\in SO(m)$ (real orthogonal matrices of determinant $+1$), which are not computationally universal. Hence universal Majorana computation unavoidably needs a genuinely four-Majorana interaction or something equivalent to it. Because the four-Majorana interaction exponential is hard to engineer, Section 7 of the same paper showed it can be replaced by a measurement-based protocol: starting from an ancilla pair prepared in an eigenstate of $c_4c_5$ (item 2), one measures the eigenvalue of $c_0c_1c_3c_4$ (item 4, nondestructively) and then of $c_2c_4$ (item 3), applying a measurement-outcome-dependent correction; a measurement is 'nondestructive' (quantum-non-demolition) when vectors in each eigenspace remain intact, i.e. no information beyond the eigenvalue leaks to the environment. The protocol also needs the two-Majorana gate $R=\exp(\tfrac{\pi}{4}c_0c_1)$ (item 1) and adaptive classical processing. On the coding side, the paper observed that stabilizer codes (subspaces fixed by commuting Pauli-type operators) can be described by products of Majorana operators, remarking that 'whether this approach can help to find new codes still remains to be seen'; and on the simulation side it noted that preparing the encoded vacuum-like state $|\xi\rangle$ from $|0\rangle^{\otimes u}$ costs $O(u^2)$ symplectic gates (Clifford-type gates) in its construction, with constant factors, fault-tolerance, and fault-tolerant state preparation left open. The subsequent literature developed three key notions: measurement-only topological quantum computation, in which all gates are produced from topological-charge (fusion-outcome) measurements alone via an anyonic analog of quantum teleportation; quasiparticle poisoning, the random fermion-parity flips caused by uncontrolled quasiparticles, which is the dominant error channel of Majorana devices; and the error threshold, the error rate below which error correction suppresses errors arbitrarily. Majorana surface codes and Majorana color codes are stabilizer codes built from commuting products of Majorana operators, and 'Majorana boxes' or tetrons are superconducting islands each hosting four Majorana zero modes (zero-energy bound states at the ends of topological superconducting wires) whose shared fermion parity stores a qubit.

Problem Statement

Bravyi and Kitaev (2002) reduced universal quantum computation with Majorana fermions to a small set of primitives: the two-Majorana gate $\exp(\tfrac{\pi}{4}c_jc_k)$, preparation of an ancilla Majorana pair in a parity eigenstate, eigenvalue measurements of $c_jc_k$, and nondestructive (quantum-non-demolition) eigenvalue measurements of the four-Majorana parity $c_jc_kc_rc_s$, together with adaptive correction operators; they also left open the efficient, fault-tolerant preparation of the encoded initial states (their vacuum-like code state $|\xi\rangle$ costing $O(u^2)$ symplectic gates) and the constant factors of their fermion-to-qubit encodings. The unresolved problem, stated in the source's own generality and surviving the theoretical developments of the last two decades, is: which of these primitives can be physically realized in candidate experimental platforms for Majorana zero modes (semiconductor-superconductor hybrid nanowires and islands, and analogous topological-superconductor or fractional-quantum-Hall systems), with what measurement fidelities, quasiparticle-poisoning rates, and topological protection, and what error models and resource overheads do the resulting implementations imply for fault-tolerant fermionic or Majorana quantum computation? The question asks to (a) specify a concrete platform and a concrete measurement-and-control protocol for realizing the primitive set — in particular a nondestructive four-Majorana parity measurement and reliable ancilla-pair/encoded-state preparation — and (b) for that platform and protocol, provide an error model together with a fault-tolerance threshold and resource-overhead analysis, in terms of predicted (derived) rather than measured quantities, that determines the readout-fidelity and quasiparticle-poisoning-rate regime under which the primitives support fault-tolerant operation of the measurement-based fermionic computational scheme. Parts (a) and (b) are jointly required: a feasibility survey of which primitives can in principle be realized, or a threshold estimate detached from a specified platform and protocol, is necessary but not sufficient.

References

1. Sergey Bravyi and Alexei Kitaev, 'Fermionic quantum computation', Annals of Physics 298, 211-226 (2002). DOI: 10.1006/aphy.2002.6254; arXiv:quant-ph/0003137. https://arxiv.org/abs/quant-ph/0003137
2. Sergey Bravyi, 'Universal quantum computation with the ν=5/2 fractional quantum Hall state', Physical Review A 73, 042313 (2006). DOI: 10.1103/PhysRevA.73.042313; arXiv:quant-ph/0511178. https://arxiv.org/abs/quant-ph/0511178
3. Parsa Bonderson, Michael H. Freedman, and Chetan Nayak, 'Measurement-Only Topological Quantum Computation', Physical Review Letters 101, 010501 (2008). DOI: 10.1103/PhysRevLett.101.010501; arXiv:0802.0279. https://arxiv.org/abs/0802.0279
4. Sergey Bravyi, Bernhard Leemhuis, and Barbara M. Terhal, 'Majorana Fermion Codes', New Journal of Physics 12, 083039 (2010). DOI: 10.1088/1367-2630/12/8/083039; arXiv:1004.3791. https://arxiv.org/abs/1004.3791
5. Sagar Vijay, Timothy H. Hsieh, and Liang Fu, 'Majorana Fermion Surface Code for Universal Quantum Computation', Physical Review X 5, 041038 (2015). DOI: 10.1103/PhysRevX.5.041038; arXiv:1504.01724. https://arxiv.org/abs/1504.01724
6. Stephan Plugge, Asbjørn Rasmussen, Reinhold Egger, and Karsten Flensberg, 'Majorana box qubits', New Journal of Physics 19, 012001 (2017). DOI: 10.1088/1367-2630/aa54e1; arXiv:1609.01697. https://arxiv.org/abs/1609.01697
7. Torsten Karzig, Christina Knapp, Roman M. Lutchyn, Parsa Bonderson, Matthew B. Hastings, Chetan Nayak, Jason Alicea, Karsten Flensberg, Stephan Plugge, Yuval Oreg, Charles M. Marcus, and Michael H. Freedman, 'Scalable designs for quasiparticle-poisoning-protected topological quantum computation with Majorana zero modes', Physical Review B 95, 235305 (2017). DOI: 10.1103/PhysRevB.95.235305; arXiv:1610.05289. https://arxiv.org/abs/1610.05289
8. Daniel Litinski and Felix von Oppen, 'Quantum computing with Majorana fermion codes', Physical Review B 97, 205404 (2018). DOI: 10.1103/PhysRevB.97.205404; arXiv:1801.08143. https://arxiv.org/abs/1801.08143
9. Kanav Setia, Sergey Bravyi, Antonio Mezzacapo, and James D. Whitfield, 'Superfast encodings for fermionic quantum simulation', Physical Review Research 1, 033033 (2019). DOI: 10.1103/PhysRevResearch.1.033033; arXiv:1810.05274. https://arxiv.org/abs/1810.05274
10. Rui Chao, Michael E. Beverland, Nicolas Delfosse, and Jeongwan Haah, 'Optimization of the surface code design for Majorana-based qubits', Quantum 4, 352 (2020). DOI: 10.22331/q-2020-10-28-352; arXiv:2007.00307. https://arxiv.org/abs/2007.00307
11. Alexander Schuckert, Eleanor Crane, Alexey V. Gorshkov, Mohammad Hafezi, and Michael J. Gullans, 'Fault-tolerant fermionic quantum computing', arXiv:2411.08955 (2024). https://arxiv.org/abs/2411.08955
12. Morteza Aghaee et al. (Microsoft Quantum collaboration), 'Interferometric single-shot parity measurement in InAs-Al hybrid devices', Nature 638, 651-655 (2025). DOI: 10.1038/s41586-024-08445-2; arXiv:2401.09549. https://doi.org/10.1038/s41586-024-08445-2
13. Henry F. Legg, 'On the robustness of topological gap detection via transport' (a Matter Arising on 'Interferometric single-shot parity measurement in InAs-Al hybrid devices'), Nature 654, E22-E26 (2026). DOI: 10.1038/s41586-026-10567-8; preprint arXiv:2503.08944. https://doi.org/10.1038/s41586-026-10567-8
14. Morteza Aghaee et al. (Microsoft Quantum collaboration), 'Reply to: On the robustness of topological gap detection via transport', Nature 654, E27-E28 (2026). DOI: 10.1038/s41586-026-10568-7. https://doi.org/10.1038/s41586-026-10568-7
15. Nick van Loo, Francesco Zatelli, Gorm O. Steffensen, Bart Roovers, Guanzhong Wang, Thomas Van Caekenberghe, Alberto Bordin, David van Driel, Yining Zhang, Wietze D. Huisman, Ghada Badawy, Erik P. A. M. Bakkers, Grzegorz P. Mazur, Ramón Aguado, and Leo P. Kouwenhoven, 'Single-shot parity readout of a minimal Kitaev chain', Nature 650, 334-339 (2026). DOI: 10.1038/s41586-025-09927-7. https://doi.org/10.1038/s41586-025-09927-7
16. David Aasen et al. (Microsoft Quantum collaboration), 'Roadmap to fault tolerant quantum computation using topological qubit arrays', arXiv:2502.12252 (2025). https://arxiv.org/abs/2502.12252