Certifying Quantum Gates via Automata Advantage

Abstract

There is growing interest in developing rigorous tests of quantumness that are feasible even before practical quantum advantages become a reality. Such tests not only aim to certify the quantum nature of a system but also serve as benchmarks for precise quantum control. In this work, we argue that promise problems, studied in the theory of finite automata, provide a natural framework for designing sound tests of quantum gate quality. Soundness, the property that only implementations of sufficiently high quality can pass the test, is a central requirement for meaningful certification. We study several promise problems relevant to quantum gate testing and establish separations between the memory resources required by quantum and classical finite automata to solve them. These separations form the theoretical basis for using promise problems as tests of quantumness. Finally, we show how results from automata theory, in particular the minimality of automata, can be used to derive soundness guarantees.