The BB84 quantum key distribution (QKD) combined with decoy-state method is currently the most practical protocol, which has been proved secure against general attacks in the finite-key regime. Thereinto, statistical fluctuation analysis methods are very important in dealing with finite-key effects, which directly affect secret key rate, secure transmission distance and most importantly, the security. There are two tasks of statistical fluctuation in decoy-state BB84 QKD. One is the deviation between expected value and observed value for a given expected value or observed value. The other is the deviation between phase error rate of computational basis and bit error rate of dual basis. Here, we provide the rigorous and optimal analytic formula to solve the above tasks, resulting to higher secret key rate and longer secure transmission distance. Our results can be widely applied to deal with statistical fluctuation in quantum cryptography protocols. So far, there have existed many kinds of protocols describing how quantum key distribution (QKD) 1,2 works, such as the Bennett-Brassard-1984 (BB84) 3 , Bennett-Brassard-Mermin-1992 4 , Bennett-1992 5 , six-state 6 , continuous variable 7,8 and measurement-device-independent 9-11 protocols. Although different protocols contain different processes, they all serve the same purpose to guarantee that two parties, named Alice and Bob, can share a string of key data through a channel fully controlled by an eavesdropper, named Eve 3. Unlike some computational assumptions, these protocols are all proven to be secure with fundamental physical laws in the recent years 12-18 , which shows the great advantage in information transmitting that QKD holds. BB84 stands out as the most important protocol due to its best overall performance. However, implementations of the BB84 protocol differ from the original theoretical proposal. For an ideal single-photon source is not available yet, in actuality, a weak pulsed laser source is in place of it. Nevertheless, there is a critical flaw in the weak pulsed laser source that an non-negligible part of laser pulses contains more than one photon, which will be exploited by Eve through the photon-number-splitting (PNS) attack 19. To address this drawback with high channel loss, the decoy-state method is introduced 20-22. The source will generate the phase-randomized coherent state in decoy-state method, which can be regarded as the mixed photon number state. The essence of the decoy state idea can be summarized as that the yield (bit error rate) of n-photon in signal state is equal to that in decoy state. However, this equal-yield condition can only be established under the asymptotic-key regime. The expected value of yield (bit error rate) of n-photon in signal state and decoy state are identical while the corresponding observed value cannot be assumed to be the same in the finite-key regime. By exploiting the decoy-state method, one can establish the linear system of equations about the expected values to obtain expected value of yield (bit er...

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 analyze 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.

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.

Neural networks have achieved impressive breakthroughs in both industry and academia. How to effectively develop neural networks on quantum computing devices is a challenging open problem. Here, we propose a new quantum neural network model for quantum neural computing using (classically controlled) single-qubit operations and measurements on real-world quantum systems with naturally occurring environment-induced decoherence, which greatly reduces the difficulties of physical implementations. Our model circumvents the problem that the state-space size grows exponentially with the number of neurons, thereby greatly reducing memory requirements and allowing for fast optimization with traditional optimization algorithms. We benchmark our model for handwritten digit recognition and other nonlinear classification tasks. The results show that our model has an amazing nonlinear classification ability and robustness to noise. Furthermore, our model allows quantum computing to be applied in a wider context and inspires the earlier development of a quantum neural computer than standard quantum computers.

Continuous-variable quantum key distribution (CV QKD) with discrete modulation has attracted increasing attention due to its experimental simplicity, lower-cost implementation and compatibility with classical optical communication. Correspondingly, some novel numerical methods have been proposed to analyze the security of these protocols against collective attacks, which promotes key rates over one hundred kilometers of fiber distance. However, numerical methods are limited by their calculation time and resource consumption, for which they cannot play more roles on mobile platforms in quantum networks. To improve this issue, a neural network model predicting key rates in nearly real time has been proposed previously. Here, we go further and show a neural network model combined with Bayesian optimization. This model automatically designs the best architecture of neural network computing key rates in real time. We demonstrate our model with two variants of CV QKD protocols with quaternary modulation. The results show high reliability with secure probability as high as 99.15% − 99.59%, considerable tightness and high efficiency with speedup of approximately 107 in both cases. This inspiring model enables the real-time computation of unstructured quantum key distribution protocols’ key rate more automatically and efficiently, which has met the growing needs of implementing QKD protocols on moving platforms.

Numerical methods are widely used to calculate the secure key rate of many quantum key distribution protocols in practice, but they consume many computing resources and are too time-consuming. In this work, we take the homodyne detection discrete-modulated continuous-variable quantum key distribution (CV-QKD) as an example, and construct a neural network that can quickly predict the secure key rate based on the experimental parameters and experimental results. Compared to traditional numerical methods, the speed of the neural network is improved by several orders of magnitude. Importantly, the predicted key rates are not only highly accurate but also highly likely to be secure. This allows the secure key rate of discrete-modulated CV-QKD to be extracted in real time on a low-power platform. Furthermore, our method is versatile and can be extended to quickly calculate the complex secure key rates of various other unstructured quantum key distribution protocols.

Quantum network applications such as distributed quantum computing and quantum secret sharing represent a promising future network equipped with quantum resources. Entanglement generation and distribution over long distances are critical and unavoidable when utilizing quantum technology in a fully connected network. The distribution of bipartite entanglement over long distances has seen some progress, while the distribution of multipartite entanglement over long distances remains unsolved. Here we report a two-dimensional quantum repeater protocol for the generation of multipartite entanglement over long distances with an all-photonic framework to fill this gap. The entanglement generation yield remains proportional to the transmission efficiency regardless of the number of network users and shows long transmission distance under various numbers of network users. With the improved efficiency and flexibility of extending the number of users, we anticipate that our protocol can work as a significant building block for quantum networks in the future.

Quantum conference key agreement is an important cryptographic primitive for future quantum network. Realizing this primitive requires high-brightness and robust multiphoton entanglement sources, which is challenging in experiment and unpractical in application because of limited transmission distance caused by channel loss. Here we report a measurement-device-independent quantum conference key agreement protocol with enhanced transmission efficiency over lossy channel. With spatial multiplexing nature and adaptive operation, our protocol can break key rate bounds on quantum communication over quantum network without quantum memory. Compared with previous work, our protocol shows superiority in key rate and transmission distance within the state-of-the-art technology. Furthermore, we analyse the security of our protocol in the composable framework and evaluate its performance in the finite-size regime to show practicality. Based on our results, we anticipate that our protocol will play an important role in constructing multipartite quantum network.