Quantum Accreditation with Non-Clifford Two-qubit Gates
Andrew Jackson, Theodoros Kapourniotis, Animesh Datta

TL;DR
This paper introduces scalable quantum accreditation protocols for circuits with non-Clifford two-qubit gates like fSim and XY, ensuring reliable quantum computations on existing hardware.
Contribution
It develops practical protocols that bound error probabilities and extend Pauli twirling to non-Pauli bases, advancing quantum verification methods.
Findings
Protocols effectively upper-bound error distributions.
Robustness demonstrated against small perturbations.
Generalization of Pauli twirling to non-Pauli bases.
Abstract
We develop a family of quantum accreditation protocols for quantum circuits with non-Clifford two-qubit gates. The latter includes families of gates such as the fSim and XY families of gates, native to existing hardwares. We provide practical and scalable protocols that upper-bound the total variation distance between the probability distributions of error-free and erroneous quantum computations. We also establish the robustness of our protocols to small perturbations and generalize Pauli twirling to non-Pauli single-qubit bases, which may be of independent interest.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
