Papers › Detecting Errors in a Quantum Network with Pauli Checks
Detecting Errors in a Quantum Network with Pauli Checks
Alvin Gonzales, Daniel Dilley, Bikun Li, Liang Jiang, Zain H. Saleem
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
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.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections