Verifiable measurement-based quantum random sampling with trapped ions
Martin Ringbauer, Marcel Hinsche, Thomas Feldker, Paul K. Faehrmann, Juani Bermejo-Vega, Claire Edmunds, Lukas Postler, Roman Stricker, Christian D. Marciniak, Michael Meth, Ivan Pogorelov, Rainer Blatt, Philipp Schindler, Jens Eisert, Thomas Monz, Dominik Hangleiter
TL;DR
This work tackles verifiable quantum random sampling on near-term devices by leveraging measurement-based quantum computing (MBQC) with large, randomly rotated cluster states generated in trapped-ion processors. It introduces efficient fidelity certificates via direct fidelity estimation (DFE) generalized to MBQC, and employs qubit recycling to sample from cluster states larger than the physical register, enabling scalable verification up to practical sizes. The authors connect average-case MBQC fidelity to cross-entropy benchmarking (XEB) while establishing conditions under which XEB yields reliable fidelity estimates, and provide a Stockmeyer-based threshold arguing for hardness of classical verification beyond a fidelity threshold. Overall, the study demonstrates a feasible path toward verified quantum advantage in random sampling using MBQC, with quantitative benchmarking, noise-robust certificates, and concrete experimental progress toward scalable, verifiable quantum computation.
Abstract
Quantum computers are now on the brink of outperforming their classical counterparts. One way to demonstrate the advantage of quantum computation is through quantum random sampling performed on quantum computing devices. However, existing tools for verifying that a quantum device indeed performed the classically intractable sampling task are either impractical or not scalable to the quantum advantage regime. The verification problem thus remains an outstanding challenge. Here, we experimentally demonstrate efficiently verifiable quantum random sampling in the measurement-based model of quantum computation on a trapped-ion quantum processor. We create and sample from random cluster states, which are at the heart of measurement-based computing, up to a size of 4 x 4 qubits. By exploiting the structure of these states, we are able to recycle qubits during the computation to sample from entangled cluster states that are larger than the qubit register. We then efficiently estimate the fidelity to verify the prepared states -- in single instances and on average -- and compare our results to cross-entropy benchmarking. Finally, we study the effect of experimental noise on the certificates. Our results and techniques provide a feasible path toward a verified demonstration of a quantum advantage.
