TY - JOUR
T1 - Requirements for a processing-node quantum repeater on a real-world fiber grid
AU - Avis, Guus
AU - Ferreira da Silva, Francisco
AU - Coopmans, Tim
AU - Dahlberg, Axel
AU - Jirovská, Hana
AU - Maier, David
AU - Rabbie, Julian
AU - Torres-Knoop, Ariana
AU - Wehner, Stephanie
PY - 2023
Y1 - 2023
N2 - We numerically study the distribution of entanglement between the Dutch cities of Delft and Eindhoven realized with a processing-node quantum repeater and determine minimal hardware requirements for verifiable blind quantum computation using color centers and trapped ions. Our results are obtained considering restrictions imposed by a real-world fiber grid and using detailed hardware-specific models. By comparing our results to those we would obtain in idealized settings, we show that simplifications lead to a distorted picture of hardware demands, particularly on memory coherence and photon collection. We develop general machinery suitable for studying arbitrary processing-node repeater chains using NetSquid, a discrete-event simulator for quantum networks. This enables us to include time-dependent noise models and simulate repeater protocols with cut-offs, including the required classical control communication. We find minimal hardware requirements by solving an optimization problem using genetic algorithms on a high-performance-computing cluster. Our work provides guidance for further experimental progress, and showcases limitations of studying quantum-repeater requirements in idealized situations.
AB - We numerically study the distribution of entanglement between the Dutch cities of Delft and Eindhoven realized with a processing-node quantum repeater and determine minimal hardware requirements for verifiable blind quantum computation using color centers and trapped ions. Our results are obtained considering restrictions imposed by a real-world fiber grid and using detailed hardware-specific models. By comparing our results to those we would obtain in idealized settings, we show that simplifications lead to a distorted picture of hardware demands, particularly on memory coherence and photon collection. We develop general machinery suitable for studying arbitrary processing-node repeater chains using NetSquid, a discrete-event simulator for quantum networks. This enables us to include time-dependent noise models and simulate repeater protocols with cut-offs, including the required classical control communication. We find minimal hardware requirements by solving an optimization problem using genetic algorithms on a high-performance-computing cluster. Our work provides guidance for further experimental progress, and showcases limitations of studying quantum-repeater requirements in idealized situations.
UR - http://www.scopus.com/inward/record.url?scp=85174146605&partnerID=8YFLogxK
U2 - 10.1038/s41534-023-00765-x
DO - 10.1038/s41534-023-00765-x
M3 - Article
AN - SCOPUS:85174146605
SN - 2056-6387
VL - 9
JO - NPJ Quantum Information
JF - NPJ Quantum Information
IS - 1
M1 - 100
ER -