Quick Navigation
Topics
Quantum Algorithms
High-dimensional quantum communication with scalable photonic entanglement in time and frequency
arXiv
Authors: Kai-Chi Chang, Murat Can Sarihan, Nicky Kai Hong Li, Florian Kanitschar, Kemal Enes Akyuz, Yujie Chen, Dong-Il Lee, Jin Ho Kang, Alwaleed Aldhafeeri, Andrew Mueller, Matthew D. Shaw, Boris Korzh, Maria Spiropulu, Paul Erker, Marcus Huber, Chee Wei Wong
Year
2026
Paper ID
30592
Status
Preprint
Abstract Read
~2 min
Abstract Words
148
Citations
N/A
Abstract
High-dimensional photonic entanglement holds significant promise for advancing quantum communication, computation, and metrology. For example, large-alphabet quantum communication protocols are known to benefit from enhanced noise resilience and information capacity via multi-bit time-bin encoding. Yet, characterizing high-dimensional entangled states is challenging, as full state tomography becomes prohibitively costly and often requires unrealizable measurements. Here, we demonstrate a scan-free method to characterize high-dimensional entanglement in the time-frequency domain. Our reconstruction achieves a record 5.70pm0.07 ebits and a fidelity of 65.4pm0.4\% with the maximally entangled state of local dimension 1021, certifying the presence of 668-dimensional entanglement. We further prove the attainability of a secure key rate of 15.6 kB/s in a composable finite-size, entanglement-based protocol, and show that in continuous operation, the setup can quickly approach asymptotic key rates. Using commercial telecom components and state-of-the-art low-jitter single-photon detectors, our scalable architecture offers a practical path towards high-rate, noise-resilient quantum communication testbeds.
Why This Paper Matters
- It adds a 2026 reference point for readers tracking recent quantum research.
- High-dimensional photonic entanglement holds significant promise for advancing quantum communication, computation, and metrology.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.