Detecting Errors in a Quantum Network with Pauli Checks

2024/05/24 by Alvin Gonzales, Gonzales, Alvin, Daniel Dilley +7 · 2 citations
Computer Science · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph)

paper · pdf · doi:10.48550/arxiv.2405.15236

openalex publication_date 2024/05/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/31

Abstract

We apply the quantum error detection scheme Pauli check sandwiching (PCS) to quantum networks by turning it into a distributed multiparty protocol. PCS provides protection on the targeted qubits and generally requires less resource overhead than standard quantum error correction and detection codes. We provide analytical equations for the final fidelity and postselection rate for different PCS checks. We also introduce a recursive version of PCS that generates a family of distance 2 quantum codes that are locally equivalent to Calderbank-Shor-Steane (CSS) codes. Our analytical results are benchmarked against the Bennet-Brassard-Popescu-Schumacher-Smolin-Wooters (BBPSSW) protocol in comparable scenarios. We also perform simulations with noisy gates for entanglement swapping and attain fidelity improvements. Lastly, we discuss various setups and graph state properties of PCS.

Cited by

• InterQnet: A Heterogeneous Full-Stack Approach to Co-designing Scalable Quantum Networks
• QuantEM: The quantum error management compiler

Related

• Pauli Manipulation Detection codes and Applications to Quantum Communication over Adversarial Channels
• Extrapolating Pauli Checks for Expectation Value Estimation on Noisy Quantum Devices
• Dynamic Resource Allocation with Quantum Error Detection
• Error-detection-based quantum fault tolerance against discrete Pauli noise
• Space-Time Tradeoffs of Pauli-Based Computation in Distributed qLDPC Architectures