An official website of the United States government
Abstract We develop a protocol for entanglement generation in the quantum internet that allows a repeater node to usen-qubit Greenberger-Horne-Zeilinger (GHZ) projective measurements that can fusensuccessfully entangledlinks, i.e., two-qubit entangled Bell pairs shared acrossnnetwork edges, incident at that node. Implementingn-fusion, forn ≥ 3, is in principle not much harder than 2-fusions (Bell-basis measurements) in solid-state qubit memories. If we allow even 3-fusions at the nodes, we find—by developing a connection to a modified version of the site-bond percolation problem—that despite lossy (hence probabilistic) link-level entanglement generation, and probabilistic success of the fusion measurements at nodes, one can generate entanglement between end parties Alice and Bob at a rate that stays constant as the distance between them increases. We prove that this powerful network property is not possible to attain with any quantum networking protocol built with Bell measurements and multiplexing alone. We also design a two-party quantum key distribution protocol that converts the entangled states shared between two nodes into a shared secret, at a key generation rate that is independent of the distance between the two parties.
more »
« less
Distance-Independent Entanglement Generation in a Quantum Network using Space-Time Multiplexed Greenberger–Horne–Zeilinger (GHZ) Measurements
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 distance-independent rate occurs is the super-critical region of a new percolation problem. We extend this GHZ protocol to incorporate a time-multiplexing blocklength k, the number of time slots over which a repeater can mix-and-match successful links to perform fusion on. As k increases, the super-critical region expands. For a given (p,q), the entanglement rate initially increases with k, and once inside the super-critical region for a high enough k, it decays as 1/k GHZ states per time slot. When memory coherence time exponentially distributed with mean μ is incorporated, it is seen that increasing k does not indefinitely increase the super-critical region; it has a hard μ-dependent limit. Finally, we find that incorporating space-division multiplexing, i.e., running the above protocol independently in up to d disconnected network regions, where d is the network’s node degree, one can go beyond the 1 GHZ state per time slot rate that the above randomized local-link-state protocol cannot surpass. As (p,q) increases, one can approach the ultimate min-cut entanglement-generation capacity of d GHZ states per slot.
more »
« less
- Award ID(s):
- 1955744
- PAR ID:
- 10343103
- Date Published:
- Journal Name:
- 2021 IEEE International Conference on Quantum Computing and Engineering (QCE)
- Page Range / eLocation ID:
- 334 to 345
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Long-distance quantum communication will require the use of quantum repeaters to overcome the exponential attenuation of signal with distance. One class of such repeaters utilizes quantum error correction to overcome losses in the communication channel. Here we propose a strategy of using the bosonic Gottesman-Kitaev-Preskill (GKP) code in a two-way repeater architecture with multiplexing. The crucial feature of the GKP code that we make use of is the fact that GKP qubits easily admit deterministic two-qubit gates, hence allowing for multiplexing without the need for generating large cluster states as required in previous all-photonic architectures based on discrete-variable codes. Moreover, alleviating the need for such clique clusters entails that we are no longer limited to extraction of at most one end-to-end entangled pair from a single protocol run. In fact, thanks to the availability of the analog information generated during the measurements of the GKP qubits, we can design better entanglement swapping procedures in which we connect links based on their estimated quality. This enables us to use all the multiplexed links so that large number of links from a single protocol run can contribute to the generation of the end-to-end entanglement. We find that our architecture allows for high-rate end-to-end entanglement generation and is resilient to imperfections arising from finite squeezing in the GKP state preparation and homodyne detection inefficiency. In particular we show that long-distance quantum communication over more than 1000 km is possible even with less than 13 dB of GKP squeezing. We also quantify the number of GKP qubits needed for the implementation of our scheme and find that for good hardware parameters our scheme requires around 10^3 - 10^4 GKP qubits per repeater per protocol run.more » « less
-
Abstract The past decade has seen tremendous progress in experimentally realizing the building blocks of quantum repeaters. Repeater architectures with multiplexed quantum memories have been proposed to increase entanglement distribution rates, but an open challenge is to maintain entanglement fidelity over long-distance links. Here, we address this with a quantum router architecture comprising many quantum memories connected in a photonic switchboard to broker entanglement flows across quantum networks. We compute the rate and fidelity of entanglement distribution under this architecture using an event-based simulator, finding that the router improves the entanglement fidelity as multiplexing depth increases without a significant drop in the entanglement distribution rate. Specifically, the router permits channel-loss-invariant fidelity, i.e. the same fidelity achievable with lossless links. Furthermore, this scheme automatically prioritizes entanglement flows across the full network without requiring global network information. The proposed architecture uses present-day photonic technology, opening a path to near-term deployable multi-node quantum networks.more » « less
-
Hemmer, Philip R.; Migdall, Alan L. (Ed.)We study a quantum switch that creates shared end-to-end entangled quantum states to multiple sets of users that are connected to it. Each user is connected to the switch via an optical link across which bipartite Bell-state entangled states are generated in each time-slot with certain probabilities, and the switch merges entanglements of links to create end-to-end entanglements for users. One qubit of an entanglement of a link is stored at the switch and the other qubit of the entanglement is stored at the user corresponding to the link. Assuming that qubits of entanglements of links decipher after one time-slot, we characterize the capacity region, which is defined as the set of arrival rates of requests for end-to-end entanglements for which there exists a scheduling policy that stabilizes the switch. We propose a Max-Weight scheduling policy and show that it stabilizes the switch for all arrival rates that lie in the capacity region. We also provide numerical results to support our analysis.more » « less
-
We study a quantum entanglement distribution switch serving a set of users in a star topology with equal-length links. The quantum switch, much like a quantum repeater, can perform entanglement swapping to extend entanglement across longer distances. Additionally, the switch is equipped with entanglement switching logic, enabling it to implement switching policies to better serve the needs of the network. In this work, the function of the switch is to create bipartite or tripartite entangled states among users at the highest possible rates at a fixed ratio. Using Markov chains, we model a set of randomized switching policies. Discovering that some are better than others, we present analytical results for the case where the switch stores one qubit per user, and find that the best policies outperform a time division multiplexing policy for sharing the switch between bipartite and tripartite state generation. This performance improvement decreases as the number of users grows. The model is easily augmented to study the capacity region in the presence of quantum state decoherence and associated cut-off times for qubit storage, obtaining similar results. Moreover, decoherence-associated quantum storage cut-off times appear to have little effect on capacity in our identical-link system. We also study a smaller class of policies when the switch stores two qubits per user.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Conference Paper:
- https://doi.org/10.1109/QCE52317.2021.00050
