Quantitative quantum soundness for all multipartite compiled nonlocal games

• URL: http://arxiv.org/abs/2509.25145v1
• Date: Mon, 29 Sep 2025 17:51:57 GMT
• Title: Quantitative quantum soundness for all multipartite compiled nonlocal games
• Authors: Matilde Baroni, Igor Klep, Dominik Leichtle, Marc-Olivier Renou, Ivan Šupić, Lucas Tendick, Xiangling Xu,
• Abstract summary: We show the quantitative quantum soundness of the KLVY compiler for all multipartite nonlocal games.<n>We introduce an NPA-like hierarchy for quantum instruments and prove its completeness.
• Score: 1.1140384738063094
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Compiled nonlocal games transfer the power of Bell-type multi-prover tests into a single-device setting by replacing spatial separation with cryptography. Concretely, the KLVY compiler (STOC'23) maps any multi-prover game to an interactive single-prover protocol, using quantum homomorphic encryption. A crucial security property of such compilers is quantum soundness, which ensures that a dishonest quantum prover cannot exceed the original game's quantum value. For practical cryptographic implementations, this soundness must be quantitative, providing concrete bounds, rather than merely asymptotic. While quantitative quantum soundness has been established for the KLVY compiler in the bipartite case, it has only been shown asymptotically for multipartite games. This is a significant gap, as multipartite nonlocality exhibits phenomena with no bipartite analogue, and the difficulty of enforcing space-like separation makes single-device compilation especially compelling. This work closes this gap by showing the quantitative quantum soundness of the KLVY compiler for all multipartite nonlocal games. On the way, we introduce an NPA-like hierarchy for quantum instruments and prove its completeness, thereby characterizing correlations from operationally-non-signaling sequential strategies. We further develop novel geometric arguments for the decomposition of sequential strategies into their signaling and non-signaling parts, which might be of independent interest.

Related papers

• Composable simultaneous purification: when all communication scenarios reduce to spatial correlations [1.4788776577018314]
  Non-signalling state assemblages can always be simultaneously purified.<n>We extend this simultaneous purification inspired result to all multipartite communication schemes.<n>Our main contribution is to establish that arbitrary compositions of non-signalling assemblages cannot escape the standard spatial quantum Bell correlations set.
  arXiv  Detail & Related papers  (2026-01-08T17:48:56Z)
• Quantitative Quantum Soundness for Bipartite Compiled Bell Games via the Sequential NPA Hierarchy [3.34301287453961]
  We show the first quantitative quantum soundness bounds for every bipartite compiled Bell game.<n>More generally, for all bipartite games we show that the compiled score cannot significantly exceed the bounds given by a newly formalized sequential Navascu'es-Pironio-Ac'in hierarchy.
  arXiv  Detail & Related papers  (2025-07-22T20:31:41Z)
• Bounding the asymptotic quantum value of all multipartite compiled non-local games [0.0]
  Non-local games are a powerful tool to distinguish between correlations possible in classical and quantum worlds.<n> Kalai et al. (STOC'23) proposed a compiler that converts multipartite non-local games into interactive protocols with a single prover.<n>We prove Kalai et al.'s compiler indeed achieves quantum soundness for all multipartite non-local games.
  arXiv  Detail & Related papers  (2025-07-16T16:58:39Z)
• A bound on the quantum value of all compiled nonlocal games [49.32403970784162]
  A cryptographic compiler converts any nonlocal game into an interactive protocol with a single computationally bounded prover.<n>We establish a quantum soundness result for all compiled two-player nonlocal games.
  arXiv  Detail & Related papers  (2024-08-13T08:11:56Z)
• Heralded nonlocal quantum gates for distributed quantum computation in a decoherence-free subspace [4.513705164435675]
  We propose a heralded protocol for implementing nontrivial quantum gates on two stationary qubits coupled to spatially separated cavities. By dynamically controlling the evolution of the composite system, nonlocal two-qubit quantum gates can be achieved without real excitations of either cavity modes or atoms.
  arXiv  Detail & Related papers  (2023-05-01T03:19:07Z)
• 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)
• Entanglement catalysis for quantum states and noisy channels [41.94295877935867]
  We investigate properties of entanglement and its role for quantum communication. For transformations between bipartite pure states, we prove the existence of a universal catalyst. We further develop methods to estimate the number of singlets which can be established via a noisy quantum channel.
  arXiv  Detail & Related papers  (2022-02-10T18:36:25Z)
• Depth-efficient proofs of quantumness [77.34726150561087]
  A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover. In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
  arXiv  Detail & Related papers  (2021-07-05T17:45:41Z)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• Transmon platform for quantum computing challenged by chaotic fluctuations [55.41644538483948]
  We investigate the stability of a variant of a many-body localized (MBL) phase for system parameters relevant to current quantum processors. We find that these computing platforms are dangerously close to a phase of uncontrollable chaotic fluctuations.
  arXiv  Detail & Related papers  (2020-12-10T19:00:03Z)
• Heterogeneous Multipartite Entanglement Purification for Size-Constrained Quantum Devices [68.8204255655161]
  Purifying entanglement resources after their imperfect generation is an indispensable step towards using them in quantum architectures. Here we depart from the typical purification paradigm for multipartite states explored in the last twenty years. We find that smaller sacrificial' states, like Bell pairs, can be more useful in the purification of multipartite states than additional copies of these same states.
  arXiv  Detail & Related papers  (2020-11-23T19:00:00Z)

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.