arxiv: 2604.11442 · v1 · submitted 2026-04-13 · 🪐 quant-ph

Recognition: unknown

Topological Device-Independent Quantum Key Distribution Using Majorana-Based Qubits

Noureldin Mohamed , Saif Al-Kuwari

Authors on Pith no claims yet

Pith reviewed 2026-05-10 16:34 UTC · model grok-4.3

classification 🪐 quant-ph

keywords Majorana zero modesdevice-independent QKDquasiparticle poisoningCHSH inequalitytopological qubitsfinite-size securityheralded protocolquantum networks

0 comments

The pith

Majorana zero-mode processors support device-independent QKD when quasiparticle poisoning rates are suppressed below a round-trip threshold.

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

The paper develops a framework showing how Majorana zero mode qubits can be used for device-independent quantum key distribution by connecting their microscopic noise directly to observable security metrics. It creates an error model that converts processes like poisoning, braid errors, and readout issues into bounds on the CHSH Bell parameter. A heralded protocol is given to close the detection loophole by tracking efficiencies, along with a finite-size security analysis. A sympathetic reader would care because this identifies the precise hardware conditions needed to turn topological qubits into nodes for secure quantum networks over fiber, rather than leaving the gap between device physics and cryptographic guarantees unbridged.

Core claim

The paper claims that a hardware-native error model translates MZM-specific processes including poisoning rates, braid infidelities, and readout anisotropy directly to the CHSH Bell parameter S, enabling a loss-disciplined protocol that monitors setting-conditional efficiencies to enforce detection-loophole closure in a heralded architecture, with composable finite-size security following from the analysis; this reveals that the achievable secure distance remains strictly bounded by poisoning-induced visibility collapse during the photonic round-trip time even as topological protection stabilizes against calibration drift.

What carries the argument

The hardware-native error model mapping MZM processes such as poisoning rates and braid infidelities directly onto the CHSH Bell parameter S to produce macroscopic security bounds.

Load-bearing premise

Quasiparticle poisoning rates can be suppressed to levels satisfying Γ_p τ_max much less than one, and the error model captures every relevant noise source without missing effects.

What would settle it

An experiment that records a CHSH violation value inconsistent with the model's prediction from measured poisoning rates and round-trip latency, or that generates secure keys at distances exceeding the visibility-collapse bound.

Figures

Figures reproduced from arXiv: 2604.11442 by Noureldin Mohamed, Saif Al-Kuwari.

