arXiv subjects

Marc-Olivier Renou

Publications and source records attributed to Marc-Olivier Renou.

At least 19 recordsLinked to original sources

arXiv2026

Quantitative Quantum Soundness for Bipartite Compiled Bell Games via the Sequential NPA Hierarchy

Compiling Bell games under cryptographic assumptions replaces the need for physical separation, allowing nonlocality to be probed with a single untrusted device. While Kalai et al. (STOC'23) showed that this compilation preserves quantum advantages, its quantitative quantum soundness has remained an open problem. We address this gap with two primary contributions. First, we establish the first quantitative quantum soundness bounds for all bipartite compiled Bell games via a newly formalized convergent sequential Navascués-Pironio-Acín (NPA) hierarchy: any polynomial-time prover's score is controlled by a finite-level hierarchy value, and finite-level convergence gives a negligible gap to the commuting quantum value, or to the tensor-product quantum value under flat optimality. Second, we develop the sequential NPA hierarchy as a computational tool of independent interest, establishing its convergence and a stopping criterion based on flatness, and identifying its conic dual as a sparse SOS hierarchy.

quant-ph↗

arXiv2026

The bulk spectral gap is certifiable from above but uncomputable from below

Determining spectral gaps in the thermodynamic limit is a central challenge in quantum many-body physics. When a fixed boundary condition is imposed, this problem is undecidable: no algorithm, even with unlimited resources, can decide for every Hamiltonian whether it is gapped. Yet the thermodynamic limit is meant to capture the intrinsic properties of very large systems, which should not depend on how their boundaries are chosen. Here, we therefore consider the bulk spectral gap problem, which concerns only the intrinsic excitations of the infinite system, independently of any boundary. We first give a general algorithm producing a hierarchy of certified upper bounds on the bulk gap, arbitrarily tight at the cost of more computation. Second, we prove that the spectral gap problem remains undecidable in the bulk: no algorithm can decide whether the bulk gap is positive, already for translationally invariant nearest-neighbour chains of fixed local dimension. The bulk spectral gap is thus certifiable from above but uncomputable from below. More precisely, the bulk-gaplessness promise problem is RE-complete, exactly as hard as the halting problem. The same construction also shows that deciding whether an explicitly given state is a ground state of the infinite system is undecidable. Finally, we apply the upper-bounding algorithm to the spin-1/2 kagome Heisenberg antiferromagnet to produce the first nontrivial certified upper bounds on its bulk gap.

quant-ph↗

arXiv2026

Comment on "Quantum theory based on real numbers cannot be experimentally falsified": On the compatibility of physical principles with information theory for fermions

The manuscript [arXiv:2603.19208] proposes a physically motivated postulate to select the appropriate formulation of quantum theory over real Hilbert spaces, ruling out the theory considered in [Nature 600, 625-629 (2021)] in favour of an alternative theory which reproduces the predictions of standard complex quantum information theory. Here, we argue that, to qualify as a general physical principle, this postulate should also hold in fermionic quantum information theory, the standard framework describing information encoded in the presence or absence of identical fermions. We show, however, that it fails in this framework. More broadly, our result highlights the importance of confronting proposed foundational principles with fermionic quantum information theory, a point that also deserves further examination in recent related works such as [arXiv:2503.17307] and [arXiv:2504.02808].

quant-ph↗

arXiv2026

An operational characterization of finite-dimensional quantum theory

A key goal in the foundations of quantum mechanics is to identify operational constraints characterizing physical theories. Bell inequalities do so for classical probability theory, while Tsirelson's bound provides a first step for quantum mechanics. Here, we address the dual question: Can one certify that all correlations predicted by quantum theory are actually realizable? In this work, we construct a finite number of two-body correlations such that the only probabilistic theory that (1) realizes them, and (2) does so in a way that is stable under iterated teleportation, is quantum theory. For $n$ quantum systems of dimension $d$ each, Condition (1) can be verified using $\operatorname{poly}(d,n)$ measurement settings. Condition (2) may be understood as a hierarchy of tests, one for each number $N$ of teleportation steps. There is thus a sense in which finite-dimensional quantum theory can be self-tested. In particular, one can certify the existence of Bell inequality violations larger than any that have been directly observed.

quant-ph↗

arXiv2026

Self-testing the toric code against classical communication

Device-independent self-testing certifies a multipartite quantum state from the correlations it produces alone, without assumptions on the inner workings of the devices. Most existing self-tests, however, break down as soon as the parties can exchange messages. We consider a relaxed setting in a quantum network, where in the honest version of the protocol, the parties never communicate, yet certification remains sound even in an untrusted case where the untrusted devices secretly exchange classical messages within a bounded distance in the network. We show that the code space of the toric code, distributed over a network with the geometry of a torus, can be self-tested in this setting in a noise-robust way, against communication up to distances proportional to the network diameter. We also develop an algorithmic method for constructing such protocols and extend our results to the surface code and cluster states, robust to one round of nearest-neighbor classical communication

quant-ph↗

arXiv2026

Quantum inflation and source-transfer hierarchies are complete for tree networks

Understanding the capabilities and limits of quantum systems is central to quantum information processing. This includes determining which correlations can arise in networks of quantum systems distributed by independent sources. Yet for general quantum networks, no systematic, dimension-free method is known to bound these correlations arbitrarily well. We resolve this problem for all quantum tree networks through a new source-transfer model, which we prove equivalent to a mixed quantum model. The mixed model places no restriction on dimension and reduces to the standard tensor-product model in finite dimensions; the source-transfer model instead describes these correlations through states on $C^*$-algebras and completely positive maps composed recursively along the tree. We prove the equivalence by reconstructing local measurements as Radon-Nikodym derivatives in the spatial tensor products prescribed by the network. Building on this characterization, we establish two convergent outer hierarchies of semidefinite programs (SDPs): a new source-transfer hierarchy and the inflation-NPA hierarchy. For the source-transfer hierarchy, we extend noncommutative real algebraic geometry to multi-state polynomials with completely positive maps, prove a reconstruction theorem establishing its convergence, and give a sufficient stopping criterion for extracting finite-dimensional realizations. For the inflation-NPA hierarchy, we reconstruct source-transfer realizations from weak-operator limits of averages over source copies produced by quantum inflation. Consequently, the game-value promise problem for quantum tree networks in the mixed model is $\mathsf{coRE}$-complete.

quant-ph↗

arXiv2026

Distributed Quantum Algorithms Cannot Color Cycles with Probability 1

We prove that any distributed quantum algorithm that finds a $3$-coloring with probability $1$ in a cycle of anonymous identical computers has to be global, that is, it needs $Ω(n)$ communication rounds. It follows that quantum computation and communication does not help with this problem. All prior lower bounds on quantum advantage in distributed graph algorithms use arguments related to physical causality. However, it is known that such arguments cannot rule out fast quantum advantage for $3$-coloring cycles. In particular, any causality-based argument would rule out the existence of finitely dependent coloring, but Holroyd and Liggett (2016) showed that such colorings do exist. Hence to tackle this problem, we need a ``genuinely quantum'' lower-bound technique that can distinguish between (1) distributions that do not violate physical causality vs. (2) distributions that can be realized with a quantum strategy. We present the first such lower-bound technique in this context. First, we show that $1$-round quantum algorithms cannot break symmetry with probability $1$. Second, we present a wishful teleportation strategy that can be used to turn $T$-round quantum 3-coloring algorithms into $1$-round quantum algorithms breaking symmetry, while preserving success probability $1$. Put together, the lower bound follows.

cs.DS↗

arXiv2026

Scalable Ground-State Certification of Quantum Spin Systems via Structured Noncommutative Polynomial Optimization

A fundamental challenge in quantum physics is determining the ground-state properties of many-body systems. Whereas standard variational approaches posit a wave-function ansatz and minimize over the possible states expressible by that ansatz, the problem can alternatively be formulated as a noncommutative polynomial optimization problem and treated through a hierarchy of semidefinite programming relaxations. In contrast to variational calculations, these relaxations provide lower bounds on ground-state energies and both lower and upper bounds on observable expectation values. However, this approach typically suffers from severe scalability issues, limiting its applicability to small-to-medium-scale systems. In this article, we demonstrate that systematically leveraging the inherent structures of the system can substantially mitigate these scalability challenges and thus permits computing meaningful bounds for quantum spin systems on square lattices of size up to $16\times16$.

quant-ph↗

arXiv2026

Quantitative quantum soundness for all multipartite compiled nonlocal games

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 providing quantitative upper bounds for all multipartite compiled nonlocal games via a new sequential NPA-like hierarchy. In particular, finite-level convergence yields quantitative quantum soundness with respect to the commuting quantum value, and flat optimality yields the same with respect to the tensor-product quantum value. 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. This NPA-like hierarchy can be seen to complement previous multipartite generalizations of the S-G-HJW purification theorem, which takes a central role in quantum information, nonlocality, and contextuality. 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.

quant-ph↗

arXiv2026

Fermions are fundamentally more nonlocal than Bosons

Bell's theorem shows that entangled quantum particles can exhibit correlations that classical particles cannot reproduce without an additional nonlocal resource, such as communication. In this sense, quantum particles are fundamentally more nonlocal than classical ones, and entanglement becomes unavoidable in physics. Here we prove the analogous result within quantum theory itself: indistinguishable fermions transmitted through a quantum network can generate correlations that distinguishable particles or indistinguishable bosons cannot reproduce without additional communication. In the same sense, fermions are fundamentally more nonlocal than bosons or distinguishable particles, motivating fermionic anticommutation and indistinguishability as unavoidable operational resources. Our result further implies that fermions can strictly surpass all qubit-based protocols for certain distributed computing tasks, demonstrating that a complete understanding of information processing requires going beyond qubits to fermionic information carriers - febits.

quant-ph↗

arXiv2026

Experimental genuine quantum nonlocality in the triangle network

In the last decade, it was understood that quantum networks involving several independent sources of entanglement which are distributed and measured by several parties allowed for completely novel forms of nonclassical quantum correlations, when entangled measurements are performed. Here, we experimentally obtain quantum correlations in a triangle network structure, and provide solid evidence of its nonlocality. Specifically, we first obtain the elegant distribution proposed in (Entropy 21, 325) by performing a six-photon experiment. Then, we justify its nonlocality based on machine learning tools to estimate the distance of the experimentally obtained correlation to the local set, and through the violation of a family of conjectured inequalities tailored for the triangle network.

quant-ph↗

arXiv2026

Coordination Requires a Common Cause in Quantum Theory

We propose a novel causal principle that is a genuinely multipartite extension of Reichenbach's common cause principle, namely, the coordination principle: parties in a network can achieve perfect randomized coordination--in particular, agree on a uniformly random output--only if they all share a common cause. We show that this principle does not follow from the standard no-signaling and independence principles by providing an explicit theory satisfying all these principles while violating the coordination principle. Strikingly, we prove that the coordination principle holds, however, in quantum theory for four parties, and derive noise-tolerant Bell-like inequalities that certify a common cause. We then extend these results to a genuinely quantum coordination task, showing that the four-partite GHZ state requires a quantum common cause which can also be certified by experimentally accessible Bell-like inequalities. A companion paper generalizes these results for N parties, proving that the coordination principle is satisfied in general for quantum theory.

quant-ph↗

arXiv2026

A missing causal principle: Coordination

We introduce the coordination principle, which states that perfect coordination, in the form of agreement on a uniformly random output, among N parties is possible only if they share a common cause. This principle is purely causal and can be viewed as a multipartite generalization of Reichenbach's common cause principle. We prove that quantum information theory satisfy the coordination principle in any network, and derive noise-tolerant Bell-like inequalities that certify the presence of a common cause. We further show that the principle is not a consequence of no-signaling and independence alone by constructing a concrete operational probabilistic theory that obeys both principles while still allowing perfect coordination without a common cause. This possibility arises only in fully general causal scenarios with intermediate transformations between preparations and measurements. We also formulate a genuinely quantum coordination task, showing that the preparation of a multipartite GHZ state requires a quantum common cause, which can be certified by Bell-like inequalities which are experimentally testable. Finally, we discuss the open problem of finding a quantitative, noise-tolerant version of the coordination principle that constrains approximate coordination in any reasonable causal theory. This work is the extended version of the more compact letter and provides all the technical details of the proofs.

quant-ph↗

arXiv2026

Online Locality Meets Distributed Quantum Computing

We connect three distinct lines of research that have recently explored extensions of the classical LOCAL model of distributed computing: A. distributed quantum computing and non-signaling distributions [e.g. STOC 2024], B. finitely-dependent processes [e.g. Forum Math. Pi 2016], and C. locality in online graph algorithms and dynamic graph algorithms [e.g. ICALP 2023]. We prove new results on the capabilities and limitations of all of these models of computing, for locally checkable labeling problems (LCLs). We show that all these settings can be sandwiched between the classical LOCAL model and what we call the randomized online-LOCAL model. Our work implies limitations on the quantum advantage in the distributed setting, and we also exhibit a new barrier for proving tighter bounds. Our main technical results are these: 1. All LCL problems solvable with locality $O(\log^\star n)$ in the classical deterministic LOCAL model admit a finitely-dependent distribution with locality $O(1)$. This answers an open question by Holroyd [2024], and also presents a new barrier for proving bounds on distributed quantum advantage using causality-based arguments. 2. In rooted trees, if we can solve an LCL problem with locality $o(\log \log \log n)$ in the randomized online-LOCAL model (or any of the weaker models, such as quantum-LOCAL), we can solve it with locality $O(\log^\star n)$ in the classical deterministic LOCAL model. One of many implications is that in rooted trees, $O(\log^\star n)$ locality in quantum-LOCAL is not stronger than $O(\log^\star n)$ locality in classical LOCAL.

cs.DC↗

arXiv2026

Two convergent NPA-like hierarchies for the quantum bilocal scenario

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.

quant-ph↗

arXiv2025

The genuinely multipartite nonlocality of graph states is model-dependent

Bell's theorem proves that some quantum state correlations can only be explained by bipartite non-classical resources. The notion of genuinely multipartite nonlocality (GMNL) was later introduced to conceptualize the fact that nonclassical resources involving more than two parties in a nontrivial way may be needed to account for some quantum correlations. In this letter, we first recall the contradictions inherent to the historical definition of GMNL. Second, we turn to one of its redefinitions, called Local-Operations-and-Shared-Randomness GMNL (LOSR-GMNL), proving that all caterpillar graph states (including cluster states) have this second property. Finally, we conceptualize a third, alternative definition, which we call Local-Operations-and-Neighbour-Communication GMNL (LONC-GMNL), that is adapted to situations in which short-range communication between some parties might occur. We show that cluster states do not have this third property, while GHZ states do. Beyond its technical content, our letter illustrates that rigorous conceptual work is needed before applying the concepts of genuinely multipartite nonlocality, genuine multipartite entanglement or entanglement depth to benchmark the nonclassicality of some experimentally-produced quantum system. We note that most experimental works still use witnesses based on the historical definitions of these notions, which fail to reject models based on bipartite resources.

quant-ph↗

arXiv2025

Quantitative Tsirelson's Theorems via Approximate Schur's Lemma and Probabilistic Stampfli's Theorems

Whether an almost-commuting pair of operators must be close to a commuting pair is a central question in operator and matrix theory. We investigate this problem for pairs of $C^*$-subalgebras $\mathcal{A}$ and $\mathcal{B}$ of $M_d(\mathbb{C})$, showing that each operator in $\mathcal{B}$ is $O(d^2ε)$-close in operator norm to an operator in the commutant $\mathcal{A}'$ under two complementary formulations of "$ε$-almost commutation." One formulation is probabilistic, requiring that the operators of $\mathcal{B}$ have small commutators for most Haar-random unitaries acting on $\mathcal{A}$. This first formulation leads to two novel probabilistic generalizations of Stampfli's theorem, which relates an operator's distance from the scalars to the norm of its inner derivation. The second formulation is deterministic, requiring small commutators between the generators of $\mathcal{A}$ and $\mathcal{B}$; we analyze this using an approximate Schur's lemma formulated in terms of Weyl-Heisenberg (clock-and-shift) matrices. As an application of our results to quantum information theory, we obtain a quantitative Tsirelson's theorem: in dimension $d$, every $ε$-almost quantum commuting observable model is well approximated by a quantum tensor-product model with error $O(d^2ε)$.

quant-ph↗

arXiv2024

Distributed Quantum Advantage for Local Problems

We present the first local problem that shows a super-constant separation between the classical randomized LOCAL model of distributed computing and its quantum counterpart. By prior work, such a separation was known only for an artificial graph problem with an inherently global definition [Le Gall et al. 2019]. We present a problem that we call iterated GHZ, which is defined using only local constraints. Formally, it is a family of locally checkable labeling problems [Naor and Stockmeyer 1995]; in particular, solutions can be verified with a constant-round distributed algorithm. We show that in graphs of maximum degree $Δ$, any classical (deterministic or randomized) LOCAL model algorithm will require $Ω(Δ)$ rounds to solve the iterated GHZ problem, while the problem can be solved in $1$ round in quantum-LOCAL. We use the round elimination technique to prove that the iterated GHZ problem requires $Ω(Δ)$ rounds for classical algorithms. This is the first work that shows that round elimination is indeed able to separate the two models, and this also demonstrates that round elimination cannot be used to prove lower bounds for quantum-LOCAL. To apply round elimination, we introduce a new technique that allows us to discover appropriate problem relaxations in a mechanical way; it turns out that this new technique extends beyond the scope of the iterated GHZ problem and can be used to e.g. reproduce prior results on maximal matchings [FOCS 2019, PODC 2020] in a systematic manner.

cs.DC↗