We propose a scheme to measure the parity of two distant qubits, while ensuring that losses on the quantum channel between them does not destroy coherences within the parity subspaces. This capability enables deterministic preparation of highly entangled qubit states whose fidelity is not limited by the transmission loss. The key observation is that for a probe electromagnetic field in a particular quantum state, namely a superposition of two coherent states of opposite phases, the transmission loss stochastically applies a near-unitary back-action on the probe state. This leads to a parity measurement protocol where the main effect of the transmission losses is a decrease in the measurement strength. By repeating the non-destructive (weak) parity measurement, one achieves a high-fidelity entanglement in spite of a significant transmission loss.
In this paper we provide a basic introduction of the core ideas and theories surrounding fault-tolerant quantum computation. These concepts underly the theoretical framework of large-scale quantum computation and communications and are the driving force for many recent experimental efforts to construct small to medium sized arrays of controllable quantum bits. We examine the basic principals of redundant quantum encoding, required to protect quantum bits from errors generated from both imprecise control and environmental interactions and then examine the principals of fault-tolerance from larg…
Transferring quantum information between distant nodes of a network is a key capability. This transfer can be realized via remote state preparation where two parties share entanglement and the sender has full knowledge of the state to be communicated. Here we demonstrate such a process between heterogeneous nodes functioning with different information encodings, i.e., particle-like discrete-variable optical qubits and wave-like continuous-variable ones. Using hybrid entanglement of light as a shared resource, we prepare arbitrary coherent-state superpositions controlled by measurements on the …
Quantum random-access look-up of a string of classical bits is a necessary ingredient in several important quantum algorithms. In some cases, the cost of such quantum random-access memory (qRAM) is the limiting factor in the implementation of the algorithm. In this paper we study the cost of fault-tolerantly implementing a qRAM. We construct and analyze generic families of circuits that function as a qRAM, discuss opportunities for qubit-time tradeoffs, and estimate their resource costs when embedded in a surface code.
Quantum data locking is a quantum communication primitive that allows the use of a short secret key to encrypt a much longer message. It guarantees information-theoretical security against an adversary with limited quantum memory. Here we present a quantum data locking protocol that employs pseudo-random circuits consisting of Clifford gates only, which are much easier to implement fault tolerantly than universal gates. We show that information can be encrypted into $n$-qubit code words using order $n - H_\mathrm{min}(\mathsf{X})$ secret bits, where $H_\mathrm{min}(\mathsf{X})$ is the min-entr…
Preparing highly entangled quantum states between remote parties is a major challenge for quantum communications [1-8]. Particularly promising in this context are the N00N states, which are entangled N-photon wavepackets delocalized between two different locations, providing measurement sensitivity limited only by the uncertainty principle [1, 10-15]. However, these states are notoriously vulnerable to losses, making it difficult both to share them between remote locations, and to recombine them to exploit interference effects. Here we address this challenge by utilizing the reverse version of…
Logical entanglement distribution between distant 2D array qubits
Graduate School of Engineering Science, Osaka University（大阪大学工学研究科）；NTT Computer and Data Science Laboratories, NTT Corporation（日本电信电话公司计算机与数据科学实验室）；JST, PRESTO（日本科学技术振兴机构PRESTO项目）；Center for Quantum Computing, RIKEN（理化学研究所量子计算中心）；Center for Quantum Information and Quantum Biology, Osaka University（大阪大学量子信息与量子生物学中心）；Faculty of Information Science and Technology, Hokkaido University（北海道大学信息科学与工程学院）
Quantum computers have recently made great strides and are on a long-term path towards useful fault-tolerant computation. A dominant overhead in fault-tolerant quantum computation is the production of high-fidelity encoded qubits, called magic states, which enable reliable error-corrected computation. We present the first detailed designs of hardware functional units that implement space-time optimized magic-state factories for surface code error-corrected machines. Interactions among distant qubits require surface code braids (physical pathways on chip) which must be routed. Magic-state facto…
It is known from Bell's theorem that quantum predictions for some entangled states cannot be mimicked using local hidden variable (LHV) models. From a computer science perspective, LHV models may be interpreted as classical computers operating on a potentially infinite number of correlated bits originating from a common source. As such, Bell inequality violations achieved through entangled states are able to characterise the quantum advantage of certain tasks, so long as the task itself imposes no restriction on the availability of correlated bits. However, if the number of shared bits is limi…
In quantum cryptography, device-independent (DI) protocols can be certified secure without requiring assumptions about the inner workings of the devices used to perform the protocol. In order to display nonlocality, which is an essential feature in DI protocols, the device must consist of at least two separate components sharing entanglement. This raises a fundamental question: how much entanglement is needed to run such DI protocols? We present a two-device protocol for DI random number generation (DIRNG) which produces approximately $n$ bits of randomness starting from $n$ pairs of arbitrari…
Suppose that two distant parties Alice and Bob share an entangled state $ρ_{AB}$, and they want to exchange the subsystems of $ρ_{AB}$ by local operations and classical communication (LOCC). In general, this LOCC task (i.e. the LOCC transformation of $ρ_{AB} \to Vρ_{AB} V$ with $V$ being a swap operator) is impossible deterministically, but becomes possible probabilistically. In this paper, we study how the optimal probability is related to the amount of entanglement in the framework of positive partial transposed (PPT) operations, and numerically show a remarkable class of states whose probab…
From Bits to Qubits: The Theory and Practice of Quantum Data Encoding
South China Normal University（华南师范大学）；University of Oxford（牛津大学）；Quantum Motion（量子运动）；International Quantum Academy（国际量子学院）；Max Planck Institute of Quantum Optics（马克斯·普朗克量子光学研究所）；Munich Center for Quantum Science and Technology (MCQST)（慕尼黑量子科学与技术中心）；Institute of Computing Technology, Chinese Academy of Sciences（中国科学院计算技术研究所）；Mathematical Institute, University of Oxford（牛津大学数学研究所）；Peking University（北京大学）
Quantum low-density parity-check (LDPC) codes are an important class of quantum error correcting codes. In such codes, each qubit only affects a constant number of syndrome bits, and each syndrome bit only relies on some constant number of qubits. Constructing quantum LDPC codes is challenging. It is an open problem to understand if there exist good quantum LDPC codes, i.e. with constant rate and relative distance. Furthermore, techniques to perform fault-tolerant gates are poorly understood. We present a unified way to address these problems. Our main results are a) a bound on the distance, b…
Superposition of two or more states is one of the fundamental concepts of quantum mechanics and provides the basis for several advantages quantum information processing offers. In this work, we experimentally demonstrate that quantum superposition permits two-way communication between two distant parties that can exchange only one particle once, an impossible task in classical physics. This is achieved by preparing a single photon in a coherent superposition of the two parties' locations. Furthermore, we show that this concept allows the parties to perform secure quantum communication, where t…
Quantum information processing is expressed using quantum bits (qubits) and quantum gates which are arranged in the terms of quantum circuits. Here, each qubit is associated to a quantum circuit wire which is used to conduct the desired operations. Most of the existing quantum circuits allocate a single quantum circuit wire for each qubit and, hence, introduce a significant overhead. In fact, qubits are usually not needed during the entire computation but only between their initialization and measurement. Before and after that, corresponding wires may be used by other qubits. In this work, we …
Active quantum error correction has been identified as a crucial ingredient of future quantum computers, motivating the recent experimental efforts to encode logical quantum bits using small topological codes. In addition to the demonstration of the beneficial role of the encoding, a break-even point in the progress towards large-scale quantum computers will be the implementation of a universal set of gates. This mid-term challenge will soon be faced by various quantum technologies, which urges the need of realistic assessments of their prospects. In this work, we pursue this goal by assessing…
A quantum system interacts with its environment, if ever so slightly, no matter how much care is put into isolating it. As a consequence, quantum bits (qubits) undergo errors, putting dauntingly difficult constraints on the hardware suitable for quantum computation. New strategies are emerging to circumvent this problem by encoding a qubit non-locally across the phase space of a physical system. Since most sources of decoherence are due to local fluctuations, the foundational promise is to exponentially suppress errors by increasing a measure of this non-locality. Prominent examples are topolo…
