arXiv subjects

Yu-Shuo Lu

Publications and source records attributed to Yu-Shuo Lu.

At least 19 recordsLinked to original sources

arXiv2026

Experimental Coherent One-Way Quantum Key Distribution with Simplicity and Practical Security

Coherent one-way quantum key distribution (COW-QKD) has been widely investigated, and even been deployed in real-world quantum network. However, the proposal of the zero-error attack has critically undermined its security guarantees, and existing experimental implementations have not yet established security against coherent attacks. In this work, we propose and experimentally demonstrate an information-theoretically secure COW-QKD protocol that can resist source side-channel attacks, with secure transmission distances up to 100 km. Our system achieves a secure key rate on the order of kilobits per second over 50 km in the finite-size regime, sufficient for real-time secure voice communication across metropolitan networks. Furthermore, we demonstrate the encrypted transmission of a logo with information-theoretic security over 100 km of optical fiber. These results confirm that COW-QKD can simultaneously provide simplicity and security, establishing it as a strong candidate for deployment in small-scale quantum networks.

quant-ph↗

arXiv2025

Experimentally validated quantum-secure federated learning over a multi-user quantum network

Federated learning enables decentralized, privacy-preserving training but remains vulnerable to privacy leakage in the quantum era. Quantum federated learning (QFL) offers a promising path towards enhanced security and efficiency. However, a practical and experimentally validated QFL protocol utilizing near-term quantum techniques to address data privacy has been lacking. Here we present QuNetQFL, a QFL protocol implemented on quantum networks, in which local model updates are masked with distributed quantum secret keys, offering information-theoretic security during aggregation. We experimentally validate the protocol on a four-client quantum network and benchmark its performance using the generated keys on quantum and real-world datasets. Adding a single quantum client significantly improves global accuracy for classifying multipartite entangled and non-stabilizer quantum datasets. For language tasks, we apply QuNetQFL to sentiment analysis by federated fine-tuning of a hybrid classical-quantum language model, achieving comparable and robust performance in simulation and on real quantum hardware. Large-scale simulations further demonstrate scalability to 200 clients for handwritten-digit recognition, with rapid convergence and a $75\%$ reduction in communication cost via model compression. Our work establishes a practical and scalable route to quantum-secure federated learning for the emerging quantum internet.

quant-ph↗

arXiv2024

Multi-field quantum conferencing overcomes the network capacity limit

Quantum conferencing enables multiple nodes within a quantum network to share a secure group key for private message broadcasting. The key rate, however, is limited by the repeaterless capacity to distribute multiparticle entangled states across the network. Currently, in the finite-size regime, no feasible schemes utilizing existing experimental techniques can overcome the fundamental rate-distance limit of quantum conferencing in quantum networks without repeaters. Here, we propose a practical, multi-field scheme that breaks this limit, involving virtually establishing Greenberger-Horne-Zeilinger states through post-measurement coincidence matching. This proposal features a measurement-device-independent characteristic and can directly scale to support any number of users. Simulations show that the fundamental limitation on the group key rate can be overcome in a reasonable running time of sending $10^{14}$ pulses. We predict that it offers an efficient design for long-distance broadcast communication in future quantum networks.

quant-ph↗

arXiv2024

Repeater-like asynchronous measurement-device-independent quantum conference key agreement

Quantum conference key agreement enables secure communication among multiple parties by leveraging multipartite entanglement, which is expected to play a crucial role in future quantum networks. However, its practical implementation has been severely limited by the experimental complexity and low efficiency associated with the requirement for synchronous detection of multipartite entangled states. In this work, we propose a measurement-device-independent quantum conference key agreement protocol that employs asynchronous Greenberger-Horne-Zeilinger state measurement. Our protocol enables a linear scaling of the conference key rate among multiple parties, demonstrating performance comparable to that of the single-repeater scheme in quantum networks. Additionally, we achieve intercity transmission distances with composable security under finite-key conditions. By adopting the generalized asynchronous pairing strategy, our approach eliminates the need for complex global phase locking techniques. Furthermore, by integrating asynchronous pairing with ring-interference network structure, our method provides insights for various quantum tasks beyond quantum communication, including multiparty computing and quantum repeaters.

quant-ph↗

arXiv2023

Advantages of Asynchronous Measurement-Device-Independent Quantum Key Distribution in Intercity Networks

