Search

We introduce an alternative approach for the design of quantum repeaters based on generating entangled states of growing size. The scheme utilizes quantum merging operations, also known as fusion type-I operations, that allow the reintegration and reuse of entanglement. Unlike conventional swapping-based protocols, our method preserves entanglement after failed operations, thereby reducing waiting times, enabling higher rates, and introducing enhanced flexibility in the communication requests. Through proof-of-principle analysis, we demonstrate the advantages of this approach over standard repeater protocols, highlighting its potential for practical quantum communication scenarios., Comment: 10 pages, 7 figures

Entanglement-based quantum networks exhibit a unique flexibility in the choice of entangled resource states that are then locally manipulated by the nodes to fulfill any request in the network. Furthermore, this manipulation is not uniquely defined and thus can be optimized. We tailor the adaptation of the resource state or pre-established entanglement to achieve bipartite communication in an imperfect setting that includes time-dependent memory errors. In this same setting, we study how the flexibility of this approach can be used for the distribution of entanglement in a fully asymmetric network scenario. The considered entanglement topology is a custom one based on the minimization of the required measurements to retrieve a Bell pair. The optimization of the manipulation and the study of such a custom entanglement topology are performed using the noisy stabilizer formalism, a recently introduced method to fully track noise on graph states. We find that exploiting the flexibility of the entanglement topology, given a certain set of bipartite requests, is highly favorable in terms of the fidelity of the final state., Comment: 22 pages, 12 figures

Quantum repeaters have long been established to be essential for distributing entanglement over long distances. Consequently, their experimental realization constitutes a core challenge of quantum communication. However, there are numerous open questions about implementation details for realistic, near-term experimental setups. In order to assess the performance of realistic repeater protocols, we here present ReQuSim, a comprehensive Monte-Carlo based simulation platform for quantum repeaters that faithfully includes loss and models a wide range of imperfections such as memories with time-dependent noise. Our platform allows us to perform an analysis for quantum repeater setups and strategies that go far beyond known analytic results: This refers to being able to both capture more realistic noise models and analyse more complex repeater strategies. We present a number of findings centered around the combination of strategies for improving performance, such as entanglement purification and the use of multiple repeater stations, and demonstrate that there exist complex relationships between them. We stress that numerical tools such as ours are essential to model complex quantum communication protocols aimed at contributing to the quantum internet., Comment: 13+4 pages, 10+4 figures, 0+2 tables; v2: updated presentation; v3: accepted version plus tiny changes, adds one more scenario and runtime information

It has recently been theoretically shown that Quantum Memories (QM) could enable truly global quantum networking when deployed in space thereby surpassing the limited range of land-based quantum repeaters. Furthermore, QM in space could enable novel protocols and long-range entanglement and teleportation applications suitable for Deep-Space links and extended scenarios for fundamental physics tests. In this white paper we will make the case for the importance of deploying QMs to space, and also discuss the major technical milestones and development stages that will need to be considered., Comment: Toptical white paper submitted to National Academies of Sciences, Engineering and Medicine's Decadal Survey on Biological and Physical Sciences Research in Space 2023-2032

A global quantum repeater network involving satellite-based links is likely to have advantages over fiber-based networks in terms of long-distance communication, since the photon losses in free space scale only polynomially with the distance -- compared to the exponential losses in optical fibers. To simulate the performance of such networks, we have introduced a scheme of large-scale event-based Monte Carlo simulation of quantum repeaters with multiple memories that can faithfully represent loss and imperfections in these memories. In this work, we identify the quantum key distribution rates achievable in various satellite and ground station geometries for feasible experimental parameters. The power and flexibility of the simulation toolbox allows us to explore various strategies and parameters, some of which only arise in these more complex, multi-satellite repeater scenarios. As a primary result, we conclude that key rates in the kHz range are reasonably attainable for intercontinental quantum communication with three satellites, only one of which carries a quantum memory., Comment: 10+7 pages, 6+6 figures, 2+1 tables; v2: replaced with accepted version plus tiny changes. extended model and additional analysis along satellite orbit

