Classical Verification of Quantum Computations

Abstract: We present the first protocol allowing a classical computer to interactively verify the result of an efficient quantum computation. We achieve this by constructing a measurement protocol, which enables a classical verifier to use a quantum prover as a trusted measurement device. The protocol forces the prover to behave as follows: the prover must construct an n qubit state of his choice, measure each qubit in the Hadamard or standard basis as directed by the verifier, and report the measurement results to the verifier. The soundness of this protocol is enforced based on the assumption that the learning with errors problem is computationally intractable for efficient quantum machines.

• The paper introduces a protocol enabling classical computers to verify quantum computation outputs by leveraging a quantum prover as a trusted measurement device.
• The protocol's security relies on cryptographic hardness assumptions, such as the Learning with Errors (LWE) problem, and the use of trapdoor claw-free and injective functions.
• This work demonstrates that classical verification of quantum computations is possible under certain assumptions, offering a path towards more scalable and trustworthy quantum computing implementations.

Classical Verification of Quantum Computations

The paper "Classical Verification of Quantum Computations" by Urmila Mahadev presents a protocol that enables the interaction between a classical computer and a quantum prover to verify quantum computations' outputs. This protocol introduces a method for classical verifiers to confirm quantum results without needing a full quantum verifier, thereby addressing a long-standing question in quantum computing.

Measurement Protocol and Classical Verification

The core contribution in this paper is the measurement protocol that forces a quantum prover to act as a classical verifier's trusted measurement device. This protocol relies on the cryptographic hardness assumption that the Learning with Errors (LWE) problem is insurmountable for efficient quantum machines. The process compels the quantum prover to construct an $n$-qubit state, which must then be measured as requested by the verifier in either the standard or Hadamard basis.

Protocol Design and Analysis

The measurement protocol is grounded on two primary components—trapdoor claw-free functions and trapdoor injective function families. These cryptographic constructs ensure that the prover commits to a quantum state and cannot adaptively alter the measurement results in response to the verifier's choice of basis.

1. Trapdoor Claw-Free Functions (NTCF): These functions allow forming a classical commitment to a quantum state by associating it with a claw—a pair of inputs mapping to the same output, which are computationally hard to identify simultaneously.
2. Trapdoor Injective Functions: This family of functions helps in classical commitment by ensuring non-overlapping images for function pairs, which is crucial for extracting classical measurement outcomes via predetermined bases by the verifier.

Strength of the Protocol

The protocol's soundness is reliant on several cryptographic properties. First, it utilizes computational assumptions like the difficulty of solving specific instances of LWE to maintain robustness against quantum attacks. Secondly, the protocol achieves a completeness that lets the verifier, with negligible computational overhead, ensure that the quantum prover's state corresponds to a singular comprehensible quantum state by providing indistinguishable outputs from an ideal quantum state measurement.

Implications for Quantum Computing

The implications of this work are profound, both theoretically and practically. Theoretically, it shows that classical verification of quantum computations is plausible under certain cryptographic assumptions. Practically, it opens avenues for scalable quantum computation verification, which could vastly improve the integrity and trust of quantum computation outputs, especially as quantum computing moves towards more complex and commercially viable implementations.

Future Directions

Further research could optimize the efficiency of this protocol and explore other hardness assumptions for broader applicability. Additionally, integration with existing quantum communication protocols, perhaps including error-correcting methods to reduce noise impact from quantum measurements, would be a worthwhile pursuit.

In summary, the paper presents a significant step towards bridging the gap between quantum and classical computing through a well-structured protocol underpinned by robust cryptographic principles, making quantum technology more accessible and verifiable by classical means.