pith. sign in

arxiv: 2508.10106 · v2 · submitted 2025-08-13 · 🪐 quant-ph · cond-mat.mes-hall

Majorana braiding simulations with projective measurements

Pith reviewed 2026-05-18 22:33 UTC · model grok-4.3

classification 🪐 quant-ph cond-mat.mes-hall
keywords Majorana zero modestopological quantum computationbraidingprojective parity measurementsPfaffian formalismnanowire networksdisorderhybridization
0
0 comments X

The pith

The time-dependent Pfaffian formalism enables classical simulation of Majorana braiding, projective parity measurements, and hybridization in disordered nanowire networks.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper lays out the theoretical ingredients needed for universal topological quantum computation with Majorana zero modes, stressing both sparse and dense qubit encodings and the use of projective parity measurements to switch between them. These operations, when combined with hybridization, move the system past what braiding alone can achieve and produce a complete gate set. The central contribution is an efficient numerical technique that extends the time-dependent Pfaffian formalism to handle the full dynamics, including measurements and disorder, so that realistic device layouts can be simulated classically. This approach supplies both a compact overview of the underlying Majorana algebra and stabilizer rules and a practical computational tool for exploring such platforms.

Core claim

The time-dependent Pfaffian formalism can be extended to simulate the full time-dependent dynamics of Majorana networks that include braiding operations, projective parity measurements, hybridization, and disorder while remaining computationally tractable and faithful to the underlying Majorana operator algebra.

What carries the argument

The time-dependent Pfaffian formalism, which tracks the evolution of the system's Pfaffian under time-dependent Hamiltonians and measurement operators to compute observables and state updates efficiently.

If this is right

  • Realistic device architectures containing both sparse and dense logical qubits can be simulated classically without truncating the Hilbert space.
  • Transitions between encodings via projective parity measurements can be modeled together with braiding and hybridization in a single framework.
  • Disorder effects on gate fidelity and measurement outcomes become accessible for quantitative study.
  • The method supplies a concrete numerical testbed for checking whether a proposed network layout supports a universal gate set.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same simulation engine could be used to benchmark the overhead of measurement-based error correction protocols in Majorana hardware.
  • Design iterations for nanowire networks could be accelerated by using the method to screen many candidate layouts before fabrication.
  • Extension to time-dependent noise models beyond static disorder would be a natural next step for the formalism.

Load-bearing premise

The Pfaffian formalism can be extended to projective parity measurements and hybridization while staying both accurate to the Majorana dynamics and computationally efficient even when disorder is present.

What would settle it

Direct numerical comparison of the simulated parity outcomes or braiding fidelities against an exact diagonalization result for a small disordered network that includes at least one projective measurement step; systematic deviation beyond numerical tolerance would falsify the extension.

Figures

Figures reproduced from arXiv: 2508.10106 by Eric Mascot, Philipp Frey, Stephan Rachel, Themba Hodge.

