A major challenge of today's quantum communication systems lies in the transmission of quantum information with high rates over long distances in the presence of unavoidable losses. Thereby the achievable quantum communication rate is fundamentally limited by the amount of energy that can be transmitted per use of the channel. It is hence vital to develop quantum communication protocols that encode quantum information as energy efficiently as possible. To this aim we investigate continuous-variable quantum teleportation as a method of distributing quantum information. We explore the possibility to encode information on multiple optical modes and derive upper and lower bounds on the achievable quantum channel capacities. This analysis enables us to benchmark single-mode versus multi-mode entanglement resources. Our research reveals that multiplexing does not only feature an enhanced energy efficiency, leading to an exponential increase in the achievable quantum communication rates in comparison to single-mode coding, but also yields an improved loss resilience. However, as reliable quantum information transfer is only achieved for entanglement values above a certain threshold, a careful optimization of the number of coding modes is needed to obtain the optimal quantum channel capacity.
We use photon pairs hyperentangled in polarization and orbital angular momentum to implement a novel entanglement-enhanced quantum state communication technique, known as SuperDense Teleportation, to communicate a specific class of single-photon ququart states between two remote parties, with an average fidelity of 87.0(1)%, almost twice the classical limit of 44%. We compare this technique with quantum teleportation and remote state preparation and show that SuperDense teleportation requires less classical information and fewer experimental resources. We discuss the information content of thi…
A single broadband squeezed field constitutes a quantum communication resource that is sufficient for the realization of a large number N of quantum channels based on distributed Einstein-Podolsky-Rosen (EPR) entangled states. Each channel can serve as a resource for, e.g. independent quantum key distribution or teleportation protocols. N-fold channel multiplexing can be realized by accessing 2N squeezed modes at different Fourier frequencies. We report on the experimental implementation of the N=1 case through the interference of two squeezed states, extracted from a single broadband squeezed…
Multi-photon entangled states of light are key to advancing quantum communication, computation, and metrology. Current methods for building such states are based on stitching together photons from probabilistic sources. The probability of $N$ such sources firing simultaneously decreases exponentially with $N$, imposing severe limitations on the practically achievable number of coincident photons. We tackle this challenge with a quantum interference buffer (QIB), which combines three functionalities: firstly, it stores polarization qubits, enabling the use of polarization-entangled states as re…
Quantum teleportation channels can overcome the effects of photonic loss, a major challenge in the implementation of a quantum network over fiber. Teleportation channels are created by distributing an entangled state between two nodes which is a probabilistic process requiring classical communication. This causes critical delays that can cause information loss as quantum data suffers from decoherence when stored in memory. In this work, we quantify the effect of decoherence on fidelity at a node in a quantum network due to the storage of qubits in noisy memory platforms. We model the memory pl…
Scalable Repeater Architecture for Long-Range Quantum Energy Teleportation in Gapped Systems
University of Chinese Academy of Sciences（中国科学院大学）；Al-Azhar University（爱资哈尔大学）；China Three Gorges University（三峡大学）；Institute for Research in Fundamental Sciences (IPM)（伊朗基础科学研究所）；International Centre for Theoretical Physics Asia-Pacific, UCAS（亚太理论物理中心）
Continuous variable measurement-based quantum computation on cluster states has in recent years shown great potential for scalable, universal, and fault-tolerant quantum computation when combined with the Gottesman-Kitaev-Preskill (GKP) code and quantum error correction. However, no complete fault-tolerant architecture exists that includes everything from cluster state generation with finite squeezing to gate implementations with realistic noise and error correction. In this work, we propose a simple architecture for the preparation of a cluster state in three dimensions in which gates by gate…
Quantum communications capacity using direct transmission over length-$L$ optical fiber scales as $R \sim e^{-αL}$, where $α$ is the fiber's loss coefficient. The rate achieved using a linear chain of quantum repeaters equipped with quantum memories, probabilistic Bell state measurements (BSMs) and switches used for spatial multiplexing, but no quantum error correction, was shown to surpass the direct-transmission capacity. However, this rate still decays exponentially with the end-to-end distance, viz., $R \sim e^{-s{αL}}$, with $s < 1$. We show that the introduction of temporal multiplexing …
Laboratoire de Physique Théorique et Modélisation, CNRS UMR 8089, CY Cergy Paris Université（CY塞吉-巴黎大学理论物理与建模实验室）；Dipartimento di Ingegneria Industriale, Università degli Studi di Salerno（萨莱诺大学工业工程系）；Dahlem Center for Complex Quantum Systems, Freie Universität Berlin（柏林自由大学达勒姆复杂量子系统中心）；TCM Group, Cavendish Laboratory, University of Cambridge（剑桥大学卡文迪许实验室TCM小组）；Institut für Theoretische Physik, Universität zu Köln（科隆大学理论物理研究所）
In a quantum network that successfully creates links, shared Bell states between neighboring repeater nodes, with probability $p$ in each time slot, and performs Bell State Measurements at nodes with success probability $q<1$, the end to end entanglement generation rate drops exponentially with the distance between consumers, despite multi-path routing. If repeaters can perform multi-qubit projective measurements in the GHZ basis that succeed with probability $q$, the rate does not change with distance in a certain $(p,q)$ region, but decays exponentially outside. This region where the distanc…
We address the question of a quantum memory storage of quantum dynamics. In particular, we design an optimal protocol for $N\to 1$ probabilistic storage-and-retrieval of unitary channels on $d$-dimensional quantum systems. If we may access the unknown unitary gate only $N$-times, the optimal success probability of perfect retrieval of its single use is $N/(N-1+d^2)$. The derived size of the memory system exponentially improves the known upper bound on the size of the program register needed for probabilistic programmable quantum processors. Our results are closely related to probabilistic perf…
Quantum computers promise ultrafast performance of certain tasks. Experimentally appealing, measurement-based quantum computation (MBQC) requires an entangled resource called a cluster state, with long computations requiring large cluster states. Previously, the largest cluster state consisted of 8 photonic qubits or light modes, while the largest multipartite entangled state of any sort involved 14 trapped ions. These implementations involve quantum entities separated in space, and in general, each experimental apparatus is used only once. Here, we circumvent this inherent inefficiency by mul…
Quantum communication complexity studies the efficiency of information communication (that is, the minimum amount of communication required to achieve a certain task) using quantum states. One representative example is quantum fingerprinting, in which the simultaneous message passing model is considered and the minimum amount of communication could be exponentially smaller than the classical fingerprinting protocol. Experimental demonstrations based on a practical quantum fingerprinting protocol where coherent states are used to construct the fingerprints, have successfully shown the superiori…
Blind quantum computation allows a user to delegate a computation to an untrusted server while keeping the computation hidden. A number of recent works have sought to establish bounds on the communication requirements necessary to implement blind computation, and a bound based on the no-programming theorem of Nielsen and Chuang has emerged as a natural limiting factor. Here we show that this constraints only hold in limited scenarios and show how to overcome it using a method based on iterated gate-teleportations. We present our results as a family of protocols, with varying degrees of computa…
We review some of our recent results (with collaborators) on information processing in an ordered linear spaces framework for probabilistic theories. These include demonstrations that many "inherently quantum" phenomena are in reality quite general characteristics of non-classical theories, quantum or otherwise. As an example, a set of states in such a theory is broadcastable if, and only if, it is contained in a simplex whose vertices are cloneable, and therefore distinguishable by a single measurement. As another example, information that can be obtained about a system in this framework with…
We study the computational complexity of quantum discord (a measure of quantum correlation beyond entanglement), and prove that computing quantum discord is NP-complete. Therefore, quantum discord is computationally intractable: the running time of any algorithm for computing quantum discord is believed to grow exponentially with the dimension of the Hilbert space so that computing quantum discord in a quantum system of moderate size is not possible in practice. As by-products, some entanglement measures (namely entanglement cost, entanglement of formation, relative entropy of entanglement, sq…