**Figure 2.** Figure 2: Secret key rate vs. fiber distance L. The Target and Optimistic tiers extend secure range to ∼ 75 km and ∼ 160 km, respectively, before poisoning-induced visibility collapse [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗

**Figure 3.** Figure 3: Heatmap of the CHSH parameter S vs. readout error pr and poisoning rate Γp. The steep gradient along the x-axis confirms that S is significantly more sensitive to readout errors than to poisoning. higher clock rates, Majorana nodes can buffer entanglement through storage (τstore), effectively waiting for heralding events without state discard. Furthermore, projected nanosecond-scale Majorana parity readout… view at source ↗

read the original abstract

Device-independent quantum key distribution (DI-QKD) provides the highest level of cryptographic security by certifying secrecy through observed Bell inequality violations, independent of the internal device physics. However, the transition from theory to practice is obstructed by the dual challenge of closing the detection loophole and achieving viable key rates over fiber distances. In this paper, we present a comprehensive theoretical framework for DI-QKD implemented on topological Majorana Zero Mode (MZM) processors. While MZMs offer a native parity-readout basis that simplifies Bell-state measurement, their viability as QKD nodes is fundamentally constrained by the interplay between storage latency and quasiparticle poisoning. We bridge the gap between microscopic hardware noise and macroscopic security by: (i) developing a hardware-native error model that maps MZM-specific processes, including poisoning rates, braid infidelities, and readout anisotropy, directly to the CHSH Bell parameter $S$; (ii) introducing a loss-disciplined protocol that monitors setting-conditional efficiencies to strictly enforce detection-loophole closure in a heralded architecture; and (iii) providing a composable finite-size security proof based on the Entropy Accumulation Theorem (EAT). Our analysis reveals that while topological protection stabilizes the system against calibration drift, the achievable secure distance is strictly bounded by the poisoning-induced visibility collapse during the photonic round-trip time. We identify specific hardware thresholds, particularly the suppression of poisoning rates to $\Gamma_p \tau_{\text{max}} \ll 1$ and high-fidelity sensor integration, as the critical path for viable topological quantum networks.

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.

Desk Editor's Note private letter to a colleague

The paper sketches a hardware-aware DI-QKD scheme on Majorana qubits that flags poisoning as the distance limiter, but the security mapping and EAT application stay at the level of claims without visible derivations.

read the letter

This paper sketches a device-independent QKD protocol built on Majorana zero-mode qubits. The main point is that it tries to tie microscopic hardware noise straight to the Bell violation and then to a finite-size security bound. The authors map poisoning rates, braid infidelity, and readout anisotropy into the CHSH parameter S, add a heralded loss-disciplined protocol to close the detection loophole, and invoke the entropy accumulation theorem for composable security. They conclude that the secure distance is capped by visibility loss from poisoning during the photonic round-trip time, with the key hardware threshold being Γ_p τ_max much less than one. That framing is a reasonable attempt to make abstract DI-QKD ideas concrete for one specific qubit platform. It correctly identifies a practical constraint that topological protection alone does not remove. The loss-monitoring step to enforce loophole closure is also a sensible protocol choice. These pieces give a reader a clear picture of where hardware development would need to focus for this approach to work. The write-up does not include the actual derivations that turn the microscopic rates into S or the key-rate formula, nor any numerical checks or simulations. The distance bound is stated to depend directly on the poisoning parameter, so the result is conditional on hardware performance rather than an unconditional advance. The stress-test concern about time-correlated quasiparticle poisoning is worth taking seriously: if poisoning events create residual memory across heralded rounds, the standard EAT accumulation rate would need extra justification or a decorrelation argument that is not mentioned. The paper assumes the error model captures the dominant effects without unmodeled contributions, which is a large assumption for real MZM devices. This work is aimed at people already working at the intersection of topological qubits and quantum cryptography. A reader who wants to think about hardware constraints on DI-QKD will find the error-model framing useful for discussion, but anyone looking for a ready-to-use protocol or verified numbers will come away empty. It deserves a serious referee because the problem is relevant and the structure is coherent enough that detailed review could improve the derivations and address the correlation issue in the proof. I would send it to peer review.

Referee Report

2 major / 1 minor

Summary. The manuscript presents a theoretical framework for device-independent quantum key distribution (DI-QKD) using Majorana zero mode (MZM) qubits. It develops a hardware-native error model mapping MZM-specific processes (quasiparticle poisoning rates Γ_p, braid infidelities, readout anisotropy) directly to the CHSH Bell parameter S; introduces a loss-disciplined heralded protocol that monitors setting-conditional efficiencies to close the detection loophole; and provides a composable finite-size security proof based on the Entropy Accumulation Theorem (EAT). The central result is that the achievable secure distance is strictly bounded by the poisoning-induced visibility collapse during the photonic round-trip time, requiring hardware thresholds such as Γ_p τ_max ≪ 1.

Significance. If the error model and EAT application are rigorously validated, the work would usefully connect microscopic topological noise sources to macroscopic DI-QKD performance bounds and identify concrete hardware targets for experimental networks. The structured mapping of MZM processes to Bell violation and the choice of EAT for composable finite-size analysis are constructive elements. The result remains conditional on the poisoning threshold, however, limiting its generality.

major comments (2)

[EAT security proof] In the EAT-based security proof: the composable finite-size bound relies on the Entropy Accumulation Theorem, which requires i.i.d. or Markovian test-round statistics. Quasiparticle poisoning during photonic storage latency can generate time-correlated, non-Markovian errors across heralded rounds that survive the loss-disciplined protocol; without an explicit de-correlation lemma or adjusted accumulation rate, the entropy lower bound used for the key rate is not justified.
[Hardware error model] In the hardware-native error model: the mapping from poisoning rate Γ_p and round-trip latency τ_max to the CHSH parameter S is used to derive the strict upper bound on secure distance. This mapping is presented as direct but appears to be an input assumption rather than an independent derivation, rendering the distance bound proportional to the hardware threshold Γ_p τ_max by construction and therefore circular for assessing overall viability.

minor comments (1)

[Abstract] The abstract states that 'our analysis reveals' the distance bound but does not reference the specific equation, figure, or numerical result that quantifies the dependence on Γ_p τ_max.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful and constructive review of our manuscript. The comments highlight important aspects of the EAT application and the error-model derivation that we will clarify in the revision. We address each major comment below.

read point-by-point responses

Referee: [EAT security proof] In the EAT-based security proof: the composable finite-size bound relies on the Entropy Accumulation Theorem, which requires i.i.d. or Markovian test-round statistics. Quasiparticle poisoning during photonic storage latency can generate time-correlated, non-Markovian errors across heralded rounds that survive the loss-disciplined protocol; without an explicit de-correlation lemma or adjusted accumulation rate, the entropy lower bound used for the key rate is not justified.

Authors: We agree that the EAT requires appropriate statistical assumptions on the test-round sequence. Our loss-disciplined protocol conditions on heralded events and monitors setting-conditional efficiencies precisely to suppress long-range correlations. Under the operating regime Γ_p τ_max ≪ 1 the poisoning-induced memory decays exponentially within a single round, rendering residual correlations negligible compared with the accumulation block size. Nevertheless, we acknowledge that an explicit bound is needed. In the revised manuscript we will add a short de-correlation lemma in the security section that quantifies the correlation time relative to the heralding rate and shows that the EAT accumulation rate remains valid to first order in Γ_p τ_max. revision: partial
Referee: [Hardware error model] In the hardware-native error model: the mapping from poisoning rate Γ_p and round-trip latency τ_max to the CHSH parameter S is used to derive the strict upper bound on secure distance. This mapping is presented as direct but appears to be an input assumption rather than an independent derivation, rendering the distance bound proportional to the hardware threshold Γ_p τ_max by construction and therefore circular for assessing overall viability.

Authors: The mapping is obtained by propagating the microscopic processes—quasiparticle poisoning during storage, braid infidelities, and readout anisotropy—through the visibility of the photonic Bell-state measurement to the observed CHSH value S. The distance bound then follows directly from the requirement that S remain above the threshold for a positive key rate; the condition Γ_p τ_max ≪ 1 is the resulting hardware specification, not an external input. To remove any ambiguity we will expand the derivation in Section III with explicit intermediate expressions that connect each MZM noise rate to the effective visibility and finally to S, making the logical steps fully transparent and non-circular. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation chain remains independent of inputs

full rationale

The paper develops a hardware-native error model mapping MZM processes (poisoning rates, braid infidelities, readout anisotropy) to CHSH parameter S, introduces a loss-disciplined heralded protocol enforcing detection-loophole closure, and applies the standard Entropy Accumulation Theorem for a composable finite-size proof. The secure-distance bound is stated to follow from visibility collapse due to poisoning during round-trip latency, with the threshold Γ_p τ_max ≪ 1 presented as an external hardware requirement rather than a self-derived or fitted quantity. No equations are shown reducing the final bound to the input parameters by construction, no self-citations are load-bearing for the central claims, and EAT is invoked as an external theorem. The derivation is therefore self-contained against external benchmarks; the reader's suggested reduction is not exhibited by any quoted step.

Axiom & Free-Parameter Ledger

2 free parameters · 2 axioms · 0 invented entities

The framework depends on several hardware-specific parameters and domain assumptions about Majorana behavior that are introduced as given rather than derived.

free parameters (2)

poisoning rate threshold Γ_p τ_max
Introduced as the critical hardware threshold that must satisfy ≪ 1 for viable distance; value not derived from first principles.
braid infidelity and readout anisotropy
Mapped to CHSH parameter S but treated as inputs in the error model without specified derivation.

axioms (2)

domain assumption MZMs offer a native parity-readout basis that simplifies Bell-state measurement
Stated as a fundamental property of topological Majorana processors in the abstract.
domain assumption Topological protection stabilizes the system against calibration drift
Invoked in the analysis of system stability.

pith-pipeline@v0.9.0 · 5583 in / 1500 out tokens · 63386 ms · 2026-05-10T16:34:27.154230+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

24 extracted references · 14 canonical work pages

[1]

Clauser, Michael A

J. F. Clauser, M. A. Horne, A. Shimony, and R. A. Holt, “Proposed experiment to test local hidden-variable theories,”Physical Review Letters, vol. 23, no. 15, pp. 880–884, 1969. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevLett.23.880

work page doi:10.1103/physrevlett.23.880 1969
[2]

Device-independent security of quantum cryptography against collective attacks,

A. Ac ´ın, N. Brunner, N. Gisin, S. Massar, S. Pironio, and V . Scarani, “Device-independent security of quantum cryptography against collective attacks,”Physical Review Letters, vol. 98, no. 23, p. 230501, 2007. [Online]. Available: https://link.aps.org/doi/10.1103/ PhysRevLett.98.230501

2007
[3]

Device-independent quantum key distribution secure against collective attacks,

S. Pironio, A. Ac ´ın, N. Brunner, N. Gisin, S. Massar, and V . Scarani, “Device-independent quantum key distribution secure against collective attacks,”New Journal of Physics, vol. 11, no. 4, p. 045021,
[4]

Available: https://iopscience.iop.org/article/10.1088/ 1367-2630/11/4/045021

[Online]. Available: https://iopscience.iop.org/article/10.1088/ 1367-2630/11/4/045021
[5]

Eberhard

P. H. Eberhard, “Background level and quantum correlations,”Physical Review A, vol. 47, no. 2, pp. R747–R750, 1993. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevA.47.R747

work page doi:10.1103/physreva.47.r747 1993
[6]

Hidden-variable example based upon data rejection,

P. M. Pearle, “Hidden-variable example based upon data rejection,” Physical Review D, vol. 2, no. 8, pp. 1418–1425, 1970. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevD.2.1418

work page doi:10.1103/physrevd.2.1418 1970
[7]

Significant-loophole-free test of bell’s theorem with entangled photons,

M. Giustina, M. A. M. Versteegh, S. Wengerowsky, J. Handsteiner, A. Hochrainer, K. Phelan, F. Steinlechner, J. Kofler, J.- ˚A. Larsson, C. Abell ´anet al., “Significant-loophole-free test of bell’s theorem with entangled photons,”Physical Review Letters, vol. 115, no. 25, p. 250401, 2015. [Online]. Available: https://link.aps.org/doi/10.1103/ PhysRevLett....

2015
[8]

Shalm, Evan Meyer-Scott, Bradley G

L. K. Shalm, E. Meyer-Scott, B. G. Christensen, P. Bierhorst, M. A. Wayne, M. J. Stevens, T. Gerrits, S. Glancy, D. R. Hamel, M. S. Allmanet al., “Strong loophole-free test of local realism,”Physical Review Letters, vol. 115, no. 25, p. 250402, 2015. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevLett.115.250402

work page doi:10.1103/physrevlett.115.250402 2015
[9]

Hensen, H

B. Hensen, H. Bernien, A. E. Dr ´eau, A. Reiserer, N. Kalb, M. S. Blok, J. Ruitenberg, R. F. L. Vermeulen, R. N. Schouten, C. Abell ´anet al., “Loophole-free bell inequality violation using electron spins separated by 1.3 kilometres,”Nature, vol. 526, no. 7575, pp. 682–686, 2015. [Online]. Available: https://doi.org/10.1038/nature15759

work page doi:10.1038/nature15759 2015
[10]

Majorana fermions and a topological phase transition in semiconductor-superconductor heterostructures,

R. M. Lutchyn, J. D. Sau, and S. Das Sarma, “Majorana fermions and a topological phase transition in semiconductor-superconductor heterostructures,”Physical Review Letters, vol. 105, no. 7, p. 077001,
[11]

Bl´ azquez-Salcedo, C

[Online]. Available: https://link.aps.org/doi/10.1103/PhysRevLett. 105.077001

work page doi:10.1103/physrevlett
[12]

Helical liquids and majorana bound states in quantum wires,

Y . Oreg, G. Refael, and F. von Oppen, “Helical liquids and majorana bound states in quantum wires,”Physical Review Letters, vol. 105, no. 17, p. 177002, 2010. [Online]. Available: https: //link.aps.org/doi/10.1103/PhysRevLett.105.177002

work page doi:10.1103/physrevlett.105.177002 2010
[13]

Majorana box qubits,

S. Plugge, A. Rasmussen, R. Egger, and K. Flensberg, “Majorana box qubits,”New Journal of Physics, vol. 19, no. 1, p. 012001,
[14]

Available: https://iopscience.iop.org/article/10.1088/ 1367-2630/19/1/012001

[Online]. Available: https://iopscience.iop.org/article/10.1088/ 1367-2630/19/1/012001
[15]

Non-abelian anyons and topological quantum computation,

C. Nayak, S. H. Simon, A. Stern, M. Freedman, and S. Das Sarma, “Non-abelian anyons and topological quantum computation,”Reviews of Modern Physics, vol. 80, no. 3, pp. 1083–1159, 2008. [Online]. Available: https://link.aps.org/doi/10.1103/RevModPhys.80.1083

work page doi:10.1103/revmodphys.80.1083 2008
[16]

Fault-tolerant quantum computation by anyons

A. Y . Kitaev, “Fault-tolerant quantum computation by anyons,”Annals of Physics, vol. 303, no. 1, pp. 2–30, 2003. [Online]. Available: https://doi.org/10.1016/S0003-4916(02)00018-0

work page Pith review doi:10.1016/s0003-4916(02)00018-0 2003
[17]

Advancing the development of topological qubits using majorana zero modes,

Microsoft Quantum Team, “Advancing the development of topological qubits using majorana zero modes,” Microsoft Research, Tech. Rep., 2022, technical report

2022
[18]

Scalable designs for quasiparticle-poisoning-protected topological quantum computation with majorana zero modes,

T. Karzig, C. Knapp, R. M. Lutchyn, P. Bonderson, M. B. Hastings, C. Nayak, J. Alicea, K. Flensberg, S. Plugge, Y . Oreget al., “Scalable designs for quasiparticle-poisoning-protected topological quantum computation with majorana zero modes,”Physical Review B, vol. 95, no. 23, p. 235305, 2017. [Online]. Available: https: //link.aps.org/doi/10.1103/PhysRev...

work page doi:10.1103/physrevb.95.235305 2017
[19]

Majorana qubit decoherence by quasiparticle poisoning,

D. Rainis and D. Loss, “Majorana qubit decoherence by quasiparticle poisoning,”Physical Review B, vol. 85, no. 17, p. 174533,
[20]

Scheie, P

[Online]. Available: https://link.aps.org/doi/10.1103/PhysRevB. 85.174533

work page doi:10.1103/physrevb
[21]

Modeling the decay of majorana-based qubits,

C. Knapp, M. Zaletel, D. E. Liu, M. Cheng, P. Bonderson, and C. Nayak, “Modeling the decay of majorana-based qubits,”Physical Review X, vol. 6, no. 4, p. 041003, 2016. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevX.6.041003 6

work page doi:10.1103/physrevx.6.041003 2016
[22]

Practical device-independent quantum cryptography via entropy accumulation,

R. Arnon-Friedman, F. Dupuis, O. Fawzi, R. Renner, and T. Vidick, “Practical device-independent quantum cryptography via entropy accumulation,”Nature Communications, vol. 9, no. 1, p. 459, 2018. [Online]. Available: https://doi.org/10.1038/s41467-017-02307-4

work page doi:10.1038/s41467-017-02307-4 2018
[23]

Tsirelson , Date-Added =

B. S. Cirel’son, “Quantum generalizations of bell’s inequality,”Letters in Mathematical Physics, vol. 4, no. 2, pp. 93–100, 1980. [Online]. Available: https://doi.org/10.1007/BF00417500

work page doi:10.1007/bf00417500 1980
[24]

Efficient high-fidelity quantum computation using matter qubits and linear optics,

S. D. Barrett and P. Kok, “Efficient high-fidelity quantum computation using matter qubits and linear optics,”Physical Review A, vol. 71, no. 6, p. 060310, 2005. [Online]. Available: https://link.aps.org/doi/10. 1103/PhysRevA.71.060310

2005