Figure 1
Figure 1. Figure 1: FIG. 1. Schematic of the sparse encoding for a single qubit, [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: FIG. 2. Schematic of the dense encoding for two qubits, with [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: FIG. 3. Schematic of the sparse to dense projection process. [PITH_FULL_IMAGE:figures/full_fig_p007_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: FIG. 4. Glossary of braids in the even parity subspace, all im [PITH_FULL_IMAGE:figures/full_fig_p008_4.png] view at source ↗
read the original abstract

We summarize the key ingredients required for universal topological quantum computation using Majorana zero modes in networks of topological superconductor nanowires. Particular emphasis is placed on the use of both sparse and dense logical qubit encodings, and on the transitions between them via projective parity measurements. Combined with hybridization, these operations extend the computational capabilities beyond braiding alone and enable universal gate sets. In addition to outlining the theoretical foundations-including the algebra of Majorana operators, along with the stabilizer formalism-we introduce an efficient numerical method for simulating the time-dependent dynamics of such systems. This method, based on the time dependent Pfaffian formalism, allows for the classical simulation of realistic device architectures that incorporate braiding, projective measurements, and disorder. The result is a semi-pedagogical overview and computational toolbox designed to support further exploration of topological quantum computing platforms.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 2 minor

Summary. The manuscript outlines key theoretical ingredients for universal topological quantum computation with Majorana zero modes in nanowire networks, with emphasis on sparse and dense logical encodings, transitions between them via projective parity measurements combined with hybridization, and the underlying Majorana algebra and stabilizer formalism. It introduces an efficient classical simulation method based on the time-dependent Pfaffian formalism that is claimed to handle braiding, projective measurements, and disorder in realistic device architectures.

Significance. If the numerical method is shown to be faithful and scalable, the work would supply a useful semi-pedagogical overview together with a practical computational toolbox for exploring measurement-based operations and disorder effects in Majorana platforms, thereby extending simulation capabilities beyond pure braiding protocols.

major comments (1)
  1. [Numerical method / time-dependent Pfaffian section] The section introducing the time-dependent Pfaffian formalism (around the description of the numerical method) does not provide an explicit update rule for the post-measurement state after a projective parity measurement on a Majorana pair, nor does it demonstrate numerical stability or benchmark the update against exact diagonalization on small disordered systems; this step is load-bearing for the central claim that the formalism remains efficient and faithful when projective measurements and disorder are included.
minor comments (2)
  1. [Abstract and Introduction] The abstract and introduction could more sharply separate the review of established Majorana algebra from the novel simulation contributions.
  2. [Theoretical foundations] Notation for the Pfaffian overlaps and the stabilizer generators would benefit from a short dedicated table or explicit definitions early in the text.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their careful reading of the manuscript and for the constructive comment on the numerical method. We address the point in detail below and have revised the manuscript to incorporate the requested clarifications and benchmarks.

read point-by-point responses
  1. Referee: The section introducing the time-dependent Pfaffian formalism (around the description of the numerical method) does not provide an explicit update rule for the post-measurement state after a projective parity measurement on a Majorana pair, nor does it demonstrate numerical stability or benchmark the update against exact diagonalization on small disordered systems; this step is load-bearing for the central claim that the formalism remains efficient and faithful when projective measurements and disorder are included.

    Authors: We agree that an explicit update rule for the post-measurement state and supporting benchmarks would strengthen the presentation of the time-dependent Pfaffian method. In the revised manuscript we have added a dedicated subsection that derives the update rule for the Pfaffian after a projective parity measurement on a Majorana pair, obtained by applying the corresponding projector to the underlying quadratic Hamiltonian and recomputing the Pfaffian of the resulting skew-symmetric matrix. We have also included a new benchmark subsection that compares the time-dependent Pfaffian evolution against exact diagonalization on small disordered nanowire segments (up to 8 Majorana modes) for both braiding sequences and sequences that include projective parity measurements. The comparisons confirm agreement to machine precision in the absence of disorder and show that the method remains stable and accurate for moderate disorder strengths, thereby supporting the claim that the formalism remains efficient and faithful when measurements and disorder are included. revision: yes

Circularity Check

0 steps flagged

No significant circularity in derivation chain

full rationale

The paper presents a numerical method as an extension of the established time-dependent Pfaffian formalism to incorporate projective parity measurements, hybridization, braiding, and disorder. The central claim rests on standard Majorana operator algebra, stabilizer formalism, and known Pfaffian overlap techniques applied to new operations, without any equations or steps that reduce the claimed simulation capability to a fitted parameter, self-referential definition, or self-citation chain. The derivation is self-contained as a computational toolbox with independent content for classical simulation of the described architectures.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central contribution rests on standard Majorana operator algebra and the stabilizer formalism drawn from prior literature. No new free parameters are introduced in the abstract description, and the simulation method itself does not postulate additional entities.

axioms (2)
  • standard math Majorana operators satisfy the canonical anticommutation relations {γ_i, γ_j} = 2δ_ij
    Invoked in the theoretical foundations section to define the algebra of Majorana zero modes.
  • domain assumption The stabilizer formalism correctly describes the logical qubit encodings and parity measurements in the nanowire networks
    Used to analyze transitions between sparse and dense encodings via projective measurements.

pith-pipeline@v0.9.0 · 5667 in / 1432 out tokens · 49480 ms · 2026-05-18T22:33:40.638111+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

57 extracted references · 57 canonical work pages · 1 internal anchor

  1. [1]

    A single braid has entangled the two logical qubits. In general, a sequence of braids will map the initial set of stabilizers by permut- ing the Majorana indices, changing signs of parities and possibly multiplying the state by a phase factor: 4 (−iγ1γ2) , . . . , (−iγ2N −1γ2N) 7→ (±iγσ(1)γσ(2)), . . . ,(±iγσ(2N −1)γσ(2N)) (19) Similar to the parity iγiγj...

  2. [2]

    To achieve universal quantum computation this gate set would have to be extended to include, say, arbitrary phase gates Rz(ϕ) = exp( −iϕZ/2) with arbi- trary angle ϕ

    Combined with the relations √ Y ∝ √ X −1√ Z √ X and H ∝ √ X √ Z √ X we find that we can implement any single-qubit Clifford gate via braiding. To achieve universal quantum computation this gate set would have to be extended to include, say, arbitrary phase gates Rz(ϕ) = exp( −iϕZ/2) with arbi- trary angle ϕ. This might be achievable if one makes use of hy...

  3. [3]

    Hybridization We now consider an extension of the braid group by making use of the hybridization between Majoranas [1, 6– 10, 30]. While the zero-energy space H0 is exactly de- generate in the limit where all Majorana particles are infinitely distant from each other, this degeneracy is gen- erally lifted when the separation is finite. In particular, when ...

  4. [4]

    Nayak, S

    C. Nayak, S. H. Simon, A. Stern, M. Freedman, and S. D. Sarma, Non-Abelian anyons and topological quan- tum computation, Rev. Mod. Phys. 80, 1083 (2008)

  5. [5]

    Alicea, New directions in the pursuit of Majorana fermions in solid state systems, Rep

    J. Alicea, New directions in the pursuit of Majorana fermions in solid state systems, Rep. Prog. Phys. 75, 076501 (2012)

  6. [6]

    Aasen, M

    D. Aasen, M. Hell, R. V. Mishmash, A. Higginbotham, J. Danon, M. Leijnse, T. S. Jespersen, J. A. Folk, C. M. Marcus, K. Flensberg, and J. Alicea, Milestones toward Majorana-based quantum computing, Phys. Rev. X 6, 031016 (2016)

  7. [7]

    S. R. Elliott and M. Franz, Colloquium: Majorana fermions in nuclear, particle, and solid-state physics, Rev. Mod. Phys. 87, 137 (2015)

  8. [8]

    C. W. J. Beenakker, Search for Majorana fermions in superconductors, Rev. Cond. Mat. 4, 113 (2013)

  9. [9]

    A. Y. Kitaev, Unpaired Majorana fermions in quantum wires, Physics-Uspekhi 44, 131 (2001)

  10. [10]

    D. A. Ivanov, Non-Abelian statistics of half-quantum vor- tices in p-wave superconductors, Phys. Rev. Lett.86, 268 (2001)

  11. [11]

    Alicea, Y

    J. Alicea, Y. Oreg, G. Refael, F. von Oppen, and M. P. A. Fisher, Non-Abelian statistics and topological quantum information processing in 1D wire networks, Nat. Phys. 7, 412 (2011)

  12. [12]

    Karzig, C

    T. Karzig, C. Knapp, R. M. Lutchyn, P. Bonder- son, M. B. Hastings, C. Nayak, J. Alicea, K. Flens- berg, S. Plugge, Y. Oreg, C. M. Marcus, and M. H. Freedman, Scalable designs for quasiparticle-poisoning- protected topological quantum computation with Majo- rana zero modes, Phys. Rev. B 95, 235305 (2017)

  13. [13]

    Plugge, A

    S. Plugge, A. Rasmussen, R. Egger, and K. Flensberg, Majorana box qubits, New J. Phys. 19, 012001 (2017)

  14. [14]

    Bravyi, Universal quantum computation with the ν = 5/2 fractional quantum Hall state, Phys

    S. Bravyi, Universal quantum computation with the ν = 5/2 fractional quantum Hall state, Phys. Rev. A 73, 042313 (2006)

  15. [15]

    Mascot, T

    E. Mascot, T. Hodge, D. Crawford, J. Bedow, D. K. Morr, and S. Rachel, Many-body Majorana braiding without an exponential Hilbert space, Phys. Rev. Lett. 131, 176601 (2023)

  16. [16]

    Hodge, E

    T. Hodge, E. Mascot, D. Crawford, and S. Rachel, Char- acterizing dynamic hybridization of Majorana zero modes for universal quantum computing, Phys. Rev. Lett. 134, 096601 (2025)

  17. [17]

    Bonderson, D

    P. Bonderson, D. J. Clarke, C. Nayak, and K. Shtengel, Implementing arbitrary phase gates with Ising anyons, Phys. Rev. Lett. 104, 180505 (2010)

  18. [18]

    Lahtinen and J

    V. Lahtinen and J. K. Pachos, A Short Introduction to Topological Quantum Computation, SciPost Phys.3, 021 (2017)

  19. [19]

    Hodge, P

    T. Hodge, P. Frey, and S. Rachel, Projective measure- ments: Topological quantum computing with an arbi- trary number of qubits (2025), arXiv:2508.xxxxx

  20. [20]

    Wimmer, Algorithm 923: Efficient numerical com- putation of the Pfaffian for dense and banded skew- symmetric matrices, ACM Trans

    M. Wimmer, Algorithm 923: Efficient numerical com- putation of the Pfaffian for dense and banded skew- symmetric matrices, ACM Trans. Math. Softw. 38, 30 (2012)

  21. [21]

    S. D. Sarma, M. Freedman, and C. Nayak, Majorana zero modes and topological quantum computation, npj Quantum Inf 1, 15001 (2015)

  22. [22]

    Field and T

    B. Field and T. Simula, Introduction to topological quan- tum computation with non-Abelian anyons, Quantum Sci. Technol. 3, 045004 (2018)

  23. [23]

    Bravyi and A

    S. Bravyi and A. Kitaev, Fermionic quantum computa- tion, Ann. Phys. 298, 210 (2002)

  24. [24]

    Vijay, T

    S. Vijay, T. H. Hsieh, and L. Fu, Majorana fermion sur- face code for universal quantum computation, Phys. Rev. X 5, 041038 (2015)

  25. [25]

    Litinski and F

    D. Litinski and F. von Oppen, Quantum computing with Majorana fermion codes, Phys. Rev. B97, 205404 (2018)

  26. [26]

    Gottesman, Stabilizer Codes and Quantum Error Cor- rection, Ph.D

    D. Gottesman, Stabilizer Codes and Quantum Error Cor- rection, Ph.D. thesis, California Institute of Technology (1997)

  27. [27]

    Mudassar, R

    M. Mudassar, R. W. Chien, and D. Gottesman, Encoding Majorana codes, Phys. Rev. A 110, 032430 (2024)

  28. [28]

    Aaronson and D

    S. Aaronson and D. Gottesman, Improved simulation of stabilizer circuits, Phys. Rev. A 70, 052328 (2004)

  29. [29]

    The Heisenberg Representation of Quantum Computers

    D. Gottesman, The Heisenberg representation of quan- tum computers (1998), arXiv:quant-ph/9807006 [quant- ph]

  30. [30]

    Bravyi and A

    S. Bravyi and A. Kitaev, Universal quantum computa- tion with ideal Clifford gates and noisy ancillas, Phys. Rev. A 71, 022316 (2005), https://arxiv.org/abs/ quant-ph/0403025

  31. [31]

    Bravyi, B

    S. Bravyi, B. M. Terhal, and B. Leemhuis, Majorana fermion codes, New J. Phys. 12, 083039 (2010)

  32. [32]

    Bonderson, M

    P. Bonderson, M. Freedman, and C. Nayak, Measurement-only topological quantum computation, Phys. Rev. Lett. 101, 010501 (2008)

  33. [33]

    S. M. Albrecht, A. P. Higginbotham, M. Madsen, F. Kuemmeth, T. S. Jespersen, J. Nyg˚ ard, P. Krogstrup, and C. M. Marcus, Exponential protection of zero modes in Majorana islands, Nature 531, 206 (2016)

  34. [34]

    Cheng, V

    M. Cheng, V. Galitski, and S. Das Sarma, Nonadiabatic effects in the braiding of non-Abelian anyons in topolog- ical superconductors, Phys. Rev. B 84, 104529 (2011)

  35. [35]

    Zhan, G.-D

    Y.-M. Zhan, G.-D. Mao, Y.-G. Chen, Y. Yu, and X. Luo, Dissipationless topological quantum computation for Ma- jorana objects in sparse-dense mixed encoding process, Phys. Rev. A 110, 022609 (2024)

  36. [36]

    Zhan, Y.-G

    Y.-M. Zhan, Y.-G. Chen, B. Chen, Z. Wang, Y. Yu, and X. Luo, Universal topological quantum computation with strongly correlated Majorana edge modes, New J. Phys. 24, 043009 (2022)

  37. [37]

    Harper, A

    F. Harper, A. Pushp, and R. Roy, Majorana braiding in realistic nanowire Y-junctions and tuning forks, Phys. Rev. Res. 1, 033207 (2019)

  38. [38]

    Sanno, S

    T. Sanno, S. Miyazaki, T. Mizushima, and S. Fujimoto, Ab initio simulation of non-Abelian braiding statistics in topological superconductors, Phys. Rev. B 103, 054504 (2021)

  39. [39]

    Bedow, E

    J. Bedow, E. Mascot, T. Hodge, S. Rachel, and D. K. 13 Morr, Simulating topological quantum gates in two- dimensional magnet-superconductor hybrid structures., npj Quantum Mater 9, 99 (2024)

  40. [40]

    Peeters, T

    C. Peeters, T. Hodge, E. Mascot, and S. Rachel, Effect of impurities and disorder on the braiding dynamics of Majorana zero modes, Phys. Rev. B 110, 214506 (2024)

  41. [41]

    P. W. Brouwer, M. Duckheim, A. Romito, and F. von Op- pen, Probability distribution of Majorana end-state en- ergies in disordered wires, Phys. Rev. Lett. 107, 196804 (2011)

  42. [42]

    M. S. Scheurer and A. Shnirman, Nonadiabatic processes in Majorana qubit systems, Phys. Rev. B 88, 064515 (2013)

  43. [43]

    Knapp, M

    C. Knapp, M. Zaletel, D. E. Liu, M. Cheng, P. Bonder- son, and C. Nayak, The nature and correction of diabatic errors in anyon braiding, Phys. Rev. X 6, 041003 (2016)

  44. [44]

    Karzig, W

    T. Karzig, W. S. Cole, and D. I. Pikulin, Quasiparti- cle poisoning of Majorana qubits, Phys. Rev. Lett. 126, 057702 (2021)

  45. [45]

    B. P. Truong, K. Agarwal, and T. Pereg-Barnea, Op- timizing the transport of Majorana zero modes in one- dimensional topological superconductors, Phys. Rev. B 107, 104516 (2023)

  46. [46]

    Sahu and S

    D. Sahu and S. Gangadharaiah, Transport of Majorana bound states in the presence of telegraph noise, Phys. Rev. B 111, 235306 (2025)

  47. [47]

    A. F. Andreev, Thermal conductivity of the intermediate state of superconductors, JETP 46, 1823 (1964)

  48. [48]

    K¨ ummel, Dynamics of current flow through the phase- boundary between a normal and a superconducting re- gion, Z

    R. K¨ ummel, Dynamics of current flow through the phase- boundary between a normal and a superconducting re- gion, Z. Phys. 218, 472 (1969)

  49. [49]

    B. M. Terhal and D. P. DiVincenzo, Classical simulation of noninteracting-fermion quantum circuits, Phys. Rev. A 65, 032325 (2002)

  50. [50]

    Bloch and A

    C. Bloch and A. Messiah, The canonical form of an an- tisymmetric tensor and its application to the theory of superconductivity, Nucl. Phys. 39, 95 (1962)

  51. [51]

    Ring and P

    P. Ring and P. Schuck,The Nuclear Many-Body Problem, 1st ed., 1864-5879 (Springer Berlin, Heidelberg, 1980)

  52. [52]

    G. F. Bertsch and L. M. Robledo, Symmetry restoration in Hartree-Fock-Bogoliubov based theories, Phys. Rev. Lett. 108, 042505 (2012)

  53. [53]

    B. G. Carlsson and J. Rotureau, New and practical for- mulation for overlaps of Bogoliubov vacua, Phys. Rev. Lett. 126, 172501 (2021)

  54. [54]

    Crawford, R

    D. Crawford, R. Wiesendanger, and S. Rachel, Prepa- ration and readout of Majorana qubits in magnet- superconductor hybrid systems, Phys. Rev. B 110, L220505 (2024)

  55. [55]

    Y. Liu, Y. Xiao, G. Kells, G. Katsaros, and R. Aguado, Fusion protocol for Majorana modes in coupled quantum dots (2022), arXiv:2212.01653

  56. [56]

    M. Zhuo, A. Banerjee, F. Pientka, J. H. Cole, P. Recher, K. Flensberg, and S. Hoffman, Readout of the fermion parity of an artificial Kitaev chain using a transmon qubit (2025), arXiv:2501.13367

  57. [57]

    Hassler, A

    F. Hassler, A. R. Akhmerov, and C. W. J. Beenakker, The top-transmon: a hybrid superconducting qubit for parity-protected quantum computation, New J. Phys13, 095004 (2011)