The new variant of measurement-device-independent quantum key distribution (MDI-QKD), called asynchronous MDI-QKD or mode-pairing MDI-QKD, offers similar repeater-like rate-loss scaling but has the advantage of simple technology implementation by exploiting an innovative post-measurement pairing technique. We herein present an evaluation of the practical aspects of decoy-state asynchronous MDI-QKD. To determine its effectiveness, we analyze the optimal method of decoy-state calculation and examine the impact of asymmetrical channels and multi-user networks. Our simulations show that, under realistic conditions, aynchronous MDI-QKD can furnish the highest key rate with MDI security as compared to other QKD protocols over distances ranging from 50 km to 480 km. At fiber distances of 50 km and 100 km, the key rates attain 6.02 Mbps and 2.29 Mbps respectively, which are sufficient to facilitate real-time one-time-pad video encryption. Our findings indicate that experimental implementation of asynchronous MDI-QKD in intercity networks can be both practical and efficient.

quant-ph↗

arXiv2022

Experimental Quantum Communication Overcomes the Rate-loss Limit without Global Phase Tracking

Secure key rate (SKR) of point-point quantum key distribution (QKD) is fundamentally bounded by the rate-loss limit. Recent breakthrough of twin-field (TF) QKD can overcome this limit and enables long distance quantum communication, but its implementation necessitates complex global phase tracking and requires strong phase references which not only add to noise but also reduce the duty cycle for quantum transmission. Here, we resolve these shortcomings, and importantly achieve even higher SKRs than TF-QKD, via implementing an innovative but simpler measurement-device-independent QKD which realizes repeater-like communication through asynchronous coincidence pairing. Over 413 and 508 km optical fibers, we achieve finite-size SKRs of 590.61 and 42.64 bit/s, which are respectively 1.80 and 4.08 times of their corresponding absolute rate limits. Significantly, the SKR at 306 km exceeds 5 kbit/s and meets the bitrate requirement for live one-time-pad encryption of voice communication. Our work will bring forward economical and efficient intercity quantum-secure networks.

quant-ph↗

arXiv2022

Beating the fault-tolerance bound and security loopholes for Byzantine agreement with a quantum solution

Byzantine agreement, the underlying core of blockchain, aims to make every node in a decentralized network reach consensus. Classical Byzantine agreements unavoidably face two major problems. One is $1/3$ fault-tolerance bound, which means that the system to tolerate $f$ malicious players requires at least $3f+1$ players. The other is the security loopholes from its classical cryptography methods. Here, we propose a Byzantine agreement framework with unconditional security to break this bound with nearly $1/2$ fault tolerance due to multiparty correlation provided by quantum digital signatures. \textcolor{black}{It is intriguing that quantum entanglement is not necessary to break the $1/3$ fault-tolerance bound, and we show that weaker correlation, such as asymmetric relationship of quantum digital signature, can also work.} Our work strictly obeys two Byzantine conditions and can be extended to any number of players without requirements for multiparticle entanglement. We experimentally demonstrate three-party and five-party consensus for a digital ledger. Our work indicates the quantum advantage in terms of consensus problems and suggests an important avenue for quantum blockchain and quantum consensus networks.

quant-ph↗

arXiv2022

Experimental quantum advantage with quantum coupon collector

An increasing number of communication and computational schemes with quantum advantages have recently been proposed, which implies that quantum technology has fertile application prospects. However, demonstrating these schemes experimentally continues to be a central challenge because of the difficulty in preparing high-dimensional states or highly entangled states. In this study, we introduce and analyse a quantum coupon collector protocol by employing coherent states and simple linear optical elements, which was successfully demonstrated using realistic experimental equipment. We showed that our protocol can significantly reduce the number of samples needed to learn a specific set compared with the classical limit of the coupon collector problem. We also discuss the potential values and expansions of the quantum coupon collector by constructing a quantum blind box game. The information transmitted by the proposed game also broke the classical limit. These results strongly prove the advantages of quantum mechanics in machine learning and communication complexity.

quant-ph↗

arXiv2022

Breaking the Rate-Loss Bound of Quantum Key Distribution with Asynchronous Two-Photon Interference

