Two convergent NPA-like hierarchies for the quantum bilocal scenario
arXiv:2210.09065 · doi:10.1063/5.0211008
Abstract
Characterising the correlations that arise from locally measuring a single part of a joint quantum system is one of the main problems of quantum information theory. The seminal work [M. Navascués et al., New J. Phys. 10, 073013 (2008)], known as the Navascués-Pironio-Acín (NPA) hierarchy, reformulated this question as a polynomial optimisation problem over noncommutative variables and proposed a convergent hierarchy of necessary conditions, each testable using semidefinite programming. More recently, the problem of characterising the quantum network correlations, which arise when locally measuring several independent quantum systems distributed in a network, has received considerable interest. Several generalisations of the NPA hierarchy, such as the scalar extension [A. Pozas-Kerstjens et al., Phys. Rev. Lett. 123, 140503 (2019)], were introduced while their converging sets remain unknown. In this work, we introduce a new bilocal factorisation NPA hierarchy, prove its equivalence to a modified bilocal scalar extension NPA hierarchy, and characterise its convergence in the case of the simplest network, the bilocal scenario. We further explore its relations with the other known generalisations.
arXiv commentJan. 2026 update: the published version at JMP. 28 pages + appendices, 3 figures
References in corpus (32)
- Bell nonlocality
- Random Numbers Certified by Bell's Theorem
- A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations
- From Bell's Theorem to Secure Quantum Key Distribution
- Fully device independent quantum key distribution
- Free randomness can be amplified
- Self-testing of quantum systems: a review
- Characterizing the nonlocal correlations of particles that never interacted
- Beyond Bell's Theorem: Correlation Scenarios
- Quantum theory based on real numbers can be experimentally falsified
- Genuine quantum nonlocality in the triangle network
- Simple and tight device-independent security proofs
- Theory-independent limits on correlations from generalised Bayesian networks
- Tsirelson's problem and Kirchberg's conjecture
- Convergent relaxations of polynomial optimization problems with non-commuting variables
- The Inflation Technique for Causal Inference with Latent Variables
- Constraints on nonlocality in networks from no-signaling and independence
- Self-testing entangled measurements in quantum networks
- Quantum Cryptography with Imperfect Apparatus
- Towards device-independent information processing on general quantum networks
- Quantum Inflation: A General Approach to Quantum Causal Compatibility
- Bounding the sets of classical and quantum correlations in networks
- Noise-resistant device-independent certification of Bell state measurements
- Quantum networks self-test all entangled states
- The Inflation Technique Completely Solves the Causal Compatibility Problem
- Nonlocality for Generic Networks
- Self-testing of physical theories, or, is quantum theory optimal with respect to some information-processing task?
- Partial self-testing and randomness certification in the triangle network
- A convergent inflation hierarchy for quantum causal structures
- The inflation hierarchy and the polarization hierarchy are complete for the quantum bilocal scenario
- State polynomials: positivity, optimization and nonlinear Bell inequalities
- Outer approximations of classical multi-network correlations