TP
T. Plöckinger
info
Please Note
<p>This page displays the records of the person named above and is not linked to a unique person identifier. This record may need to be merged to a profile.</p>
1 records found
1
Long-distance quantum networks are expected to enable applications that rely on entanglement distributed between users in different metropolitan areas. A central question is what performance a long-distance entanglement-distribution link connecting these metropolitan areas must provide for such applications to become feasible on near-term hardware. This thesis studies this question for an intercity architecture in which users connect to local border nodes through metropolitan links, while the long-distance backbone connecting these border nodes is modeled abstractly by its entanglement delivery rate and fidelity. Using a NetSquid-based simulation framework, three benchmark protocols are analyzed: quantum key distribution, the CHSH game, and verifiable blind quantum computation. The main result is a protocol-dependent characterization of feasibility in backbone parameter space. For each protocol, thresholds are identified for the minimum metropolitan hardware improvement, backbone fidelity, and backbone rate required for successful implementation, and combined into feasibility maps. These maps reveal distinct tradeoffs between backbone quality and delivery rate, providing a comparative benchmark for assessing candidate backbone technologies based on hardware maturity.
...
Long-distance quantum networks are expected to enable applications that rely on entanglement distributed between users in different metropolitan areas. A central question is what performance a long-distance entanglement-distribution link connecting these metropolitan areas must provide for such applications to become feasible on near-term hardware. This thesis studies this question for an intercity architecture in which users connect to local border nodes through metropolitan links, while the long-distance backbone connecting these border nodes is modeled abstractly by its entanglement delivery rate and fidelity. Using a NetSquid-based simulation framework, three benchmark protocols are analyzed: quantum key distribution, the CHSH game, and verifiable blind quantum computation. The main result is a protocol-dependent characterization of feasibility in backbone parameter space. For each protocol, thresholds are identified for the minimum metropolitan hardware improvement, backbone fidelity, and backbone rate required for successful implementation, and combined into feasibility maps. These maps reveal distinct tradeoffs between backbone quality and delivery rate, providing a comparative benchmark for assessing candidate backbone technologies based on hardware maturity.