Classifying the simplest Bell inequalities beyond qubits and their applications towards self-testing
- URL: http://arxiv.org/abs/2602.08469v1
- Date: Mon, 09 Feb 2026 10:16:02 GMT
- Title: Classifying the simplest Bell inequalities beyond qubits and their applications towards self-testing
- Authors: Palash Pandya, Shubhayan Sarkar, Remigiusz Augusiak,
- Abstract summary: Bell inequalities show gap between local and nonlocal quantum behaviour.<n>This is useful for the geometric characterisation of the set of nonlocal correlations achievable within quantum theory.<n>It provides a systematic way to construct Bell inequalities tailored to specific quantum information processing tasks.
- Score: 0.22399170518036918
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Bell inequalities reveal the fundamentally nonlocal character of quantum mechanics. In this regard, one of the interesting problems is to explore all possible Bell inequalities that demonstrate a gap between local and nonlocal quantum behaviour. This is useful for the geometric characterisation of the set of nonlocal correlations achievable within quantum theory. Moreover, it provides a systematic way to construct Bell inequalities that are tailored to specific quantum information processing tasks. This characterisation is well understood in the simplest $(2,2,2)$ scenario, namely two parties performing two binary outcome measurements. However, beyond this setting, relatively few Bell inequalities are known, and the situation becomes particularly scarce in scenarios involving a greater number of outcomes. Here, we consider the $(2,2,3)$ scenario, or two parties performing two three-outcome measurements, and characterise all Bell inequalities that can arise from the simplest sum-of-squares decomposition and are maximally violated by the maximally entangled state of local dimension three. We then utilise them to self-test this state, along with a class of three-outcome measurements.
Related papers
- Certifying optimal device-independent quantum randomness in quantum networks [29.495895069435235]
We present a family of multipartite Bell inequalities that allows to certify optimal quantum randomness and self-test GHZ states.<n>Compared with the Mermin-type inequalities, this family of Bell inequality is more efficient in certifying quantum randomness when non-maximal Bell values achieved.
arXiv Detail & Related papers (2026-01-26T14:40:01Z) - Local models and Bell inequalities for the minimal triangle network [78.45663456116702]
Nonlocal correlations enable surprising phenomena in quantum information and quantum foundations.<n>We study one of the simplest scenarios, namely that of distributions invariant under permutations of parties in the minimal triangle network.<n>We provide insights on the existence of a classical-quantum gap in the triangle network with binary outcomes.
arXiv Detail & Related papers (2025-03-20T19:11:06Z) - Deriving three-outcome permutationally invariant Bell inequalities [0.0]
We present strategies to derive Bell inequalities valid for systems composed of many three-level parties.
Our work can have interesting applications in the detection of Bell correlations in paradigmatic spin-1 models, as well as in experiments with solid-state systems or atomic ensembles.
arXiv Detail & Related papers (2024-06-17T17:41:27Z) - A computational test of quantum contextuality, and even simpler proofs of quantumness [43.25018099464869]
We show that an arbitrary contextuality game can be compiled into an operational "test of contextuality" involving a single quantum device.
Our work can be seen as using cryptography to enforce spatial separation within subsystems of a single quantum device.
arXiv Detail & Related papers (2024-05-10T19:30:23Z) - Bell inequalities with overlapping measurements [52.81011822909395]
We study Bell inequalities where measurements of different parties can have overlap.
This allows to accommodate problems in quantum information.
The scenarios considered show an interesting behaviour with respect to Hilbert space dimension, overlap, and symmetry.
arXiv Detail & Related papers (2023-03-03T18:11:05Z) - Bell inequalities for nonlocality depth [0.0]
When three or more particles are considered, quantum correlations can be stronger than correlations generated by so-called hybrid local hidden variable models.
We provide an exhaustive classification of Bell inequalities to characterize various hybrid scenarios in four- and five-particle systems.
arXiv Detail & Related papers (2022-05-09T13:03:03Z) - Proofs of network quantum nonlocality aided by machine learning [68.8204255655161]
We show that the family of quantum triangle distributions of [DOI40103/PhysRevLett.123.140] did not admit triangle-local models in a larger range than the original proof.
We produce a large collection of network Bell inequalities for the triangle scenario with binary outcomes, which are of independent interest.
arXiv Detail & Related papers (2022-03-30T18:00:00Z) - Efficient Bipartite Entanglement Detection Scheme with a Quantum
Adversarial Solver [89.80359585967642]
Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits.
We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
arXiv Detail & Related papers (2022-03-15T09:46:45Z) - An elegant proof of self-testing for multipartite Bell inequalities [0.0]
This work presents a simple and broadly applicable self-testing argument for N-partite correlation Bell inequalities with two binary outcome observables per party.
To showcase the versatility of our proof technique, we obtain self-testing statements for N party Mermin-Ardehali-Bei-Klyshko (MABK) and Werner-Wolf-Weinfurter-.Zukowski-Brukner (WWW.ZB) family of linear Bell inequalities.
arXiv Detail & Related papers (2022-02-14T18:00:50Z) - Generalized Iterative Formula for Bell Inequalities [12.55611325152539]
This work is inspired via a decomposition of $(n+1)$-partite Bell inequalities into $n$-partite ones.
We present a generalized iterative formula to construct nontrivial $(n+1)$-partite ones from the $n$-partite ones.
arXiv Detail & Related papers (2021-09-12T14:02:13Z) - Experimental violations of Leggett-Garg's inequalities on a quantum
computer [77.34726150561087]
We experimentally observe the violations of Leggett-Garg-Bell's inequalities on single and multi-qubit systems.
Our analysis highlights the limits of nowadays quantum platforms, showing that the above-mentioned correlation functions deviate from theoretical prediction as the number of qubits and the depth of the circuit grow.
arXiv Detail & Related papers (2021-09-06T14:35:15Z) - Graph-Theoretic Framework for Self-Testing in Bell Scenarios [37.067444579637076]
Quantum self-testing is the task of certifying quantum states and measurements using the output statistics solely.
We present a new approach for quantum self-testing in Bell non-locality scenarios.
arXiv Detail & Related papers (2021-04-27T08:15:01Z) - Bilocal Bell inequalities violated by the quantum Elegant Joint
Measurement [0.0]
We investigate the simplest network, known as the bilocality scenario.
We report noise-tolerant quantum correlations that elude bilocal variable models.
We pave the way for an experimental realisation by presenting a simple two-qubit quantum circuit.
arXiv Detail & Related papers (2020-06-30T11:32:26Z) - Generalizing optimal Bell inequalities [0.0]
Bell inequalities are central tools for studying nonlocal correlations and their applications in quantum information processing.
We develop a method to characterize Bell inequalities under constraints, which may be given by symmetry or other linear conditions.
This allows to search systematically for generalizations of given Bell inequalities to more parties.
arXiv Detail & Related papers (2020-05-18T13:11:02Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.