we experimentally implement a fault-tolerant quantum key distribution protocol with two photons in a decoherence-free subspace (DFS). It is demonstrated that our protocol can yield good key rate even with large bit-flip error rate caused by collective rotation, while the usual realization of BB84 protocol cannot produce any secure final key given the same channel. Since the experiment is performed in polarization space and does not need the calibration of reference frame, important applications in free-space quantum communication are expected. Moreover, our method can also be used to robustly transmit an arbitrary two-level quantum state in a type of DFS.
Holonomic quantum computation (HQC) may not show its full potential in quantum speedup due to the prerequisite of a long coherent runtime imposed by the adiabatic condition. Here we show that the conventional HQC can be dramatically accelerated by using external control fields, of which the effectiveness is exclusively determined by the integral of the control fields in the time domain. Remarkably this control scheme can be realized with net zero energy cost and it is fault-tolerant against fluctuation and noise, significantly relaxing the experimental constraints. We demonstrate how to realiz…
Quantum algorithms can break factoring and discrete logarithm based cryptography and weaken symmetric cryptography and hash functions. In order to estimate the real-world impact of these attacks, apart from tracking the development of fault-tolerant quantum computers it is important to have an estimate of the resources needed to implement these quantum attacks. For attacking symmetric cryptography and hash functions, generic quantum attacks are substantially less powerful than they are for today's public-key cryptography. So security will degrade gradually as quantum computing resources increa…
Plugging Leaks in Fault-Tolerant Quantum Computation and Verification
National Quantum Computing Centre, Rutherford Appleton Laboratory（拉瑟福德·阿普尔顿实验室国家量子计算中心）；School of Informatics, University of Edinburgh（爱丁堡大学信息学院）；Quandela；Département d’Informatique, Ecole Normale Supérieure（巴黎高等师范学院计算机科学系）
We sketch a relation between two crucial, yet independent, fields in quantum information research, viz. quantum decoherence and quantum cryptography. We investigate here how the standard cryptographic assumption of shielded laboratory, stating that data generated by a secure quantum device remain private unless explicitly published, is disturbed by the einselection mechanism of quantum Darwinism explaining the measurement process by interaction with the external environment. We illustrate the idea with a paradigmatic example of a quantum random number generator compromised by an analog of the …
The three-spin-$1/2$ decoherence-free subsystem defines a logical qubit protected from collective noise and supports exchange-only universal gates. Such logical qubits are well-suited for implementation with electrically-defined quantum dots. Exact exchange-only entangling logical gates exist but are challenging to construct and understand. We use a decoupling strategy to obtain straightforward approximate entangling gates. A benefit of the strategy is that if the physical spins are aligned, then it can implement evolution under entangling Hamiltonians. Hamiltonians expressible as linear combi…
To solve classically hard problems, quantum computers need to be resilient to the influence of noise and decoherence. In such a fault-tolerant quantum computer, noise-induced errors must be detected and corrected in real-time to prevent them from propagating between components. This requirement is especially pertinent while applying quantum gates, when the interaction between components can cause errors to quickly spread throughout the system. However, the large overhead involved in most fault-tolerant architectures makes implementing these systems a daunting task, which motivates the search f…
Nonadiabatic holonomic quantum computation~(NHQC) provides an essential way to construct robust and high-fidelity quantum gates due to its geometric features. However, NHQC is more sensitive to the decay and dephasing errors than conventional dynamical gate since it requires an ancillary intermediate state. Here, we utilize the Hamiltonian reverse engineering technique to study the influence of the intermediate state-decoherence on the NHQC gate fidelity, and propose the novel schemes to construct the arbitrary single-qubit holonomic gate and nontrivial two-qubit holonomic gate with high fidel…
University of Science and Technology of China（中国科学技术大学）；Laboratory of Quantum Information, University of Science and Technology of China（中国科学技术大学量子信息实验室）；Center for Quantum Information, Institute for Interdisciplinary Information Sciences, Tsinghua University（清华大学交叉信息研究院量子信息中心）；Hefei National Laboratory（合肥国家实验室）；CAS Center For Excellence in Quantum Information and Quantum Physics, University of Science and Technology of China（中国科学院量子信息与量子物理学前沿卓越创新中心）
The framework of this thesis is fault-tolerant quantum algorithms. Grover's algorithm and quantum walks are described in Chapter 2. We start by highlighting the central role that rotations play in quantum algorithms, explaining Grover's, why it is optimal, and how it may be extended. Key subroutines explained in this area are amplitude amplification and quantum walks, which will constitute useful parts of other algorithms. In the third chapter, in contrast, we turn to the exponential advantages promised by the Fourier transform in the context of the hidden subgroup problem. However, since this…
Geometric quantum computation offers a practical strategy toward robust quantum computation due to its inherently error tolerance. However, the rigorous geometric conditions lead to complex and/or error-disturbed quantum controls, especially for logical qubits that involve more physical qubits, whose error tolerance is effective in principle though, their experimental demonstration is still demanding. Thus, how to best simplify the needed control and manifest its full advantage has become the key to widespread applications of geometric quantum computation. Here we propose a new fast and robust…
Quantum position verification (QPV) is the art of verifying the geographical location of an untrusted party. Recently, it has been shown that the widely studied Bennett & Brassard 1984 (BB84) QPV protocol is insecure after the 3 dB loss point assuming local operations and classical communication (LOCC) adversaries. Here, we propose a time-reversed entanglement swapping QPV protocol (based on measurement-device-independent quantum cryptography) that is highly robust against quantum channel loss. First, assuming ideal qubit sources, we show that the protocol is secure against LOCC adversaries fo…
Quantum key distribution is an effective encryption technique which can be used to perform secure quantum communication between satellite and ground stations. Quantum cryptography enhances security in various networks such as optical fibers and wireless networks. In addition to this, these networks become vulnerable in presence of high attenuation due to atmospheric effects and noise. Hence, errors occur due to decoherence. The noisy quantum channel is modeled and implemented by the redundancy-free quantum error correction scheme which provides better security and throughput efficiency as show…
Shared entanglement between spatially separated systems is an essential resource for quantum information processing including long-distance quantum cryptography and teleportation. While purification protocols for mixed distributed entangled quantum states exist, it is not clear how to optimally distribute entanglement to remote locations. Here, we describe a deterministic protocol for generating a maximally entangled state between remote locations that only uses local operations on qubits, and requires no classical communication between the separated parties. The procedure may provide protecti…
