Classical certification of quantum computation under the dimension assumption

Citation
arXiv: 2401.17006 (2024)
Publisher DOI
10.48550/arXiv.2401.17006
ArXiv ID
2401.17006
Certification of quantum computing components can be crucial for quantum hardware improve- ments and the calibration of quantum algorithms. In this work, we propose an efficient method for certifying single-qubit quantum computation in a black-box scenario under the dimension as- sumption. The method is based on testing deterministic outcomes of quantum computation for predetermined gate sequences. Quantum gates are certified based on input-output correlations, with no auxiliary systems required. We show that a single-qubit universal gate set can be certified and analyze in detail certification of the S gate, for which the required sample complexity grows as O(e-1) with respect to the average gate infidelity e. Our approach takes a first step in bridg- ing the gap between strong notions of certification from self-testing and practically highly relevant approaches from quantum system characterization.
Subjects
Quantum Physics quantum-ph
DDC Class
530: Physics