In this work we explore how different types of resources are distributed among the states generated by quantum random circuits. We focus on multipartite nonlocality, but we also analyze quantum correlations by appealing to different entanglement and nonclassicality measures. We analyze the violation of Mermin and Svetlichny inequalities in order to get a glance at the distribution of nonlocality and genuine multipartite nonlocality. Next, we compare universal vs nonuniversal sets of gates, to gain insight into the problem of explaining quantum advantage. By comparing the results obtained with ideal (noiseless) vs noisy intermediate-scale quantum devices, we lay the basis of a certification protocol, which aims to quantify how robust is the resources distribution among the states that a given device can generate. We have implemented our nonlocality-based benchmark on actual quantum processors with different architectures, in order to assess up to which point they are capable of reproducing the ideal results.
Benchmarking quantum processors is a central task in every roadmap aimed at quantum advantage. Here, we discuss a benchmarking protocol based on the violation of the Svetlichny inequality, which is designed to simulate genuine multipartite nonlocality. We compare it with Mermin's inequality, and present the results of applying this framework to two different quantum processing units -the superconducting system Garnet (from IQM) and the ion-trap system Marmot (from AQT), testing different families of quantum circuits for three to five qubits under identical experimental conditions. We also run simultaneous triplet tests across the full register, including a comparison between GHZ and linear cluster states, to probe how Svetlichny-inequality violations depend on qubit location and calibration. Our results demonstrate that tests based on genuine multipartite nonlocality provide a powerful tool to characterize the collective performance of quantum devices and to guide their calibration and optimization.
While all bipartite pure entangled states are known to generate correlations violating a Bell inequality, and are therefore nonlocal, the quantitative relation between pure state entanglement and nonlocality is poorly understood. In fact, some Bell inequalities are maximally violated by non-maximally entangled states and this phenomenon is also observed for other operational measures of nonlocality. In this work, we study a recently proposed measure of nonlocality defined as the probability that a pure state displays nonlocal correlations when subjected to random measurements. We first prove that this measure satisfies some natural properties for an operational measure of nonlocality. Then, we show that for pure states of two qubits the measure is monotonic with entanglement for all correlation two-outcome Bell inequalities: for all these inequalities, the more the state is entangled, the larger the probability to violate them when random measurements are performed. Finally, we extend our results to the multipartite setting.
Quantum networks are built from independent sources, and their nonlocality has mostly been studied with sources that emit bipartite entangled states. A source of three entangled qubits is richer, since its nonlocality can be tested by the Mermin or the more demanding Svetlichny inequality. We ask how network nonlocality relates to these two single-source notions and find that the answer depends on the wiring. When two central nodes without inputs share every source, Bell-state measurements turn every Svetlichny violation into a network violation, and even all entangled generalised Greenberger-Horne-Zeilinger states violate the network inequality. When a single central node is shared, the relation reverses, and a network violation requires a Mermin violation of the source. With more sources, the maximal violation depends on whether their number is even or odd, and we give tight bounds for both cases. These results show that the way multipartite sources are wired decides which kind of nonlocality a network inherits.
While Bell nonlocality of a bipartite system is counterintuitive, multipartite nonlocality in our many-body world turns out to be even more so. Recent theoretical study reveals in a theory-agnostic manner that genuine multipartite nonlocal correlations cannot be explained by any causal theory involving fewer-partite nonclassical resources and global shared randomness. Here, we provide a Bell-type inequality as a test for genuine multipartite nonlocality in network by exploiting a matrix representation of the causal structure of a multipartite system. We further present experimental demonstrations that both four-photon GHZ state and generalized four-photon GHZ state significantly violate the inequality, i.e., the observed four-partite correlations resist explanations involving three-way nonlocal resources subject to local operations and common shared randomness, hence confirming that nature is boundless multipartite nonlocal.
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.
The violations of Bell inequalities by measurements on quantum states give rise to the phenomenon of quantum non-locality and express the advantage of using quantum resources over classical ones for certain information-theoretic tasks. The relative degree of quantum violations has been well studied in the bipartite scenario and in the multipartite scenario with respect to fully local behaviours. However, the multipartite setting entails a more complex classification in which different notions on non-locality can be established. In particular, genuine multipartite non-local distributions apprehend truly multipartite effects, given that these behaviours cannot be reproduced by bilocal models that allow correlations among strict subsets of the parties beyond a local common cause. We show here that, while in the so-called correlation scenario the relative violation of bilocal Bell inequalities by quantum resources is bounded, i.e. it does not grow arbitrarily with the number of inputs, it turns out to be unbounded in the general case. We identify Bell functionals that take the form of non-local games for which the ratio of the quantum and bilocal values grows unboundedly as a function of the number of inputs and outputs.