Quantum Accreditation with Non-Clifford Two-qubit Gates
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866914579333775360 |
|---|---|
| author | Jackson, Andrew Kapourniotis, Theodoros Datta, Animesh |
| author_facet | Jackson, Andrew Kapourniotis, Theodoros Datta, Animesh |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_19205 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Quantum Accreditation with Non-Clifford Two-qubit Gates Jackson, Andrew Kapourniotis, Theodoros Datta, Animesh Quantum Physics 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. |
| title | Quantum Accreditation with Non-Clifford Two-qubit Gates |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2605.19205 |