Verifiable measurement-based quantum random sampling with trapped ions
arXiv:2307.14424 · doi:10.1038/s41467-024-55342-3
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.
11+16 pages. Comments welcome. v2: improved presentation
References in corpus (34)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Measurement-based quantum computation with cluster states
- Characterizing Quantum Supremacy in Near-Term Devices
- Predicting Many Properties of a Quantum System from Very Few Measurements
- Direct Fidelity Estimation from Few Pauli Measurements
- Time-Domain Multiplexed 2-Dimensional Cluster State: Universal Quantum Computing Platform
- Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light
- Deterministic generation of a two-dimensional cluster state
- A compact ion-trap quantum computing demonstrator
- A universal qudit quantum processor with trapped ions
- A quantum information processor with trapped ions
- Quantum certification and benchmarking
- Local random quantum circuits are approximate polynomial-designs
- Average-case complexity versus approximate simulation of commuting quantum computations
- Quantum Supremacy and the Complexity of Random Circuit Sampling
- Preparing random states and benchmarking with many-body quantum chaos
- Computational advantage of quantum random sampling
- Solving the sampling problem of the Sycamore quantum circuits
- Sequential generation of linear cluster states from a single photon emitter
- Deterministic entanglement of ions in thermal states of motion
- Measurement-based quantum computation with trapped ions
- Reliable quantum certification for photonic quantum technologies
- Phase transition in Random Circuit Sampling
- Quantum Supremacy for Simulating A Translation-Invariant Ising Spin Model
- A polynomial-time classical algorithm for noisy random circuit sampling
- Direct certification of a class of quantum simulations
- Deterministic correction of qubit loss
- Experimental few-copy multi-particle entanglement detection
- Sample complexity of device-independently certified "quantum supremacy"
- Limitations of Linear Cross-Entropy as a Measure for Quantum Advantage
- Optimal verification of stabilizer states
- Closing gaps of a quantum advantage with short-time Hamiltonian dynamics
- Interactive Protocols for Classically-Verifiable Quantum Advantage
- Fidelity measurement of a multiqubit cluster state with minimal effort