Twin-field quantum key distribution can overcome the secret key capacity of repeaterless quantum key distribution via single-photon interference. However, to compensate for the channel fluctuations and lock the laser fluctuations, the techniques of phase tracking and phase locking are indispensable in experiment, which drastically increase experimental complexity and hinder free-space realization. Inspired by the duality in entanglement, we herein present an asynchronous measurement-device-independent quantum key distribution protocol that can surpass the secret key capacity even without phase tracking and phase locking. Leveraging the concept of time multiplexing, asynchronous two-photon Bell-state measurement is realized by postmatching two interference detection events. For a 1 GHz system, the new protocol reaches a transmission distance of 450 km without phase tracking. After further removing phase locking, our protocol is still capable of breaking the capacity at 270 km. Intriguingly, when using the same experimental techniques, our protocol has a higher key rate than the phase-matching-type twin-field protocol. In the presence of imperfect intensity modulation, it also has a significant advantage in terms of the transmission distance over the sending-or-not-sending type twin-field protocol. With high key rates and accessible technology, our work provides a promising candidate for practical scalable quantum communication networks.

quant-ph↗

arXiv2022

Source-independent quantum random number generator against tailored detector blinding attacks

Randomness, mainly in the form of random numbers, is the fundamental prerequisite for the security of many cryptographic tasks. Quantum randomness can be extracted even if adversaries are fully aware of the protocol and even control the randomness source. However, an adversary can further manipulate the randomness via tailored detector blinding attacks, which are hacking attacks suffered by protocols with trusted detectors. Here, by treating no-click events as valid events, we propose a quantum random number generation protocol that can simultaneously address source vulnerability and ferocious tailored detector blinding attacks. The method can be extended to high-dimensional random number generation. We experimentally demonstrate the ability of our protocol to generate random numbers for two-dimensional measurement with a generation speed of 0.1 bit per pulse.

quant-ph↗

arXiv2021

Scalable High-Rate Twin-Field Quantum Key Distribution Networks without Constraint of Probability and Intensity

Implementation of a twin-field quantum key distribution network faces limitations, including the low tolerance of interference errors for phase-matching type protocols and the strict constraint regarding intensity and probability for sending-or-not-sending type protocols. Here, we propose a two-photon twin-field quantum key distribution protocol and achieve twin-field-type two-photon interference through post-matching phase-correlated single-photon interference events. We exploit the non-interference mode as the code mode to highly tolerate interference errors, and the two-photon interference naturally removes the intensity and probability constraint. Therefore, our protocol can transcend the abovementioned limitations while breaking the secret key capacity of repeaterless quantum key distribution. Simulations show that for a four-user networks, under which each node with fixed system parameters can dynamically switch different attenuation links, the key rates of our protocol for all six links can either exceed or approach the secret key capacity. However, the key rates of all links are lower than the key capacity when using phase-matching type protocols. Additionally, four of the links could not extract the key when using sending-or-not-sending type protocols. We anticipate that our protocol can facilitate the development of practical and efficient quantum networks.

quant-ph↗

arXiv2021

Homodyne Detection Quadrature Phase Shift Keying Continuous-Variable Quantum Key Distribution with High Excess Noise Tolerance

Discrete-modulated continuous-variable quantum key distribution with homodyne detection is widely recognized for its ease of implementation, efficiency with respect to error correction, and its compatibility with modern optical communication devices. However, recent studies report that the application of homodyne detection obtains poor tolerance to excess noise and insufficient transmission distance, hence seriously restricting the large-scale deployment of quantum secure communication networks. In this paper, we propose a homodyne detection protocol using the quadrature phase shift keying technique. By limiting information leakage, our proposed protocol enhances excess noise tolerance to a high level. Furthermore, we demonstrate that homodyne detection performs better than heterodyne detection in quaternary-modulated continuous-variable quantum key distribution under the untrusted detector noise scenario. The security is analyzed using the tight numerical method against collective attacks in the asymptotic regime. Our results imply that the current protocol is able to distribute keys in nearly intercity area and thus paves the way for constructing low-cost quantum secure communication networks.

quant-ph↗

arXiv2021

Coherent one-way quantum conference key agreement based on twin field

Quantum conference key agreement (CKA) enables key sharing among multiple trusted users with information-theoretic security. Currently, the key rates of most quantum CKA protocols suffer from the limit of the total efficiency among quantum channels. Inspired by the coherent one-way and twin-field quantum key distribution (QKD) protocols, we propose a quantum CKA protocol of three users. Exploiting coherent states with intensity 0 and $μ$ to encode logic bits, our protocol can break the limit. Additionally, the requirements of phase randomization and multiple intensity modulation are removed in our protocol, making its experimental demonstration simple.