Machine learning can help us in solving problems in the context big data analysis and classification, as well as in playing complex games such as Go. But can it also be used to find novel protocols and algorithms for applications such as large-scale quantum communication? Here we show that machine learning can be used to identify central quantum protocols, including teleportation, entanglement purification and the quantum repeater. These schemes are of importance in long-distance quantum communication, and their discovery has shaped the field of quantum information processing. However, the usefulness of learning agents goes beyond the mere re-production of known protocols; the same approach allows one to find improved solutions to long-distance communication problems, in particular when dealing with asymmetric situations where channel noise and segment distance are non-uniform. Our findings are based on the use of projective simulation, a model of a learning agent that combines reinforcement learning and decision making in a physically motivated framework. The learning agent is provided with a universal gate set, and the desired task is specified via a reward scheme. From a technical perspective, the learning agent has to deal with stochastic environments and reactions. We utilize an idea reminiscent of hierarchical skill acquisition, where solutions to sub-problems are learned and re-used in the overall scheme. This is of particular importance in the development of long-distance communication schemes, and opens the way for using machine learning in the design and implementation of quantum networks., Comment: 13+7 pages, 6+3 figures, 1+3 tables; v2: significantly extended scope and updated figures

We introduce a repeater scheme to efficiently distribute multipartite entangled states in a quantum network with optimal scaling. The scheme allows to generate graph states such as 2D and 3D cluster states of growing size or GHZ states over arbitrary distances, with a constant overhead per node/channel that is independent of the distance. The approach is genuine multipartite, and is based on the measurement-based implementation of multipartite hashing, an entanglement purification protocol that operates on a large ensemble together with local merging/connection of elementary building blocks. We analyze the performance of the scheme in a setting where local or global storage is limited, and compare it to bipartite and hybrid approaches that are based on the distribution of entangled pairs. We find that the multipartite approach offers a storage advantage, which results in higher efficiency and better performance in certain parameter regimes. We generalize our approach to arbitrary network topologies and different target graph states., Comment: 16 pages, 16 figures

We consider the explicit construction of resource states for measurement-based quantum information processing. We concentrate on special-purpose resource states that are capable to perform a certain operation or task, where we consider unitary Clifford circuits as well as non-trace preserving completely positive maps, more specifically probabilistic operations including Clifford operations and Pauli measurements. We concentrate on $1 \to m$ and $m \to 1$ operations, i.e. operations that map one input qubit to $m$ output qubits or vice versa. Examples of such operations include encoding and decoding in quantum error correction, entanglement purification or entanglement swapping. We provide a general framework to construct optimal resource states for complex tasks that are combinations of these elementary building blocks. All resource states only contain input and output qubits, and are hence of minimal size. We obtain a stabilizer description of the resulting resource states, which we also translate into a circuit pattern to experimentally generate these states. In particular, we derive recurrence relations at the level of stabilizers as key analytical tool to generate explicit (graph-) descriptions of families of resource states. This allows us to explicitly construct resource states for encoding, decoding and syndrome readout for concatenated quantum error correction codes, code switchers, multiple rounds of entanglement purification, quantum repeaters and combinations thereof (such as resource states for entanglement purification of encoded states)., Comment: 16+6 pages, 15+3 figures; V2: replaced with published version, improved presentation

We investigate measurement-based quantum communication with noisy resource states that are generated by entanglement purification. We consider the transmission of encoded information via noisy quantum channels using a measurement-based implementation of encoding, error correction and decoding. We show that such an approach offers advantages over direct transmission, gate-based error correction and measurement-based schemes with direct generation of resource states. We analyze the noise structure of resource states generated by entanglement purification and show that a local error model, i.e. noise acting independently on all qubits of the resource state, is a good approximation in general, and provides an exact description for $GHZ$-states. The latter are resources for a measurement-based implementation of error correction codes for bit-flip or phase flip errors. This provides a first link between the recently found very high thresholds for fault-tolerant measurement-based quantum information processing based on local error models for resource states, to error thresholds for gate based computational models., Comment: 13 pages + 4 pages appendix, 19+3 figures, 0+1 tables; V2: improved and extended presentation