Detecting Errors in a Quantum Network with Pauli Checks

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.

Comments are welcome!

References in corpus (14)

• Mixed State Entanglement and Quantum Error Correction
• Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels
• Quantum privacy amplification and the security of quantum cryptography over noisy channels
• All photonic quantum repeaters
• Quantum repeaters: From quantum networks to the quantum internet
• Everything You Always Wanted to Know About LOCC (But Were Afraid to Ask)
• Distributed Quantum Computation Based-on Small Quantum Registers
• Entanglement purification and quantum error correction
• Multi-parameter estimation in networked quantum sensors
• Loss tolerance in one-way quantum computation via counterfactual error correction
• Optimizing practical entanglement distillation
• Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem
• Distributing Graph States Over Arbitrary Quantum Networks
• Extended flag gadgets for low-overhead circuit verification