Practical Verification of Quantum Properties in Quantum Approximate Optimization Runs

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 $3^N$ 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 $N$ 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, and further argue that they are especially well tailored for this purpose by defining and computing an entanglement potency metric on witnesses. A subset of these observables also certify, in a weaker sense, the entanglement in GHZ states, which share the ${\mathbb{Z}}_2$ symmetry of QAOA-MaxCut. The construction of such witnesses follows directly from the cost Hamiltonian to be optimized, and not through the standard technique of using the projector of the state being certified. It may thus provide insights to construct similar witnesses for other variational algorithms prevalent in the NISQ era. We demonstrate our ideas with proof-of-concept experiments on the Rigetti Aspen-9 chip for ansatze containing up to 24 qubits.

References in corpus (36)

• Quantum entanglement
• Entanglement of Formation of an Arbitrary State of Two Qubits
• Quantum Machine Learning
• A variational eigenvalue solver on a quantum processor
• Entanglement of a Pair of Quantum Bits
• Entanglement detection
• The theory of variational hybrid quantum-classical algorithms
• A Quantum Approximate Optimization Algorithm
• On the volume of the set of mixed entangled states
• Quantum discord and the power of one qubit
• Towards Practical Quantum Variational Algorithms
• Validating quantum computers using randomized model circuits
• On the role of entanglement in quantum computational speed-up
• Quantum optimization using variational algorithms on near-term quantum devices
• Defining and detecting quantum speedup
• Noise tailoring for scalable quantum computation via randomized compiling
• Induced measures in the space of mixed quantum states
• Decoherence and multipartite entanglement
• Optimal, reliable estimation of quantum states
• Quantum Approximate Optimization Algorithm for MaxCut: A Fermionic View
• Obstacles to State Preparation and Variational Optimization from Symmetry Protection
• Demonstration of Universal Parametric Entangling Gates on a Multi-Qubit Lattice
• Exploring entanglement and optimization within the Hamiltonian Variational Ansatz
• Quantum discord and its allies: a review
• Entanglement witnesses: construction, analysis and classification
• Parametrically Activated Entangling Gates Using Transmon Qubits
• Quantum Computers and Quantum Coherence
• Toolbox for entanglement detection and fidelity estimation
• Classical symmetries and the Quantum Approximate Optimization Algorithm
• Quantum tomography as a tool for the characterization of optical devices
• Characterizing local noise in QAOA circuits
• Quantum variational optimization: The role of entanglement and problem hardness
• Detecting and quantifying entanglement on near-term quantum devices
• Entanglement Witness $2.0$: Compressed/Mirrored Entanglement Witnesses
• Multiqubit entanglement witness
• Entanglement Production and Convergence Properties of the Variational Quantum Eigensolver

Cited by in corpus (7)

• An entanglement perspective on the quantum approximate optimization algorithm
• Trainability Enhancement of Parameterized Quantum Circuits via Reduced-Domain Parameter Initialization
• Quantum approximate optimization algorithm for qudit systems
• Assessing and Advancing the Potential of Quantum Computing: A NASA Case Study
• Calibrating the Classical Hardness of the Quantum Approximate Optimization Algorithm
• A class of Bell diagonal entanglement witnesses in ${\mathbb{C}}^4\otimes {\mathbb{C}}^4$: optimization and the spanning property
• Out of the Loop: Structural Approximation of Optimisation Landscapes and non-Iterative Quantum Optimisation