Search

Continuous-variable (CV) codes and their application in quantum communication have attracted increasing attention. In particular, one typical CV codes, cat-codes, has already been experimentally created using trapped atoms in cavities with relatively high fidelities. However, when these codes are used in a repeater protocol, the secret key rate (SKR) that can be extracted between two remote users is extremely low. Here we propose a quantum repeater protocol based on cat codes with a few quantum memories or graph states as additional resources. This allows us to considerably increase the secret key rate by several orders of magnitude. Our findings provide valuable insights for designing efficient quantum repeater systems, advancing the feasibility and performance of quantum communication over long distances., Comment: 14 pages, 8 figures

Quantum networks (QNs) promise to enhance the performance of various quantum technologies in the near future by distributing entangled states over long distances. The first step towards this is to develop novel entanglement measures that are both informative and computationally tractable at large scales. While numerous such entanglement measures exist for discrete-variable (DV) systems, a comprehensive exploration for experimentally preferred continuous-variable (CV) systems is lacking. Here, we introduce a class of CV entanglement measures, among which we identify a non-convex entanglement monotone -- the ratio negativity, which possesses a simple, scalable form for characterizing the optimal entanglement swapping of pure Gaussian states. This characterization opens avenues for leveraging statistical physics tools to analyze swapping-protocol-based CV QNs.

Connecting multiple processors via quantum interconnect technologies could help to overcome issues of scalability in single-processor quantum computers. Transmission via these interconnects can be performed more efficiently using quantum multiplexing, where information is encoded in high-dimensional photonic degrees of freedom. We explore the effects of multiplexing on logical error rates in surface codes and hypergraph product codes. We show that, although multiplexing makes loss errors more damaging, assigning qubits to photons in an intelligent manner can minimize these effects, and the ability to encode higher-distance codes in a smaller number of photons can result in overall lower logical error rates. This multiplexing technique can also be adapted to quantum communication and multimode quantum memory with high-dimensional qudit systems., Comment: 12 pages + 12-page appendices, 19 figures

Advanced quantum networking systems rely on efficient quantum error correction codes for their optimal realization. The rate at which the encoded information is transmitted is a fundamental limit that affects the performance of such systems. Quantum aggregation allows one to increase the transmission rate by adding multiple paths connecting two distant users. Aggregating channels of different paths allows more users to simultaneously exchange the encoded information. Recent work has shown that quantum aggregation can also reduce the number of physical resources of an error correction code when it is combined with the quantum multiplexing technique. However, the different channel lengths across the various paths means some of the encoded quantum information will arrive earlier than others and it must be stored in quantum memories. The information stored will then deteriorate due to decoherence processes leading to detrimental effects for the fidelity of the final quantum state. Here, we explore the effects of a depolarization channel that occurs for the quantum Reed-Solomon code when quantum aggregation involving different channel lengths is used. We determine the best distribution of resources among the various channels connecting two remote users. Further we estimate the coherence time required to achieve a certain fidelity. Our results will have a significant impact on the ways physical resources are distributed across a quantum network.

Building large-scale quantum communication networks has its unique challenges. Here, we demonstrate that a network-wide synergistic usage of quantum memories distributed in a quantum communication network offers a fundamental advantage. We first map the problem of quantum communication with local usage of memories into a classical continuum percolation model. Then, we show that this mapping can be improved through a cooperation of entanglement distillation and relay protocols via remote access to distributed memories. This improved mapping, which we term $\alpha$-percolation, can be formulated in terms of graph-merging rules, analogous to the decimation rules of the renormalization group treatment of disordered quantum magnets. These rules can be performed in any order, yielding the same optimal result, which is characterized by the emergence of a ``positive feedback'' mechanism and the formation of spatially disconnected ``hopping'' communication components -- both marking significant improvements in quantum network connectivity., Comment: 6 pages, 3 figures

Quantum error correction codes based on continuous variables play an important role for the implementation of quantum communication systems. A natural application of such codes occurs within quantum repeater systems which are used to combat severe channel losses and local gate errors. In particular, channel loss drastically reduces the distance of communication between remote users. Here we consider a cavity-QED based repeater scheme to address the losses in the quantum channel. This repeater scheme relies on the transmission of a specific class of rotationally invariant error-correcting codes. We compare several rotation-symmetric bosonic codes (RSBCs) being used to encode the initial states of two remote users connected by a quantum repeater network against the convention of the cat codes and we quantify the performance of the system using the secret key rate. In particular, we determine the number of stations required to exchange a secret key over a fixed distance and establish the resource overhead., Comment: 10 pages, 7 figures

