Resource estimation for delayed choice quantum entanglement based sneakernet networks using neutral atom qLDPC memories

Srikara, S; Greentree, AD; Devitt, SJ

Resource estimation for delayed choice quantum entanglement based sneakernet networks using neutral atom qLDPC memories

Srikara, S Greentree, AD Devitt, SJ

Permalink

Publisher:: AMER PHYSICAL SOC
Publication Type:: Journal Article
Citation:: Physical Review Research, 2025, 7, (2)
Issue Date:: 2025-04-01

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download Published versionAdobe PDF (1.16 MB)

View on publisher's site

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Srikara, S
dc.contributor.author	Greentree, AD
dc.contributor.author	Devitt, SJ
dc.date.accessioned	2025-12-05T03:13:22Z
dc.date.available	2025-03-28
dc.date.available	2025-12-05T03:13:22Z
dc.date.issued	2025-04-01
dc.identifier.citation	Physical Review Research, 2025, 7, (2)
dc.identifier.issn	2643-1564
dc.identifier.issn	2643-1564
dc.identifier.uri	http://hdl.handle.net/10453/190859
dc.description.abstract	Quantum entanglement is a vital phenomenon required for realizing secure quantum networks, so much that distributed entanglement can be reimagined as a commodity which can be traded to enable and maintain these networks. We explore the idea of commercializing entanglement-based cryptography and future applications where advanced quantum memory systems support less advanced users. We design a sneakernet-based quantum communication network with a central party connecting the users through delayed choice quantum entanglement swapping, using quantum low-density-parity-check (qLDPC) encoded qubits on neutral atoms. Our analysis compares this approach with traditional surface codes, demonstrating that qLDPC codes offer superior scaling in terms of resource efficiency and logical qubit count. We show that with near-Term attainable patch sizes, one can attain medium-to high-fidelity correlations, motivating further research towards the long-Term realization of large-scale commercial quantum networks.
dc.language	English
dc.publisher	AMER PHYSICAL SOC
dc.relation.ispartof	Physical Review Research
dc.relation.isbasedon	10.1103/PhysRevResearch.7.023160
dc.rights	info:eu-repo/semantics/openAccess
dc.subject.classification	51 Physical sciences
dc.title	Resource estimation for delayed choice quantum entanglement based sneakernet networks using neutral atom qLDPC memories
dc.type	Journal Article
utslib.citation.volume	7
pubs.organisational-group	University of Technology Sydney
pubs.organisational-group	University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	University of Technology Sydney/Faculty of Engineering and Information Technology/School of Computer Science
pubs.organisational-group	University of Technology Sydney/UTS Groups
pubs.organisational-group	University of Technology Sydney/UTS Groups/Centre for Quantum Software and Information (QSI)
utslib.copyright.status	open_access	*
dc.rights.license	This work is licensed under a Creative Commons Attribution 4.0 International License (CC BY 4.0). To view a copy of this license, visit https://creativecommons.org/licenses/by/4.0/
dc.date.updated	2025-12-05T03:13:21Z
pubs.issue	2
pubs.publication-status	Published
pubs.volume	7
utslib.citation.issue	2

Abstract:

Quantum entanglement is a vital phenomenon required for realizing secure quantum networks, so much that distributed entanglement can be reimagined as a commodity which can be traded to enable and maintain these networks. We explore the idea of commercializing entanglement-based cryptography and future applications where advanced quantum memory systems support less advanced users. We design a sneakernet-based quantum communication network with a central party connecting the users through delayed choice quantum entanglement swapping, using quantum low-density-parity-check (qLDPC) encoded qubits on neutral atoms. Our analysis compares this approach with traditional surface codes, demonstrating that qLDPC codes offer superior scaling in terms of resource efficiency and logical qubit count. We show that with near-Term attainable patch sizes, one can attain medium-to high-fidelity correlations, motivating further research towards the long-Term realization of large-scale commercial quantum networks.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/190859