A system of free fermions can be simulated on a classical computer, and a single non-Gaussian state makes it a universal quantum computer. We show that the same line bounds quantum nonlocality. Measured as fermionic qubits, free fermions carry the Bell nonlocality of one entangled pair, no more, however many parties share them, and are never genuinely multipartite nonlocal. Fermion parity is the reason. Genuine multipartite nonlocality is thus the resource of universal fermionic computation, cannot arise from any mean-field state, and we certify it on $48$ qubits of IBM processors.
A system of free fermions can be simulated on a classical computer, and a single non-Gaussian state makes it a universal quantum computer. We show that the same line bounds quantum nonlocality. Measured as fermionic qubits, free fermions carry the Bell nonlocality of one entangled pair, no more, however many parties share them, and are never genuinely multipartite nonlocal. Fermion parity is the reason. Genuine multipartite nonlocality is thus the resource of universal fermionic computation, cannot arise from any mean-field state, and we certify it on 48 qubits of IBM processors.
Free-fermion states are classically simulable, yet, written as qubits, they typically carry extensive magic, the quantum resource that stabilizer circuits lack. Part of this magic is nonlocal: local unitaries acting separately on two parts of the system cannot remove it. If these local unitaries are restricted to Gaussian ones, the nonlocal magic grows linearly with the number m of partially entangled fermion pairs. We show that this growth is an artifact of the Gaussian restriction: local Gaussian unitaries minimize the nonlocal stabilizer Rényi entropy for up to three pairs, but not from four pairs on. General local non-Gaussian unitaries that respect fermion parity take m free-fermion pairs to fermionic Bell pairs with a fidelity that decays at most as 1/m compared to exponential decay with Gaussian unitaries, so the nonlocal magic drops from linear to logarithmic in m. The reason is statistical --- Bell pairs have equal Schmidt weights, that is, a fully degenerate entanglement spectrum, and a state can stay far from them only if its Schmidt weights are spread over many orders of magnitude. This spread is measured by the capacity of entanglement CE, the variance of the entanglement Hamiltonian, and the nonlocal magic of any fermionic state grows at most logarithmically with CE. Free-fermion pairs add to CE independently, so CE grows only linearly in m, and this leads to the stabilizer fidelity decreasing at most as 1/m. Almost all the magic of free fermions, including Hartree--Fock and BCS mean-field states, is therefore local.
Fermionic Gaussian states describe free fermions and underlie the mean-field picture of matter, from metals to superconductors; they are also efficiently simulable on classical computers. Departures from Gaussianity -- the correlations produced by interactions -- are therefore what make a fermionic system hard to simulate classically and useful for quantum computation, analogous to the role of magic in stabilizer-based quantum computation. Yet detecting and quantifying such non-Gaussianity at scale has remained challenging. Here we introduce practical tests and witnesses of fermionic non-Gaussianity built on fermionic antiflatness, a measure derived from the two-point covariance matrix. We estimate it with two protocols -- a two-copy Bell measurement and a single-copy scheme using commuting Majorana bilinears -- that determine whether a state is Gaussian or far from it at lower measurement cost than existing approaches, using only operations native to fault-tolerant hardware. For mixed states, a purity-corrected witness certifies non-Gaussianity and remains robust under strong noise; running it on the IQM quantum processor, we find that noise can both reduce and enhance non-Gaussianity. Finally, we show that preparing pseudorandom fermionic states requires extensive non-Gaussianity. Together, these tools enable the study and certification of non-Gaussian fermionic resources on present-day quantum devices.
Local measurements on bipartite maximally entangled states can yield correlations that are maximally nonlocal, monogamous, and with fully random outcomes. This makes these states ideal for bipartite cryptographic tasks. Genuine-multipartite nonlocality constitutes a stronger notion of nonlocality in the multipartite case. Maximal genuine-multipartite nonlocality, monogamy, and random outcomes are thus highly desired properties for genuine-multipartite cryptographic scenarios. We prove that local measurements on any Greenberger-Horne-Zeilinger state can produce correlations that are fully genuine-multipartite nonlocal, monogamous, and with fully random outcomes. A key ingredient in our proof is a multipartite chained Bell inequality detecting genuine-multipartite nonlocality, which we introduce. Finally, we discuss applications to device-independent secret sharing.
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.
The nonlocal correlations of multipartite entangled states can be reproduced by a classical model if sufficiently many parties join together or if sufficiently many parties broadcast their measurement inputs. The maximal number m of groups and the minimal number k of broadcasting parties that allow for the reproduction of a given set of correlations quantify their multipartite nonlocal content. We show how upper bounds on m and lower bounds on k can be computed from the violation of the Mermin-Svetlichny inequalities. While n-partite Greenberger-Horne-Zeilinger states violate these inequalities maximally, we find that W states violate them only by a very small amount.
We investigate the genuine multipartite nonlocality of three-mode Gaussian states of continuous variable systems. For pure states, we present a simplified procedure to obtain the maximum violation of the Svetlichny inequality based on displaced parity measurements, and we analyze its interplay with genuine tripartite entanglement measured via Rényi-2 entropy. The maximum Svetlichny violation admits tight upper and lower bounds at fixed tripartite entanglement. For mixed states, no violation is possible when the purity falls below 0.86. We also explore a set of recently derived weaker inequalities for three-way nonlocality, finding violations for all tested pure states. Our results provide a strong signature for the nonclassical and nonlocal nature of Gaussian states despite their positive Wigner function, and lead to precise recipes for its experimental verification.