In this perspective we discuss verification of quantum devices in the context of specific examples formulated as proposed experiments.Our first example is verification of analog quantum simulators as Hamiltonian learning, where the input Hamiltonian as the design goal is compared with the parent Hamiltonian for the quantum states prepared on the device.The second example discusses cross-device verification on the quantum level (i.e., by comparing quantum states prepared on different quantum devices).We focus in particular on protocols using randomized measurements, and we propose establishing a central data repository, where existing experimental devices and platforms can be compared.In our final example, we address verification of the output of a quantum device from a computer science perspective, addressing the question of how a user of a quantum processor can be certain of the correctness of its output, and propose minimal demonstrations on present-day devices.
In this perspective we discuss verification of quantum devices in the context of specific examples formulated as proposed experiments.Our first example is verification of analog quantum simulators as Hamiltonian learning, where the input Hamiltonian as the design goal is compared with the parent Hamiltonian for the quantum states prepared on the device.The second example discusses cross-device verification on the quantum level (i.e., by comparing quantum states prepared on different quantum devices).We focus in particular on protocols using randomized measurements, and we propose establishing a central data repository, where existing experimental devices and platforms can be compared.In our final example, we address verification of the output of a quantum device from a computer science perspective, addressing the question of how a user of a quantum processor can be certain of the correctness of its output, and propose minimal demonstrations on present-day devices.
In this perspective we discuss verification of quantum devices in the context of specific examples, formulated as proposed experiments. Our first example is verification of analog quantum simulators as Hamiltonian learning, where the input Hamiltonian as design goal is compared with the parent Hamiltonian for the quantum states prepared on the device. The second example discusses crossdevice verification on the quantum level, i.e. by comparing quantum states prepared on different quantum devices. We focus in particular on protocols using randomized measurements, and we propose establishing a central data repository, where existing experimental devices and platforms can be compared. In our final example, we address verification of the output of a quantum device from a computer science perspective, addressing the question of how a user of a quantum processor can be certain about the correctness of its output, and propose minimal demonstrations on present day devices.
Intermediate-scale quantum devices are becoming more reliable and may soon be harnessed to solve useful computational tasks. At the same time, common classical methods used to verify their computational output become intractable due to a prohibitive scaling of required resources with system size. Inspired by recent experimental progress, here we describe and analyze efficient cross-platform verification protocols for quantum states and show how these can be used to verify computations. We focus on the pairwise comparison between distant nodes of a quantum network, identify the most promising protocols, and discuss possible implementations in laboratory settings. As a proof of principle, we implement basic versions of these schemes on available quantum processors.
We describe a protocol for cross-platform verification of quantum simulators and quantum computers. We show how to measure directly the overlap Tr[ρ_{1}ρ_{2}] and the purities Tr[ρ_{1,2}^{2}], and thus a fidelity of two, possibly mixed, quantum states ρ_{1} and ρ_{2} prepared in separate experimental platforms. We require only local measurements in randomized product bases, which are communicated classically. As a proof of principle, we present the measurement of experiment-theory fidelities for entangled 10-qubit quantum states in a trapped ion quantum simulator.
With today’s quantum processors venturing into regimes beyond the capabilities of classical devices, we face the challenge to verify that these devices perform as intended, even when we cannot check their results on classical computers. In a recent breakthrough in computer science, a protocol was developed that allows the verification of the output of a computation performed by an untrusted quantum device based only on classical resources. Here, we follow these ideas, and demonstrate in a first, proof-of-principle experiment the verification of the output of a quantum computation using only classical means on a small trapped-ion quantum processor. We contrast this to verification protocols, which require trust and detailed hardware knowledge, as in gate-level benchmarking, or additional quantum resources in case we do not have access to or trust in the device to be tested. While our experimental demonstration uses a simplified version of Mahadev’s protocol we demonstrate the necessary steps for verifying fully untrusted devices. A scaled-up version of our protocol will allow for classical verification, requiring no hardware access or detailed knowledge of the tested device. Its security relies on post–quantum secure trapdoor functions within an interactive proof. The conceptually straightforward, but technologically challenging scaled-up version of the interactive proofs, considered here, can be used for a variety of additional tasks such as verifying quantum advantage, generating and certifying quantum randomness, or composable remote state preparation.
Learning the Hamiltonian of a many-body system from its dynamics is a central task in quantum science, yet the algorithms with the strongest provable guarantees assume some level of quantum control--fast, arbitrary single-qubit gates interleaved with time evolution, and measurements in arbitrary bases--that is beyond the capabilities of near-term analog quantum simulators. Motivated by analog atom- and ion-based platforms, we study Hamiltonian learning under minimal access models.
Uniform state preparation and measurements: We first consider the setting where in every experiment, one can rotate each qubit to the same state, perform short-time evolution, and measure every qubit in the same basis. Surprisingly, we show that for generic 2-local Hamiltonians on any interaction graph, all of the parameters can be reconstructed from such experiments.
Computational basis state preparation and measurements: We then consider a similarly constrained setting, but where state preparation and measurement are restricted to the computational basis. For nearest-neighbor Hamiltonians with only Pauli X/Z interactions, a class which captures contemporary Rydberg atom platforms, we show that over 1D and 2D rectangular lattices, all of the parameters can be reconstructed from such experiments up to unavoidable gauges.
Our protocols introduce new techniques for solving structured polynomial systems over an extensive number of parameters. Taken together, our results suggest that one can learn a great deal from the dynamics of quantum many-body systems even under the most stringent experimental constraints.
Abstract With today’s quantum processors venturing into regimes beyond the capabilities of classical devices, we face the challenge to verify that these devices perform as intended, even when we cannot check their results on classical computers. In a recent breakthrough in computer science, a protocol was developed that allows the verification of the output of a computation performed by an untrusted quantum device based only on classical resources. Here, we follow these ideas, and demonstrate in a first, proof-of-principle experiment the verification of the output of a quantum computation using only classical means on a small trapped-ion quantum processor. We contrast this to verification protocols, which require trust and detailed hardware knowledge, as in gate-level benchmarking, or additional quantum resources in case we do not have access to or trust in the device to be tested. While our experimental demonstration uses a simplified version of Mahadev’s protocol we demonstrate the necessary steps for verifying fully untrusted devices. A scaled-up version of our protocol will allow for classical verification, requiring no hardware access or detailed knowledge of the tested device. Its security relies on post–quantum secure trapdoor functions within an interactive proof. The conceptually straightforward, but technologically challenging scaled-up version of the interactive proofs, considered here, can be used for a variety of additional tasks such as verifying quantum advantage, generating and certifying quantum randomness, or composable remote state preparation.