Pith. sign in

REVIEW 4 major objections 2 minor 60 references

Failure Tolerant Phase-Only Indoor Positioning via Deep Learning

T0 review · 4 major / 2 minor · reviewed 2026-08-05 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read A deep-learning indoor positioning system that uses only carrier-phase measurements and stays accurate when antenna elements fail, by exploiting the hyperbola intersection principle.

desk verdict Positioning paper has a plausible new idea, but I can't review it because the supplied full text is a quantum-networking paper — get the real manuscript first. read the letter →

arxiv 2508.14739 v1 pith:WKBQ2EN4 submitted 2025-08-20 eess.SP

Fatih Ayten , Mehmet C. Ilter , Akshay Jain , Ossi Kaltiokallio , Jukka Talvitie , Elena Simona Lohan , Henk Wymeersch , Mikko Valkama This is my paper
classification eess.SP
keywords carrierphasepositioningindoorlocalizationdeeplearningphase-onlyantennafailurerobustnesshyperbolaintersectionMIMO5G-Advanced
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

The paper tries to establish that accurate indoor localization can be achieved from carrier-phase measurements alone, without time-of-arrival support, using a deep-learning model built around the hyperbola intersection principle. Earlier phase-only deep-learning methods assumed ideal hardware, so a single failed antenna element could break their accuracy. The proposed model learns to map phase-only measurements directly to positions and is designed to tolerate antenna element failures. The authors report it clearly outperforms previous phase-only localization methods and remains accurate under antenna impairments, which would make centimeter-level positioning practical in real distributed-antenna systems without extra hardware.

What carries the argument

The hyperbola intersection principle: for a pair of antennas, a constant carrier-phase difference traces a hyperbola in the plane, so several antenna pairs produce intersecting hyperbolas whose common point is the receiver position. The paper embeds this geometric principle in a deep-learning architecture that learns to extract position from phase-only measurements, and couples it with a processing and learning mechanism designed to tolerate failed antenna elements, so missing or corrupted phase inputs do not collapse the position estimate.

What would settle it

Run the proposed phase-only deep-learning model on measured indoor carrier-phase data from a distributed antenna array, deliberately disabling one or more antenna elements. If localization error degrades far more steeply than the paper's simulations predict, or if accuracy falls below conventional time-of-arrival positioning in the same building, the central claim of failure-tolerant phase-only positioning is not borne out.

Watch

Extended reading notes

Core claim

The central claim is that a deep neural network can map raw carrier-phase observations from a distributed antenna or MIMO array directly to a position estimate, using the geometry of phase-difference hyperbolas as the underlying principle, and that this mapping degrades gracefully under antenna element failures. The paper contrasts its approach with earlier phase-only deep-learning methods that were only tested under ideal hardware assumptions, and with conventional carrier-phase positioning that needs time-of-arrival measurements to resolve ambiguities. The reported numerical results show the new model beating previous methods in localization accuracy and maintaining accurate positioning wh

Load-bearing premise

The numerical simulations must model realistic carrier-phase behavior under antenna failures, including phase ambiguity, measurement noise, and element dropout; if that simulated failure model is too optimistic, the reported robustness will not transfer to real indoor hardware.

Editorial extensions

If this is right

  • Indoor positioning could reach sub-meter to centimeter accuracy using phase measurements alone, removing the need for time-of-arrival support and its bandwidth overhead.
  • Antenna failures become a performance-reducing nuisance rather than a system-breaking fault; localization can continue with the surviving antenna elements.
  • A data-driven phase-only approach could make carrier-phase positioning practical in 5G-Advanced systems without per-device calibration for each possible hardware failure.
  • If the method transfers to real hardware, it offers a low-bandwidth, high-accuracy indoor positioning option for distributed antenna and MIMO deployments.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the failure tolerance comes from training with simulated element dropout, the same model may generalize to other missing-data conditions, such as occluded antennas or temporary disconnections, not just hardware failure.
  • The hyperbola-intersection inductive bias should make the model more sample-efficient than a generic black-box regressor, but it may tie the network to the assumed array geometry; testing on irregular or unknown layouts would show whether that is a limitation.
  • A natural extension would be to combine the phase-only estimates with time-of-arrival information when it is available; the paper claims phase-only accuracy, but the robustness gains might carry over to hybrid inputs.
  • Editorial note: the supplied full text belongs to a different manuscript on quantum entanglement distribution, so this summary rests on the paper's title and abstract rather than on visible body text or references.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 2 minor