Quantum communication technologies will play an important role in quantum information processing in the near future as we network devices together. However, their implementation is still a challenging task due to both loss and gate errors. Quantum error correction codes are one important technique to address this issue. In particular, the Quantum Reed-Solomon codes are known to be quite efficient for quantum communication tasks. The high degree of physical resources required, however, makes such a code difficult to use in practice. A recent technique called quantum multiplexing has been shown to reduce resources by using multiple degrees of freedom of a photon. In this work, we propose a method to decompose multi-controlled gates using fewer $\rm{CX}$ gates via this quantum multiplexing technique. We show that our method can significantly reduce the required number of $\rm{CX}$ gates needed in the encoding circuits for the quantum Reed-Solomon code. Our approach is also applicable to many other quantum error correction codes and quantum algorithms, including Grovers and quantum walks., Comment: 9 pages, 11 figures

Quantum networking allows the transmission of information in ways unavailable in the classical world. Single packets of information can now be split and transmitted in a coherent way over different routes. This aggregation allows information to be transmitted in a fault tolerant way between different parts of the quantum network (or the future internet) - even when that is not achievable with a single path approach. It is a quantum phenomenon not available in conventional telecommunication networks either. We show how the multiplexing of independent quantum channels allows a distributed form of quantum error correction to protect the transmission of quantum information between nodes or users of a quantum network. Combined with spatial-temporal single photon multiplexing we observe a significant drop in network resources required to transmit that quantum signal - even when only two channels are involved. This work goes far beyond the concepts of channel capacities and shows how quantum networking may operate in the future. Further it shows that quantum networks are likely to operate differently from their classical counterparts which is an important distinction as we design larger scale ones., Comment: 9 pages, 6 figures

Distributed quantum information processing is based on the transmission of quantum data over lossy channels between quantum processing nodes. These nodes may be separated by a few microns or on planetary scale distances, but transmission losses due to absorption/scattering in the channel are the major source of error for most distributed quantum information tasks. Of course quantum error detection (QED) /correction (QEC) techniques can be used to mitigate such effects but error detection approaches have severe performance limitations due to the signaling constraints between nodes and so error correction approaches are preferable -assuming one has sufficient high quality local operations. Typically, performance comparisons between loss-mitigating codes assume one encoded qubit per photon. However single photons can carry more than one qubit of information and so our focus in this work is to explore whether loss-based QEC codes utilizing quantum multiplexed photons are viable and advantageous, especially as photon loss results in more than one qubit of information being lost. We show that quantum multiplexing enables significant resource reduction: in terms of the number of single photon sources while at the same time maintaining (or even lowering) the number of two-qubit gates required. Further, our multiplexing approach requires only conventional optical gates already necessary for the implementation of these codes., Comment: 5 pages, 2 figures

Distributing entangled pairs is a fundamental operation required for many quantum information science and technology tasks. In a general entanglement distribution scheme, a photonic pulse is used to entangle a pair of remote quantum memories. Most applications require multiple entangled pairs between remote users, which in turn necessitates several photonic pulses (single photons) being sent through the channel connecting those users. Here we present an entanglement distribution scheme using only a single photonic pulse to entangle an arbitrary number of remote quantum memories. As a consequence the spatial temporal resources are dramatically reduced. We show how this approach can be simultaneously combined with an entanglement purification protocol to generate even higher fidelity entangled pairs. The combined approach is faster to generate those high quality pairs and requires less resources in terms of both matter qubits and photons consumed. To estimate the efficiency of our scheme we derive a normalized rate taking into account the raw rate at which the users can generate purified entangled pairs divided by the total resources used. We compare the efficiency of our system with the Deutsch protocol in which the entangled pairs have been created in a traditional way. Our scheme outperforms this approach both in terms of generation rate and resources required. Finally we show how our approach can be extended to more general error correction and detection schemes with higher normalized generation rates naturally occurring., Comment: 11 pages, 7 figures

Memory-assisted measurement-device-independent quantum key distribution (MA-MDI-QKD) is a promising scheme that aims to improve the rate-versus-distance behavior of a QKD system by using the state-of-the-art devices. It can be seen as a bridge between current QKD links to quantum repeater based networks. While, similar to quantum repeaters, MA-MDI-QKD relies on quantum memory (QM) units, the requirements for such QMs are less demanding than that of probabilistic quantum repeaters. Here, we present a variant of MA-MDI-QKD structure that relies on only a single physical QM: a nitrogen-vacancy center embedded into a cavity where its electronic spin interacts with photons and its nuclear spin is used for storage. This enables us to propose a simple but efficient MA-MDI-QKD scheme resilient to memory errors and capable of beating, in terms of rate and reach, existing QKD demonstrations. We also show how we can extend this setup to a quantum repeater system, reaching, thus, larger distances., Comment: 9 pages, 6 figures

