Scalable implementation of $(d+1)$ mutually unbiased bases for $d$-dimensional quantum key distribution
Takuya Ikuta, Seiseki Akibue, Yuya Yonezu, Toshimori Honjo, Hiroki, Takesue, Kyo Inoue

TL;DR
This paper presents a scalable method to implement all $(d+1)$ mutually unbiased bases in high-dimensional quantum key distribution using a logarithmic number of interferometers, enhancing robustness and efficiency.
Contribution
It introduces a general, scalable implementation of $(d+1)$ MUBs for $d$-dimensional QKD using $ ext{log}_p d$ interferometers, applicable in prime power dimensions.
Findings
Achieved an average error rate of 3.8% for phase bases in $d=4$.
Demonstrated the setup's scalability and robustness against errors.
Lower error rate than the 23.17% threshold for secure QKD.
Abstract
A high-dimensional quantum key distribution (QKD) can improve error rate tolerance and the secret key rate. Many -dimensional QKDs have used two mutually unbiased bases (MUBs), while MUBs enable a more robust QKD, especially against correlated errors. However, a scalable implementation has not been achieved because the setups have required devices even for two MUBs or a flexible convertor for a specific optical mode. Here, we propose a scalable and general implementation of MUBs using interferometers in prime power dimensions . We implemented the setup for time-bin states and observed an average error rate of 3.8% for phase bases, which is lower than the 23.17% required for a secure QKD against coherent attack in .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Information and Cryptography · Quantum Computing Algorithms and Architecture · Semiconductor Quantum Structures and Devices