Summary. The manuscript, as identified by its arXiv ID and abstract, claims a deep-learning-based phase-only indoor positioning method that harnesses a 'hyperbola intersection principle,' outperforms previous methods, and remains robust to antenna element failures, with 'comprehensive' numerical results. However, the supplied full text is a different paper entirely: 'Piecemaker: a resource-efficient entanglement distribution protocol' (arXiv:2508.14737), a quantum-networking manuscript about distributing stabilizer states with a quantum switch. That full text contains no positioning formulation, no DL architecture, no failure model, no baselines, and no positioning simulation results. The abstract's claims are therefore unsupported by any discoverable evidence in the submitted manuscript.

Significance. If the claimed results were present and correct, the paper could be significant: a data-driven, phase-only positioning approach that is robust to antenna failures would be relevant to 5G-Advanced carrier-phase positioning and could reduce hardware redundancy requirements. The 'hyperbola intersection principle' is a plausible geometric prior that might improve sample efficiency. But because the supplied full text is an unrelated quantum-networking paper, the significance cannot be evaluated from the manuscript as submitted. There is no derivable contribution, no checkable simulation methodology, and no evidence that the claimed robustness transfers beyond the (unavailable) simulation setup.

major comments (4)
  1. [Full text (title, abstract, and content)] The submitted full text is not the paper announced by the abstract. It is 'Piecemaker: a resource-efficient entanglement distribution protocol' by Prielinger et al., on quantum entanglement distribution. None of the abstract's claims about phase-only positioning, deep learning, hyperbola intersection, or antenna failures appear anywhere in this text. The central claim of the paper is therefore unverifiable from the submitted material. This is a load-bearing defect, not a presentation issue.
  2. [Abstract, final sentence] The abstract promises a 'comprehensive set of numerical results' demonstrating large improvements in localization accuracy. The full text contains numerical evaluations in Section VI, but they concern quantum-state fidelity of distributed graph states, not indoor positioning error, phase measurements, or antenna failures. No localization dataset, error metric, baseline positioning method, or simulation setup is described. The claimed numerical support is absent.
  3. [Abstract, 'robust to antenna element failures'] The central robustness claim rests on an antenna-failure model that is never stated. There is no description of how element failures affect the carrier-phase observations, how phase ambiguity is handled, what noise model is used, whether clock offsets or multipath are included, or whether the network sees the failure pattern during training. Without these specifics, the claim 'robust to antenna element failures' cannot be checked, reproduced, or compared to prior art. This is the key technical premise of the paper and it is entirely missing from the submitted manuscript.
  4. [Full text, overall] There is no equations, architecture description, loss function, training/test split, or hyperparameter setting for the claimed DL positioning system. The 'hyperbola intersection principle' is only named in the abstract; the full text does not define it or explain how it is 'harnessed.' This makes the paper's central methodological innovation inaccessible to the reader and prevents any assessment of circularity, generalization, or numerical credibility.
minor comments (2)
  1. [Title and metadata] The arXiv ID and abstract describe one paper, while the full text carries a different title, author list, abstract, and subject matter. At minimum, the submission metadata and manuscript body must be made consistent before any further review.
  2. [References] The reference list in the full text is for quantum networking and contains no citations to the phase-only positioning or deep-learning localization literature that the abstract implies. This reinforces that the supplied text is not the paper under review.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity identifiable: the target paper's full text is unavailable (the supplied full text is arXiv:2508.14737, a different quantum-networking paper), and the abstract alone contains no derivation, fitting, or prediction steps that could reduce to inputs.

full rationale

The manuscript supplied as 'Full Text' is arXiv:2508.14737, 'Piecemaker: a resource-efficient entanglement distribution protocol', not the target arXiv:2508.14739 phase-only indoor positioning paper. The only available target text is the abstract. The abstract claims a new DL-based localization approach using the hyperbola intersection principle and robustness to antenna element failures, but it does not present any equations, training/test split, fitted parameters, baselines, or a derivation chain. Under the hard rules, circularity can only be flagged when the paper's own text exhibits the specific reduction (e.g., Eq. X = Eq. Y by construction, or a fitted parameter renamed as prediction). No such reduction can be identified from the abstract alone. The absence of the full text is a verifiability or reproducibility concern, not evidence of circularity. There is also no self-citation chain present in the abstract. Thus the honest non-finding is score 0: no significant circularity identified in the material available.

