15 papers
Distributed Quantum Algorithms Cannot Color Cycles with Probability 1
Xavier Coiteux-Roy, Maxime Flin, Carlos de Gois +3
We prove that any distributed quantum algorithm that finds a -coloring with probability in a cycle of anonymous identical computers has to be global, that is, it needs $Ω(n)…
Quantitative quantum soundness for all multipartite compiled nonlocal games
Matilde Baroni, Igor Klep, Dominik Leichtle +4
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 comp…
Quantitative Quantum Soundness for Bipartite Compiled Bell Games via the Sequential NPA Hierarchy
Igor Klep, Connor Paddock, Marc-Olivier Renou +4
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.…
Fermions are fundamentally more nonlocal than Bosons
Fatemeh Moradi Kalarde, Sadra Boreiri, Xiangling Xu +5
Bell's theorem shows that entangled quantum particles can exhibit correlations that classical particles cannot reproduce without an additional nonlocal resource, such as communicat…
The bulk spectral gap is semi-decidable: a convergent family of certified upper bounds
Xiangling Xu, Matthias Schötz, Jie Wang +4
Determining spectral gaps in the thermodynamic limit is a central challenge in quantum many-body physics. Existing rigorous methods are largely limited to special settings, while v…
Experimental genuine quantum nonlocality in the triangle network
Ning-Ning Wang, Chao Zhang, Huan Cao +8
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…