Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2209.11430 · Quantum

Performance analysis of quantum repeaters enabled by deterministically generated photonic graph states

Yuan Zhan, Paul Hilaire, Edwin Barnes, Sophia E. Economou, Shuo Sun

Published Feb 16, 2023• 25 citations
arXivHTMLPDF

Abstract

By encoding logical qubits into specific types of photonic graph states, one can realize quantum repeaters that enable fast entanglement distribution rates approaching classical communication. However, the generation of these photonic graph states requires a formidable resource overhead using traditional approaches based on linear optics. Overcoming this challenge, a number of new schemes have been proposed that employ quantum emitters to deterministically generate photonic graph states. Although these schemes have the potential to significantly reduce the resource cost, a systematic comparison of the repeater performance among different encodings and different generation schemes is lacking. Here, we quantitatively analyze the performance of quantum repeaters based on two different graph states, i.e. the tree graph states and the repeater graph states. For both states, we compare the performance between two generation schemes, one based on a single quantum emitter coupled to ancillary matter qubits, and one based on a single quantum emitter coupled to a delayed feedback. We identify the numerically optimal scheme at different system parameters. Our analysis provides a clear guideline on the selection of the generation scheme for graph-state-based quantum repeaters, and lays out the parameter requirements for future experimental realizations of different schemes.

DOI
10.22331/q-2023-02-16-924

Related papers

Logical Photon Encoding Schemes for All-photonic Quantum Repeaters and Networks

Ching-Lin Chan, Charu Jain, Ezra Kissel +4 more

The paper conducts a comparative study of logical photon encoding schemes for all-photonic entanglement-based quantum repeaters and networks. We aim to quantitatively understand the relative performance and resource requirements of different encoding schemes in all-photonic quantum networks, employing quantum emitters to deterministically generate the required photonic graph states. The performance metrics include entanglement generation rate and resource requirement between the endpoints of the network.

•Aug 17, 2026•0 citations

An Improved Design for All-Photonic Quantum Repeaters

Ashlesha Patil, Saikat Guha

All-photonic quantum repeaters use multi-qubit photonic graph states, called repeater graph states (RGS), instead of matter-based quantum memories, for protection against predominantly loss errors. The RGS comprises tree-graph-encoded logical qubits for error correction at the repeaters and physical {\em link} qubits to create entanglement between neighboring repeaters. The two methods to generate the RGS are probabilistic stitching -- using linear optical Bell state measurements (fusion) -- of small entangled states prepared via multiplexed-probabilistic linear optical circuits fed with single photons, and a direct deterministic preparation using a small number of quantum-logic-capable solid-state emitters. The resource overhead due to fusions and the circuit depth of the quantum emitter system both increase with the size of the RGS. Therefore engineering a resource-efficient RGS is crucial. We propose a new RGS design, which achieves a higher entanglement rate for all-photonic quantum repeaters using fewer qubits than the previously known RGS would. We accomplish this by boosting the probability of entangling neighboring repeaters with tree-encoded link qubits. We also propose a new adaptive scheme to perform logical BSM on the link qubits for loss-only errors. The adaptive BSM outperforms the previous schemes for logical BSM on tree codes when the qubit loss probability is uniform. It reduces the number of optical modes required to perform logical BSM on link qubits to improve the entanglement rate further.

arXiv:2405.11768•May 20, 2024•0 citations

Resource requirements for efficient quantum communication using all-photonic graph states generated from a few matter qubits

Paul Hilaire, Edwin Barnes, Sophia E. Economou

Quantum communication technologies show great promise for applications ranging from the secure transmission of secret messages to distributed quantum computing. Due to fiber losses, long-distance quantum communication requires the use of quantum repeaters, for which there exist quantum memory-based schemes and all-photonic schemes. While all-photonic approaches based on graph states generated from linear optics avoid coherence time issues associated with memories, they outperform repeater-less protocols only at the expense of a prohibitively large overhead in resources. Here, we consider using matter qubits to produce the photonic graph states and analyze in detail the trade-off between resources and performance, as characterized by the achievable secret key rate per matter qubit. We show that fast two-qubit entangling gates between matter qubits and high photon collection and detection efficiencies are the main ingredients needed for the all-photonic protocol to outperform both repeater-less and memory-based schemes.

arXiv:2005.07198•Quantum•Feb 15, 2021•57 citations

Optimized protocol to create repeater graph states for all-photonic quantum repeater

Ming Lai Chan

