Practical Verification of Quantum Properties in Quantum Approximate Optimization Runs
M. Sohaib Alam, Filip A. Wudarski, Matthew J. Reagor, James Sud, Shon, Grabbe, Zhihui Wang, Mark Hodson, P. Aaron Lott, Eleanor G. Rieffel, Davide, Venturelli

TL;DR
This paper presents practical methods for verifying quantum properties such as entanglement in quantum algorithms like QAOA, using minimal measurements, and demonstrates these techniques through experiments on a 24-qubit quantum processor.
Contribution
It introduces measurement-efficient techniques and new entanglement witnesses tailored for variational quantum algorithms, enabling practical verification of quantum resources in NISQ devices.
Findings
Efficient reconstruction of single-qubit states with limited measurements
Development of Bell-type observables as entanglement witnesses
Experimental validation on a 24-qubit quantum chip
Abstract
In order to assess whether quantum resources can provide an advantage over classical computation, it is necessary to characterize and benchmark the non-classical properties of quantum algorithms in a practical manner. In this paper, we show that using measurements in no more than 3 out of the possible bases, one can not only reconstruct the single-qubit reduced density matrices and measure the ability to create coherent superpositions, but also possibly verify entanglement across all qubits participating in the algorithm. We introduce a family of generalized Bell-type observables for which we establish an upper bound to the expectation values in fully separable states by proving a generalization of the Cauchy-Schwarz inequality, which may serve of independent interest. We demonstrate that a subset of such observables can serve as entanglement witnesses for QAOA-MaxCut states,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
