Verifiable measurement-based quantum random sampling with trapped ions
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 th...
Gespeichert in:
Hauptverfasser: | , , , , , , , , , , , , , , , |
---|---|
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | 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. |
---|---|
DOI: | 10.48550/arxiv.2307.14424 |