Nöller, JanJanNöllerMiklin, NikolaiNikolaiMiklinKliesch, MartinMartinKlieschGachechiladze, MariamiMariamiGachechiladze2024-01-312024-01-312024-01-30arXiv: 2401.17006 (2024)https://hdl.handle.net/11420/45399Certification 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.enhttps://creativecommons.org/licenses/by/4.0/Quantum Physics quantum-phPhysicsPreprinthttps://doi.org/10.15480/882.1587410.48550/arXiv.2401.1700610.15480/882.158742401.17006Preprint