quant-ph↗

arXiv2021

Secure and practical multiparty quantum digital signatures

Quantum digital signatures (QDSs) promise information-theoretic security against repudiation and forgery of messages. Compared with currently existing three-party QDS protocols, multiparty protocols have unique advantages in the practical case of more than two receivers when sending a mass message. However, complex security analysis, numerous quantum channels and low data utilization efficiency make it intractable to expand three-party to multiparty scenario. Here, based on six-state non-orthogonal encoding protocol, we propose an effective multiparty QDS framework to overcome these difficulties. The number of quantum channels in our protocol only linearly depends on the number of users. The post-matching method is introduced to enhance data utilization efficiency and make it linearly scale with the probability of detection events even for five-party scenario. Our work compensates for the absence of practical multiparty protocols, which paves the way for future QDS networks.

quant-ph↗

arXiv2021

Experimental quantum secure network with digital signatures and encryption

Cryptography promises four information security objectives, namely, confidentiality, integrity, authenticity, and non-repudiation, to support trillions of transactions annually in the digital economy. Efficient digital signatures, ensuring the integrity, authenticity, and non-repudiation of data with information-theoretical security are highly urgent and intractable open problems in cryptography. Here, we propose a protocol of high-efficiency quantum digital signatures using secret sharing, one-time universal$_2$ hashing, and the one-time pad. We just need to use a 384-bit key to sign documents of up to $2^{64}$ lengths with a security bound of $10^{-19}$. If one-megabit document is signed, the signature efficiency is improved by more than $10^8$ times compared with previous quantum digital signature protocols. Furthermore, we build the first all-in-one quantum secure network integrating information-theoretically secure communication, digital signatures, secret sharing, and conference key agreement and experimentally demonstrate this signature efficiency advantage. Our work completes the cryptography toolbox of the four information security objectives.

quant-ph↗

arXiv2021

Efficient Quantum Digital Signatures without Symmetrization Step

Quantum digital signatures (QDS) exploit quantum laws to guarantee non-repudiation, unforgeability and transferability of messages with information-theoretic security. Current QDS protocols face two major restrictions, including the requirement of the symmetrization step with additional secure classical channels and quadratic scaling of the signature rate with the probability of detection events. Here, we present an efficient QDS protocol to overcome these issues by utilizing the classical post-processing operation called post-matching method. Our protocol does not need the symmetrization step, and the signature rate scales linearly with the probability of detection events. Simulation results show that the signature rate is three orders of magnitude higher than the original protocol in a 100-km-long fiber. This protocol is compatible with existing quantum communication infrastructure, therefore we anticipate that it will play a significant role in providing digital signatures with unconditional security.

quant-ph↗

arXiv2021

Overcoming the rate-distance limit of device-independent quantum key distribution

Device-independent quantum key distribution (DIQKD) exploits the violation of a Bell inequality to extract secure key even if the users' devices are untrusted. Currently, all DIQKD protocols suffer from the secret key capacity bound, i.e., the secret key rate scales linearly with the transmittance of two users. Here we propose a heralded DIQKD scheme based on entangled coherent states to improve entangling rates whereby long-distance entanglement is created by single-photon-type interference. The secret key rate of our scheme can significantly outperform the traditional two-photon-type Bell-state measurement scheme and, importantly, surpass the above capacity bound. Our protocol therefore is an important step towards a realization of DIQKD and can be a promising candidate scheme for entanglement swapping in future quantum internet.

quant-ph↗

arXiv2020

Simplified BB84 quantum key distribution secure against coherent attacks

Decoy-state quantum key distribution (QKD) has convincingly been shown the core solution to secure key exchange. While standard BB84 protocol needs to prepare and measure all states of two complementary bases, which seriously restricts its real life applications in photonic integration and high speed system. Fortunately, a simplified BB84, only sending and receiving three states, achieves the same asymptotic secret key rate compared with standard BB84 under coherent attacks. In this work, by skillfully exploiting uncertainty relation for smooth entropies, we provide the finite-key security bounds for decoy-state simplified BB84 QKD against coherent attacks in the universally composable framework. Simulation results show that it can also achieve almost the same performance compared with standard BB84 even the total number of pulses is as low as $10^{8}$. We conclude that simplified BB84 can completely replace standard BB84 to be the best choice for QKD in most common practical scenarios.

quant-ph↗