XiongFeng Ma

Quantum networks, integrating quantum communication, quantum metrology, and distributed quantum computing, could provide secure and efficient information transfer, high-resolution sensing, and an exponential speed-up in information processing. Deterministic entanglement distribution over long distances is a prerequisite for scalable quantum networks, enabling the utilization of device-independent quantum key distribution (DI-QKD) and quantum teleportation to achieve secure and efficient information transfer. However, the exponential photon loss in optical fibres prohibits efficient and deterministic entanglement distribution. Quantum repeaters, incorporating entanglement swapping and entanglement purification with quantum memories, offer the most promising means to overcome this limitation in fibre-based quantum networks. Despite numerous pioneering efforts toward realizing quantum repeaters, a critical bottleneck remains, as remote memory-memory entanglement suffers from decoherence more rapidly than it can be established and purified over long distances. We overcome this by developing long-lived trapped-ion memories, an efficient telecom interface, and a high-visibility single-photon entanglement protocol. This allows us to establish and maintain memory-memory entanglement over a 10 km fibre within the average entanglement establishment time for the same distance. As a direct application, we demonstrate metropolitan-scale DI-QKD, distilling 1,917 secret keys out of 4.05*10^5 Bell pairs over 10 km. We further report a positive key rate over 101 km in the asymptotic limit, extending the achievable distance by more than two orders of magnitude. Our work provides a critical building block for quantum repeaters and marks an important step toward scalable quantum networks.

Complementarity is an essential feature of quantum mechanics. The preparation of an eigenstate of one observable implies complete randomness in its complementary observable. In quantum cryptography, complementarity allows us to formulate security analyses in terms of phase-error correction. However, in the device-independent regime that offers security without device characterization, the concept becomes much subtler. Security proofs of device-independent quantum cryptography tasks are often complex and quite different from those of their more standard device-dependent cousins. The existing proofs pose huge challenges to experiments, among which large data-size requirement is a crux. Here, we show the complementarity security origin of the device-independent tasks. By linking complementarity with quantum nonlocality, we recast the device-independent scheme into a quantum error correction protocol. Going beyond the identical-and-independent-distribution case, we consider the most general attack. We generalize the sample entropy in classical Shannon theory for the finite-size analysis. Our method exhibits good finite-size performance and brings the device-independent scheme to a more practical regime. Applying it to the data in a recent ion-trap-based device-independent quantum key distribution experiment, one could reduce the requirement on data size to less than a third. Furthermore, the complementarity approach can be naturally extended to advantage key distillation to ease experiments by tolerating higher loss and lower transmittance.

The generation and verification of large-scale entanglement are essential to the development of quantum technologies. In this paper, we present an efficient scheme to generate genuine multipartite entanglement of a large number of qubits by using the Heisenberg interaction. This method can be conveniently implemented in various physical platforms, including superconducting, trapped-ion, and cold-atom systems. In order to characterize the entanglement of the output quantum state, we generalize the stabilizer formalism and develop an entanglement witness method. In particular, we design a generic searching algorithm to optimize entanglement witness with a minimal number of measurement settings under a given noise level. From the perspective of practical applications, we numerically study the trade-off between the experiment efficiency and the detection robustness.

The output randomness from a random number generator can be certified by observing the violation of quantum contextuality inequalities based on the Kochen-Specker theorem. Contextuality can be tested in a single quantum system, which significantly simplifies the experimental requirements to observe the violation comparing to the ones based on nonlocality tests. However, it is not yet resolved how to ensure compatibilities for sequential measurements that is required in contextuality tests. Here, we employ a modified Klyachko-Can-Binicioğlu-Shumovsky contextuality inequality, which can ease the strict compatibility requirement on measurements. On a trapped single \Ba ion system, we experimentally demonstrate violation of the contextuality inequality and realize self-testing quantum random number expansion by closing detection loopholes. We perform $1.29 \times 10^8$ trials of experiments and extract the randomness of $8.06 \times 10^5$ bits with a speed of 270 bits s$^{-1}$. Our demonstration paves the way for the practical high-speed spot-checking quantum random number expansion and other secure information processing applications.