All-photonic quantum repeater is not yet commercially applicable due to difficulty in the generation of repeater graph states (RGS) and the probabilistic nature of Bell-state measurement. In recent years, several deterministic protocols have been proposed to generate RGS. However, they can only create bare RGS and a rate-distance analysis for the deterministic approach is currently missing. We present a deterministic generation scheme of encoded RGS and show that after optimization, the repeater using our scheme performs at least 4.9 times better than the traditional probabilistic generation scheme in terms of secret key rate, with a significant reduction in the total number photons by 2 orders of magnitude. The duration of our generation protocol is only half of the existing deterministic schemes. We also describe in detail an experimental method using cavity QED-enhanced resonance fluorescence and time-bin encoding to implement our protocol.

arXiv:1811.10214•Nov 26, 2018•2 citations

Architecture and Protocols for All-Photonic Quantum Repeaters

Naphan Benchasattabuse, Michal Hajdušek, Rodney Van Meter

The all-photonic quantum repeater scheme, utilizing a type of graph state called the repeater graph state (RGS), promises resilience to photon losses and operational errors, offering a fast Bell pair generation rate limited only by the RGS creation time (rather than enforced round-trip waits). While existing research has predominantly focused on RGS generation and secret key sharing rate analysis, there is a need to extend investigations to encompass broader applications, such as distributed computation and teleportation, the main tasks envisioned for the Quantum Internet. Here we propose a new emitter-photonic qubit building block and an RGS protocol that addresses several key considerations: end node involvement in connection establishment, decoding of logical qubits within the RGS, and computing the Pauli frame corrections at each participating node to ensure the desired correct end-to-end Bell pair state. Our proposed building block significantly reduces the total number of emissive quantum memories required for end nodes and seamlessly integrates all-photonic and memory-based repeaters under the same communication protocol. We also present an algorithm for decoding logical measurement results, employing graphical reasoning based on graph state manipulation rules.

arXiv:2306.03748•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•12 citations

Protocols for All-Photonic Quantum Repeaters

Naphan Benchasattabuse, Michal Hajdušek, Rodney Van Meter

