Options
Classical certification of quantum computation under the dimension assumption
Citation Link: https://doi.org/10.15480/882.15874
Publikationstyp
Preprint
Date Issued
2024-01-30
Sprache
English
TORE-DOI
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
Loading...
Name
2401.17006v4.pdf
Type
Main Article
Size
1.1 MB
Format
Adobe PDF