Memory-assisted quantum key distribution (MA-QKD) has recently been proposed as a technique to improve the rate-versus-distance behavior of QKD systems by using existing, or nearly-achievable, quantum technologies. The promise is that MA-QKD would require less demanding quantum memories than the ones needed for probabilistic quantum repeaters. Nevertheless, early investigations suggest that, in order to beat the conventional no-memory QKD schemes, the quantum memories used in the MA-QKD protocols must have high bandwidth-storage products and short interaction times. Among different types of quantum memories, ensemble-based memories offer some of the required specifications, but they typically suffer from multiple excitation effects. To avoid the latter issue, in this paper, we propose two new variants of MA-QKD both relying on single-photon sources (SPSs) for entangling purposes. One is based on known techniques for entanglement distribution in quantum repeaters. This scheme turns out to offer no advantage even if one uses ideal SPSs. By finding the root cause of the problem, we then propose another setup, which can outperform single no-QM setups even if we allow for some imperfections in our SPSs. For such a scheme, we compare the key rate for different types of ensemble-based memories and show that certain classes of atomic ensembles can improve the rate-versus-distance behavior., Comment: 33 pages, 11 figures

Memory-assisted measurement-device-independent quantum key distribution (MA-MDI-QKD) has recently been proposed as a possible intermediate step towards the realization of quantum repeaters. Despite its relaxing some of the requirements on quantum memories, the choice of memory in relation to the layout of the setup and the protocol has a stark effect on our ability to beat existing no-memory systems. Here, we investigate the suitability of nitrogen vacancy (NV) centers, as quantum memories, in MA-MDI-QKD. We particularly show that moderate cavity enhancement is required for NV centers if we want to outperform no-memory QKD systems. Using system parameters mostly achievable by today's state of the art, we then anticipate some total key rate advantage in the distance range between 300 km and 500 km for cavity-enhanced NV centers. Our analysis accounts for major sources of error including the dark current, the channel loss, and the decoherence of the quantum memories.

The feasibility of trust-free long-haul quantum key distribution (QKD) networks is addressed. We combine measurement-device-independent QKD (MDI-QKD), as an access technology, with a quantum repeater setup, at the core of future quantum communication networks. This will provide a quantum link none of whose intermediary nodes need to be trusted, or, in our terminology, a trust-free QKD link. As the main figure of merit, we calculate the secret key generation rate when a particular probabilistic quantum repeater protocol is in use. We assume the users are equipped with imperfect single photon sources, which can possibly emit two single photons, or laser sources to implement decoy-state techniques. We consider apparatus imperfection, such as quantum efficiency and dark count of photodetectors, path loss of the channel, and writing and reading efficiencies of quantum memories. By optimizing different system parameters, we estimate the maximum distance over which users can share secret keys when a finite number of memories are employed in the repeater setup.

Quantum memories are enabling devices for extending the reach of quantum key distribution (QKD) systems. The required specifications for memories are, however, often considered too demanding for available technologies. One can change this mindset by introducing memory-assisted measurement-device-independent QKD (MDI-QKD), which imposes less stringent conditions on the memory modules. It has been shown that, in the case of {\em fast} single-qubit memories, we can reach rates and distances not attainable by single no-memory QKD links. Single-qubit memories, such as single atoms or ions, have, currently, too slow of an access time to offer an advantage in practice. Here, we relax that assumption, and consider ensemble-based memories, which satisfy the main two requirements of having short access times and large storage-bandwidth products. Our results, however, suggest that the multiple-excitation effects in such memories can be so detrimental that they may wash away the scaling improvement offered by memory-equipped systems. We then propose an alternative setup that can in principle remedy the above problem. As a prelude to our main problem, we also obtain secret key generation rates for MDI-QKD systems that rely on imperfect single-photon sources with nonzero probabilities of emitting two photons.

Quantum key distribution over probabilistic quantum repeaters is addressed. We compare, under practical assumptions, two such schemes in terms of their secure key generation rates per quantum memory. The two schemes under investigation are the one proposed by Duan et al. in [Nat. 414, 413 (2001)] and that of Sangouard et al. in [Phys. Rev. A 76, 050301 (2007)]. We consider various sources of imperfection in both protocols, such as nonzero double-photon probabilities at the sources, dark counts in detectors, and inefficiencies in the channel, photodetectors and memories. We also consider memory decay and dephasing processes in our analysis. For the latter system, we determine the maximum value of the double-photon probability beyond which secretkey distillation is not possible. We also find the crossover distance beyond which the repeater schemes outperform the non-repeater ones. We finally compare the two protocols in terms of their achievable secret key generation rates at their optimal settings, Comment: 28 pages, 12 figures