All-photonic repeater scheme based on a repeater graph state (RGS) promises tolerance to photon losses as well as operational errors. An attractive promise of this scheme is that it offers a fast Bell pair generation rate, limited only by the RGS creation time. This is in stark contrast to the traditional quantum repeater with quantum memories, where the Bell pair generation time is limited by the round-trip wait time leading to poor Bell pair generation performance and quality due to the decoherence of quantum memories. Prior research has focused on lowering the cost of RGS generation and improving upon the probabilistic generation to a deterministic generation with required photon counts to be the same as the number of qubits in the RGS. The operations of creating and manipulating the RGS into an end-to-end Bell pair are complex and have not been fully figured out in detail. Here, we focus on improving the practicality of the RGS scheme in real-world implementation and address three open questions of the RGS scheme, namely; how do end nodes participate in the connection, what classical information needs to be exchanged and processed between nodes, and how to make RGS scheme work hand in hand with the traditional quantum repeaters with memories.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 17, 2023•6 citations
By encoding logical qubits into specific types of photonic graph states, one can realize quantum repeaters that enable fast entanglement distribution rates approaching classical communication. However, the generation of these photonic graph states requires a formidable resource overhead using traditional approaches based on linear optics. Overcoming this challenge, a number of new schemes have been proposed that employ quantum emitters to deterministically generate photonic graph states. Although these schemes have the potential to significantly reduce the resource cost, a systematic comparison of the repeater performance among different encodings and different generation schemes is lacking. Here, we quantitatively analyze the performance of quantum repeaters based on two different graph states, i.e. the tree graph states and the repeater graph states. For both states, we compare the performance between two generation schemes, one based on a single quantum emitter coupled to ancillary matter qubits, and one based on a single quantum emitter coupled to a delayed feedback. We identify the numerically optimal scheme at different system parameters. Our analysis provides a clear guideline on the selection of the generation scheme for graph-state-based quantum repeaters, and lays out the parameter requirements for future experimental realizations of different schemes.
The paper conducts a comparative study of logical photon encoding schemes for all-photonic entanglement-based quantum repeaters and networks. We aim to quantitatively understand the relative performance and resource requirements of different encoding schemes in all-photonic quantum networks, employing quantum emitters to deterministically generate the required photonic graph states. The performance metrics include entanglement generation rate and resource requirement between the endpoints of the network.
All-photonic quantum repeaters use multi-qubit photonic graph states, called repeater graph states (RGS), instead of matter-based quantum memories, for protection against predominantly loss errors. The RGS comprises tree-graph-encoded logical qubits for error correction at the repeaters and physical {\em link} qubits to create entanglement between neighboring repeaters. The two methods to generate the RGS are probabilistic stitching -- using linear optical Bell state measurements (fusion) -- of small entangled states prepared via multiplexed-probabilistic linear optical circuits fed with single photons, and a direct deterministic preparation using a small number of quantum-logic-capable solid-state emitters. The resource overhead due to fusions and the circuit depth of the quantum emitter system both increase with the size of the RGS. Therefore engineering a resource-efficient RGS is crucial. We propose a new RGS design, which achieves a higher entanglement rate for all-photonic quantum repeaters using fewer qubits than the previously known RGS would. We accomplish this by boosting the probability of entangling neighboring repeaters with tree-encoded link qubits. We also propose a new adaptive scheme to perform logical BSM on the link qubits for loss-only errors. The adaptive BSM outperforms the previous schemes for logical BSM on tree codes when the qubit loss probability is uniform. It reduces the number of optical modes required to perform logical BSM on link qubits to improve the entanglement rate further.
Quantum communication technologies show great promise for applications ranging from the secure transmission of secret messages to distributed quantum computing. Due to fiber losses, long-distance quantum communication requires the use of quantum repeaters, for which there exist quantum memory-based schemes and all-photonic schemes. While all-photonic approaches based on graph states generated from linear optics avoid coherence time issues associated with memories, they outperform repeater-less protocols only at the expense of a prohibitively large overhead in resources. Here, we consider using matter qubits to produce the photonic graph states and analyze in detail the trade-off between resources and performance, as characterized by the achievable secret key rate per matter qubit. We show that fast two-qubit entangling gates between matter qubits and high photon collection and detection efficiencies are the main ingredients needed for the all-photonic protocol to outperform both repeater-less and memory-based schemes.
All-photonic quantum repeater is not yet commercially applicable due to difficulty in the generation of repeater graph states (RGS) and the probabilistic nature of Bell-state measurement. In recent years, several deterministic protocols have been proposed to generate RGS. However, they can only create bare RGS and a rate-distance analysis for the deterministic approach is currently missing. We present a deterministic generation scheme of encoded RGS and show that after optimization, the repeater using our scheme performs at least 4.9 times better than the traditional probabilistic generation scheme in terms of secret key rate, with a significant reduction in the total number photons by 2 orders of magnitude. The duration of our generation protocol is only half of the existing deterministic schemes. We also describe in detail an experimental method using cavity QED-enhanced resonance fluorescence and time-bin encoding to implement our protocol.
The all-photonic quantum repeater scheme, utilizing a type of graph state called the repeater graph state (RGS), promises resilience to photon losses and operational errors, offering a fast Bell pair generation rate limited only by the RGS creation time (rather than enforced round-trip waits). While existing research has predominantly focused on RGS generation and secret key sharing rate analysis, there is a need to extend investigations to encompass broader applications, such as distributed computation and teleportation, the main tasks envisioned for the Quantum Internet. Here we propose a new emitter-photonic qubit building block and an RGS protocol that addresses several key considerations: end node involvement in connection establishment, decoding of logical qubits within the RGS, and computing the Pauli frame corrections at each participating node to ensure the desired correct end-to-end Bell pair state. Our proposed building block significantly reduces the total number of emissive quantum memories required for end nodes and seamlessly integrates all-photonic and memory-based repeaters under the same communication protocol. We also present an algorithm for decoding logical measurement results, employing graphical reasoning based on graph state manipulation rules.
All-photonic repeater scheme based on a repeater graph state (RGS) promises tolerance to photon losses as well as operational errors. An attractive promise of this scheme is that it offers a fast Bell pair generation rate, limited only by the RGS creation time. This is in stark contrast to the traditional quantum repeater with quantum memories, where the Bell pair generation time is limited by the round-trip wait time leading to poor Bell pair generation performance and quality due to the decoherence of quantum memories. Prior research has focused on lowering the cost of RGS generation and improving upon the probabilistic generation to a deterministic generation with required photon counts to be the same as the number of qubits in the RGS. The operations of creating and manipulating the RGS into an end-to-end Bell pair are complex and have not been fully figured out in detail. Here, we focus on improving the practicality of the RGS scheme in real-world implementation and address three open questions of the RGS scheme, namely; how do end nodes participate in the connection, what classical information needs to be exchanged and processed between nodes, and how to make RGS scheme work hand in hand with the traditional quantum repeaters with memories.