Assumptions & free parameters 1 free parameters · 4 assumptions · 0 invented entities

Abstract-only review due to full-text mismatch. No free parameters, equations, or data artifacts are available; the listed items are the minimal assumptions the abstract's claim requires.

free parameters (1)
  • Trained DL model parameters and hyperparameters = Not stated in abstract
    The proposed positioning model is trained on numerical data; its accuracy depends on fitted network weights and hyperparameters, none of which are specified in the abstract.
assumptions (4)
  • domain assumption Carrier-phase measurements in a distributed antenna/MIMO system contain sufficient geometry for position estimation
    The phase-only approach is premised on phase observations carrying usable position information; stated in the abstract's CPP context.
  • domain assumption Antenna failures can be represented as impairments that degrade, but do not invalidate, the remaining phase measurements
    The proposed robustness mechanism assumes surviving antennas still provide coherent phase data; abstract frames failures as performance degradation, not complete system loss.
  • domain assumption Simulated numerical results are a valid proxy for practical positioning performance
    The abstract supports the central claim entirely with 'numerical results'; no experimental or field validation is mentioned.
  • domain assumption The hyperbola intersection principle provides a geometrically valid basis for the DL model
    The abstract names this principle as central but provides no derivation; the claim depends on the principle applying under phase ambiguities.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Failure Tolerant Phase-Only Indoor Positioning via Deep Learning." pith.science (2026). https://pith.science/paper/WKBQ2EN4

@misc{pith2026250814739,
  author       = {Pith},
  title        = {Pith review of: Failure Tolerant Phase-Only Indoor Positioning via Deep Learning},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/WKBQ2EN4}},
  note         = {Machine review of arXiv:2508.14739}
}
read the original abstract

High-precision localization turns into a crucial added value and asset for next-generation wireless systems. Carrier phase positioning (CPP) enables sub-meter to centimeter-level accuracy and is gaining interest in 5G-Advanced standardization. While CPP typically complements time-of-arrival (ToA) measurements, recent literature has introduced a phase-only positioning approach in a distributed antenna/MIMO system context with minimal bandwidth requirements, using deep learning (DL) when operating under ideal hardware assumptions. In more practical scenarios, however, antenna failures can largely degrade the performance. In this paper, we address the challenging phase-only positioning task, and propose a new DL-based localization approach harnessing the so-called hyperbola intersection principle, clearly outperforming the previous methods. Additionally, we consider and propose a processing and learning mechanism that is robust to antenna element failures. Our results show that the proposed DL model achieves robust and accurate positioning despite antenna impairments, demonstrating the viability of data-driven, impairment-tolerant phase-only positioning mechanisms. Comprehensive set of numerical results demonstrates large improvements in localization accuracy against the prior art methods.

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

60 extracted references · 47 canonical work pages

  1. [1]

    Scheme for reducing decoherence in quantum computer memory,

    P. W. Shor, “Scheme for reducing decoherence in quantum computer memory,” Phys. Rev. A, vol. 52, pp. R2493–R2496, Oct 1995. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevA.52.R2493

    doi:10.1103/physreva.52.r2493 1995

  2. [2]

    Fusion-based quantum computation,

    S. Bartolucci, P. Birchall, H. Bombin, H. Cable, C. Dawson, M. Gimeno- Segovia, E. Johnston, K. Kieling, N. Nickerson, M. Pant, F. Pastawski, T. Rudolph, and C. Sparrow, “Fusion-based quantum computation,” 2021

    work page 2021

  3. [3]

    Fault-tolerant quantum computation by anyons,

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

    doi:10.1016/s0003-4916(02)00018-0 2003

  4. [4]

    A one-way quantum computer,

    R. Raussendorf and H. J. Briegel, “A one-way quantum computer,” Phys. Rev. Lett., vol. 86, pp. 5188–5191, May 2001. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevLett.86.5188

    doi:10.1103/physrevlett.86.5188 2001

  5. [5]

    Quantum repeaters based on atomic ensembles and linear optics,

    N. Sangouard, C. Simon, H. de Riedmatten, and N. Gisin, “Quantum repeaters based on atomic ensembles and linear optics,” Rev. Mod. Phys. , vol. 83, pp. 33–80, Mar 2011. [Online]. Available: https://link.aps.org/doi/10.1103/RevModPhys.83.33

    doi:10.1103/revmodphys.83.33 2011

  6. [6]

    All-photonic quantum repeaters,

    K. Azuma, K. Tamaki, and H.-K. Lo, “All-photonic quantum repeaters,” Nature Communications, vol. 6, no. 1, Apr. 2015. [Online]. Available: https://doi.org/10.1038/ncomms7787

    doi:10.1038/ncomms7787 2015

  7. [7]

    Graph states as a resource for quantum metrology,

    N. Shettell and D. Markham, “Graph states as a resource for quantum metrology,” Phys. Rev. Lett. , vol. 124, p. 110502, Mar 2020. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevLett.124.110502

    work page doi:10.1103/physrevlett.124.110502 2020

  8. [8]

    Distributing graph states across quantum networks,

    A. Fischer and D. Towsley, “Distributing graph states across quantum networks,” in 2021 IEEE International Conference on Quantum Com- puting and Engineering (QCE) , 2021, pp. 324–333

    work page 2021

