Generating multipartite nonlocality to benchmark quantum computers

Abstract

We show that quantum computers can be used for producing large $n$-partite nonlocality, thereby providing a method to benchmark them. The main challenges to overcome are as follows: (i) The interaction topology might not allow arbitrary two-qubit gates. (ii) Noise limits the Bell violation. (iii) The number of combinations of local measurements grows exponentially with $n$. To overcome (i), we point out that graph states that are compatible with the two-qubit connectivity of the computer can be efficiently prepared. To mitigate (ii), we note that for specific graph states, there are $n$-partite Bell inequalities whose resistance to white noise increases exponentially with $n$. To address (iii) for any $n$ and any connectivity, we introduce an estimator that relies on random sampling. As a result, we propose a method for producing $n$-partite Bell nonlocality with unprecedented large $n$. This allows one, in return, to benchmark nonclassical correlations regardless of the number of qubits or the connectivity. We test our approach by using a simulation for a noisy IBM quantum computer, which predicts $n$-partite Bell nonlocality for at least $n=24$ qubits.

arXiv comment14 pages, 13 figures

References in corpus (33)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Bell nonlocality
• Entanglement detection
• Quantum optimization using variational algorithms on near-term quantum devices
• Quantum Error Mitigation
• All multipartite Bell correlation inequalities for two dichotomic observables per site
• Direct Fidelity Estimation from Few Pauli Measurements
• Self-testing of quantum systems: a review
• Observation of Entangled States of a Fully Controlled 20-Qubit System
• Quantum certification and benchmarking
• Stability of macroscopic entanglement under decoherence
• Bell Inequalities for Graph States
• The definition of multipartite nonlocality
• Mitigation of readout noise in near-term quantum devices by classical post-processing based on detector tomography
• Nonlocality of cluster states of qubits
• Experimental test of Mermin inequalities on a 5-qubit quantum computer
• Efficient quantum algorithms for $GHZ$ and $W$ states, and implementation on the IBM quantum computer
• Ruling out real-valued standard formalism of quantum theory
• Experimental violation of multipartite Bell inequalities with trapped ions
• Two-setting Bell Inequalities for Graph States
• Re-examining the quantum volume test: Ideal distributions, compiler optimizations, confidence intervals, and scalable resource estimations
• Experimental few-copy multi-particle entanglement detection
• Mermin inequalities for perfect correlations
• Demonstrating the power of quantum computers, certification of highly entangled measurements and scalable quantum nonlocality
• (Nearly) optimal P-values for all Bell inequalities
• Generalized Ardehali-Bell inequalities for graph states
• Experimental demonstration of the violations of Mermin's and Svetlichny's inequalities for W- and GHZ-class of states
• Nonlocality with ultracold atoms in a lattice
• The statistical strength of experiments to reject local realism with photon pairs and inefficient detectors
• Testing Scalable Bell Inequalities for Quantum Graph States on IBM Quantum Devices
• Revisiting the experimental test of Mermin's inequalities at IBMQ
• Mermin Polynomials for Entanglement Evaluation in Grover's algorithm and Quantum Fourier Transform
• Experimental construction of a symmetric three-qubit entangled state and its utility in testing the violation of a Bell inequality on an NMR quantum simulator

Cited by in corpus (3)

• Probing many-body Bell correlation depth with superconducting qubits
• Graph state extraction from two-dimensional cluster states
• Distribution of Non-Locality On Quantum Random Circuits