Post hoc verification of quantum computation
This addresses the need for efficient verification in quantum computing, offering a novel approach that could enhance trust and scalability in quantum systems.
The paper tackles the problem of verifying arbitrary quantum computations by proposing two non-interactive methods based on the local Hamiltonian problem, enabling post hoc verification without requiring interactive communication between verifier and provers.
With recent progress on experimental quantum information processing, an important question has arisen as to whether it is possible to verify arbitrary computation performed on a quantum processor. A number of protocols have been proposed to achieve this goal, however all are interactive in nature, requiring that the computation be performed in an interactive manner with back and forth communication between the verifier and one or more provers. Here we propose two methods for verifying quantum computation in a non-interactive manner based on recent progress in the understanding of the local Hamiltonian problem. Provided that the provers compute certain witnesses for the computation, this allows the result of a quantum computation to be verified after the fact, a property not seen in current verification protocols.