Show all 60 references
  1. [9]

    Analysis of multipartite entan- glement distribution using a central quantum-network node,

    G. Avis, F. Rozp˛ edek, and S. Wehner, “Analysis of multipartite entan- glement distribution using a central quantum-network node,” Physical Review A, vol. 107, no. 1, p. 012609, 2023

    2023

  2. [10]

    On the stochastic analysis of a quantum entanglement switch,

    G. Vardoyan, S. Guha, P. Nain, and D. Towsley, “On the stochastic analysis of a quantum entanglement switch,” ACM SIGMETRICS Per- formance Evaluation Review , vol. 47, no. 2, pp. 27–29, 2019

    2019

  3. [11]

    Distributing multipartite entanglement over noisy quantum networks,

    L. Bugalho, B. C. Coutinho, F. A. Monteiro, and Y . Omar, “Distributing multipartite entanglement over noisy quantum networks,” quantum, vol. 7, p. 920, 2023

    2023

  4. [12]

    Analysis of a tripartite entanglement distribution switch,

    P. Nain, G. Vardoyan, S. Guha, and D. Towsley, “Analysis of a tripartite entanglement distribution switch,” Queueing Systems , vol. 101, no. 3, pp. 291–328, 2022

    2022

  5. [13]

    On the exact analysis of an idealized quantum switch,

    G. Vardoyan, S. Guha, P. Nain, and D. Towsley, “On the exact analysis of an idealized quantum switch,” Performance Evaluation, vol. 144, p. 102141, 2020

    2020

  6. [14]

    Full exploitation of limited memory in quantum entanglement switching,

    P. Promponas, V . Valls, and L. Tassiulas, “Full exploitation of limited memory in quantum entanglement switching,” in 2023 IFIP Networking Conference (IFIP Networking) , 2023, pp. 1–9

    2023

  7. [15]

    Distributing graph states with a photon- weaving quantum server,

    D. Bhatti and K. Goodenough, “Distributing graph states with a photon- weaving quantum server,” arXiv preprint arXiv:2504.07410 , 2025

    2025 arXiv

  8. [16]

    Multipartite entanglement in quantum networks using subgraph complementations,

    A. Sen, K. Goodenough, and D. Towsley, “Multipartite entanglement in quantum networks using subgraph complementations,” in 2023 IEEE International Conference on Quantum Computing and Engineering (QCE), vol. 2. IEEE, 2023, pp. 252–253

    2023

  9. [17]

    A control architecture for entanglement generation switches in quantum networks,

    S. Gauthier, G. Vardoyan, and S. Wehner, “A control architecture for entanglement generation switches in quantum networks,” in Proceedings 13 of the 1st Workshop on Quantum Networks and Distributed Quantum Computing, 2023, pp. 38–44

    2023

  10. [18]

    Simple loss-tolerant protocol for greenberger-horne-zeilinger-state distribution in a quantum network,

    H. Shimizu, W. Roga, D. Elkouss, and M. Takeoka, “Simple loss-tolerant protocol for greenberger-horne-zeilinger-state distribution in a quantum network,” Physical Review A , vol. 111, no. 2, p. 022624, 2025

    2025

  11. [19]

    Bell’s theorem without inequalities,

    D. M. Greenberger, M. A. Horne, A. Shimony, and A. Zeilinger, “Bell’s theorem without inequalities,” American Journal of Physics , vol. 58, no. 12, pp. 1131–1143, 1990

    1990

  12. [20]

    Quantum conference key agreement: A review,

    G. Murta, F. Grasselli, H. Kampermann, and D. Bruß, “Quantum conference key agreement: A review,” Advanced Quantum Technologies, vol. 3, no. 11, p. 2000025, 2020

    2020

  13. [21]

    Quantum secret sharing,

    M. Hillery, V . Bužek, and A. Berthiaume, “Quantum secret sharing,” Physical Review A , vol. 59, no. 3, p. 1829, 1999

    1999

  14. [22]

    Generation and distribution of ghz states in quantum networks,

    M. Ghaderibaneh, H. Gupta, and C. Ramakrishnan, “Generation and distribution of ghz states in quantum networks,” in 2023 IEEE Inter- national Conference on Quantum Computing and Engineering (QCE) , vol. 01, 2023, pp. 1120–1131

    2023

  15. [23]

    Efficient algorithm to recognize the local clifford equivalence of graph states,

    M. Van den Nest, J. Dehaene, and B. De Moor, “Efficient algorithm to recognize the local clifford equivalence of graph states,” Physical Review A—Atomic, Molecular, and Optical Physics , vol. 70, no. 3, p. 034302, 2004

    2004

  16. [24]

    Graphical description of the action of local clifford transforma- tions on graph states,

    ——, “Graphical description of the action of local clifford transforma- tions on graph states,” Physical Review A , vol. 69, no. 2, p. 022316, 2004

    2004

  17. [25]

    Quantum networks based on color centers in diamond,

    M. Ruf, N. H. Wan, H. Choi, D. Englund, and R. Hanson, “Quantum networks based on color centers in diamond,” Journal of Applied Physics, vol. 130, no. 7, 2021

    2021

  18. [26]

    Can quantum-mechanical description of physical reality be considered complete?

    A. Einstein, B. Podolsky, and N. Rosen, “Can quantum-mechanical description of physical reality be considered complete?” Physical review, vol. 47, no. 10, p. 777, 1935

    1935

  19. [27]

    Heralded entanglement between solid-state qubits separated by three metres,

    H. Bernien, B. Hensen, W. Pfaff, G. Koolstra, M. S. Blok, L. Robledo, T. H. Taminiau, M. Markham, D. J. Twitchen, L. Childress et al. , “Heralded entanglement between solid-state qubits separated by three metres,” Nature, vol. 497, no. 7447, pp. 86–90, 2013

    2013

  20. [28]

    Entangling remote qubits using the single-photon protocol: an in-depth theoretical and experimental study,

    S. L. Hermans, M. Pompili, L. D. S. Martins, A. R. Montblanch, H. K. Beukers, S. Baier, J. Borregaard, and R. Hanson, “Entangling remote qubits using the single-photon protocol: an in-depth theoretical and experimental study,” New Journal of Physics , vol. 25, no. 1, p. 013011, 2023

    2023

  21. [29]

    Near-term quantum-repeater experiments with nitrogen-vacancy centers: Overcoming the limitations of direct transmission,

    F. Rozp˛ edek, R. Yehia, K. Goodenough, M. Ruf, P. C. Humphreys, R. Hanson, S. Wehner, and D. Elkouss, “Near-term quantum-repeater experiments with nitrogen-vacancy centers: Overcoming the limitations of direct transmission,” Physical Review A , vol. 99, no. 5, p. 052330, 2019

    2019

  22. [30]

    Realization of a multinode quantum network of remote solid-state qubits,

    M. Pompili, S. L. Hermans, S. Baier, H. K. Beukers, P. C. Humphreys, R. N. Schouten, R. F. Vermeulen, M. J. Tiggelman, L. dos Santos Mar- tins, B. Dirkse et al., “Realization of a multinode quantum network of remote solid-state qubits,” Science, vol. 372, no. 6539, pp. 259–264, 2021

    2021

  23. [31]

    M. A. Nielsen and I. L. Chuang, Quantum computation and quantum information. Cambridge university press, 2010

    2010

  24. [32]

    The capacity of the quantum depolarizing channel,

    C. King, “The capacity of the quantum depolarizing channel,” IEEE Transactions on Information Theory , vol. 49, no. 1, pp. 221–229, 2003

    2003

  25. [33]

    Robust quantum-network memory based on spin qubits in isotopically engi- neered diamond,

    C. Bradley, S. de Bone, P. Möller, S. Baier, M. Degen, S. Loenen, H. Bartling, M. Markham, D. Twitchen, R. Hanson et al. , “Robust quantum-network memory based on spin qubits in isotopically engi- neered diamond,” npj Quantum Information, vol. 8, no. 1, p. 122, 2022

    2022

  26. [34]

    High-fidelity greenberger- horne-zeilinger state generation within nearby nodes,

    V . Caprara Vivoli, J. Ribeiro, and S. Wehner, “High-fidelity greenberger- horne-zeilinger state generation within nearby nodes,” Physical Review A, vol. 100, no. 3, p. 032310, 2019

    2019

  27. [35]

    Schemes for the generation of multipartite entanglement of remote atoms trapped in separate optical cavities,

    H.-F. Wang, X.-Q. Shao, Y .-F. Zhao, S. Zhang, and K.-H. Yeon, “Schemes for the generation of multipartite entanglement of remote atoms trapped in separate optical cavities,”Journal of Physics B: Atomic, Molecular and Optical Physics , vol. 42, no. 17, p. 175506, 2009

    2009

  28. [36]

    Maximum efficiency of a linear- optical bell-state analyzer,

    J. Calsamiglia and N. Lütkenhaus, “Maximum efficiency of a linear- optical bell-state analyzer,” Applied Physics B, vol. 72, no. 1, pp. 67–71, 2001

    2001

  29. [37]

    On the capacity region of bipartite and tripartite entanglement switching,

    G. Vardoyan, P. Nain, S. Guha, and D. Towsley, “On the capacity region of bipartite and tripartite entanglement switching,” ACM Transactions on Modeling and Performance Evaluation of Computing Systems, vol. 8, no. 1-2, pp. 1–18, 2023

    2023

  30. [38]

    Protocols for creating and distilling multipartite ghz states with bell pairs,

    S. de Bone, R. Ouyang, K. Goodenough, and D. Elkouss, “Protocols for creating and distilling multipartite ghz states with bell pairs,” IEEE Transactions on Quantum Engineering , vol. 1, pp. 1–10, 2020

    2020

  31. [39]

    Resource-efficient linear optical quantum computation,

    D. E. Browne and T. Rudolph, “Resource-efficient linear optical quantum computation,” Phys. Rev. Lett. , vol. 95, p. 010501, Jun

  32. [40]

    Remote state preparation,

    C. H. Bennett, D. P. DiVincenzo, P. W. Shor, J. A. Smolin, B. M. Terhal, and W. K. Wootters, “Remote state preparation,”Physical Review Letters, vol. 87, no. 7, p. 077902, 2001

    2001

  33. [41]

    M. M. Wilde, Quantum information theory . Cambridge University Press, 2013

    2013

  34. [42]

    Near-term � to � distillation protocols using graph codes,

    K. Goodenough, S. de Bone, V . L. Addala, S. Krastanov, S. Jansen, D. Gijswijt, and D. Elkouss, “Near-term � to � distillation protocols using graph codes,” arXiv preprint arXiv:2303.11465 , 2023

    2023 arXiv

  35. [43]

    Entanglement in graph states and its applications,

    M. Hein, W. Dür, J. Eisert, R. Raussendorf, M. Nest, and H.-J. Briegel, “Entanglement in graph states and its applications,” arXiv preprint quant-ph/0602096, 2006

    2006 arXiv

  36. [44]

    Data underlying the publication: Resource efficient piece-wise entanglement distribution from a quantum switch,

    L. Prielinger, K. Goodenough, G. Avis, and G. Vardoyan, “Data underlying the publication: Resource efficient piece-wise entanglement distribution from a quantum switch,” 2025. [Online]. Available: https://data.4tu.nl/datasets/b0a77b85-10a8-47df-8d69-77de8f2f0f24/1

    2025

  37. [45]

    Minimizing the number of edges in lc-equivalent graph states,

    H. Sharma, K. Goodenough, J. Borregaard, J. Helsen et al., “Minimizing the number of edges in lc-equivalent graph states,” arXiv preprint arXiv:2506.00292, 2025

    2025

  38. [46]

    QuantumSavory.jl: A full-stack simulator of quantum hardware,

    S. Krastanov, “QuantumSavory.jl: A full-stack simulator of quantum hardware,” https://github.com/QuantumSavory/QuantumSavory.jl, 2025, gitHub repository, accessed 24 June 2025

    2025

  39. [47]

    Mapping graph state orbits under local complementation,

    J. C. Adcock, S. Morley-Short, A. Dahlberg, and J. W. Silverstone, “Mapping graph state orbits under local complementation,” Quantum, vol. 4, p. 305, 2020

    2020

  40. [48]

    Entanglement detection,

    O. Gühne and G. Tóth, “Entanglement detection,” Physics Reports, vol. 474, no. 1-6, pp. 1–75, 2009

    2009

  41. [49]

    High- fidelity four-photon ghz states on chip,

    M. Pont, G. Corrielli, A. Fyrillas, I. Agresti, G. Carvacho, N. Maring, P.-E. Emeriau, F. Ceccarelli, R. Albiero, P. H. Dias Ferreiraet al., “High- fidelity four-photon ghz states on chip,” npj Quantum Information , vol. 10, no. 1, p. 50, 2024

    2024

  42. [50]

    Asymmet- ric node placement in fiber-based quantum networks,

    G. Avis, R. Knegjens, A. S. Sørensen, and S. Wehner, “Asymmet- ric node placement in fiber-based quantum networks,” arXiv preprint arXiv:2305.09635, 2023

    2023 arXiv

  43. [51]

    Netsquid, a network simulator for quantum information using discrete events,

    T. Coopmans, R. Knegjens, A. Dahlberg, D. Maier, L. Nijsten, J. de Oliveira Filho, M. Papendrecht, J. Rabbie, F. Rozp˛ edek, M. Skrzypczyk et al. , “Netsquid, a network simulator for quantum information using discrete events,” Communications Physics , vol. 4, no. 1, p. 164, 2021

    2021

  44. [52]

    Creation of entangled states of distant atoms by interference,

    C. Cabrillo, J. I. Cirac, P. Garcia-Fernandez, and P. Zoller, “Creation of entangled states of distant atoms by interference,” Physical Review A , vol. 59, no. 2, p. 1025, 1999

    1999

  45. [53]

    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—Atomic, Molecular, and Optical Physics , vol. 71, no. 6, p. 060310, 2005

    2005

  46. [54]

    On the index of gracefulness of a graph and the gracefulness of two-dimensional square lattice graphs,

    B. Acharya and M. Gill, “On the index of gracefulness of a graph and the gracefulness of two-dimensional square lattice graphs,” Indian J. Math, vol. 23, no. 81-94, p. 14, 1981

    1981

  47. [55]

    Efficient optimization of cut-offs in quantum repeater chains,

    B. Li, T. Coopmans, and D. Elkouss, “Efficient optimization of cut-offs in quantum repeater chains,” in 2020 IEEE International Conference on Quantum Computing and Engineering (QCE) . IEEE, 2020, pp. 158– 168

    2020

  48. [56]

    Entanglement distillation between solid-state quantum network nodes,

    N. Kalb, A. A. Reiserer, P. C. Humphreys, J. J. Bakermans, S. J. Kamer- ling, N. H. Nickerson, S. C. Benjamin, D. J. Twitchen, M. Markham, and R. Hanson, “Entanglement distillation between solid-state quantum network nodes,” Science, vol. 356, no. 6341, pp. 928–932, 2017

    2017

  49. [57]

    Enumerating all bilocal clifford distillation protocols through symmetry reduction,

    S. Jansen, K. Goodenough, S. de Bone, D. Gijswijt, and D. Elkouss, “Enumerating all bilocal clifford distillation protocols through symmetry reduction,” Quantum, vol. 6, p. 715, 2022

    2022

  50. [58]

    Constant overhead entanglement distillation via scrambling,

    A. Gu, L. Leone, K. Goodenough, and S. Khatri, “Constant overhead entanglement distillation via scrambling,” arXiv preprint arXiv:2502.09483, 2025

    2025

  51. [59]

    How to transform graph states using single-qubit operations: computational complexity and al- gorithms,

    A. Dahlberg, J. Helsen, and S. Wehner, “How to transform graph states using single-qubit operations: computational complexity and al- gorithms,” Quantum Science and Technology , vol. 5, no. 4, p. 045016, 2020

    2020

  52. [2005]

    Available: https://link.aps.org/doi/10.1103/PhysRevLett

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

    doi

Pith tools

Reviewed August 5, 2026 · model on record in the stance chip above.