For a complete and up-to-date list of my publications, see my Google Scholar, arXiv, and ORCID profiles. Below is a selection of recent and representative works.
Some recent preprints
Fermionic information theory
Fermions are fundamentally more nonlocal than bosons
With Fatemeh Moradi Kalarde, Sadra Boreiri, Xiangling Xu, Lucas Tendick, Salman Beigi, Paolo Perinotti, and Tommaso Guaita, 2026.
We show that fermions distributed through a quantum network can generate correlations that bosons, distinguishable particles, and qubit-based protocols cannot reproduce without additional communication.
Quantum many-body systems
The bulk spectral gap is semi-decidable: a convergent family of certified upper bounds
With Xiangling Xu, Matthias Schötz, Jie Wang, Victor Magron, Igor Klep, and Omar Fawzi, 2026.
We introduce a convergent hierarchy of certified upper bounds on the bulk spectral gap of quantum many-body systems.
Quantum foundations and causal principles
Coordination requires a common cause in quantum theory
With Daniel Centeno, Antoine Coquet, Maria Ciudad Alañón, Lucas Tendick, and Elie Wolfe, 2026.
We introduce the coordination principle, a multipartite extension of Reichenbach’s common-cause principle, and derive experimentally testable consequences. A companion article, A missing causal principle: Coordination, presents the general results and complete proofs.
Device-independent quantum information and cryptography
Quantitative quantum soundness for all multipartite compiled nonlocal games
With Matilde Baroni, Igor Klep, Dominik Leichtle, Ivan Šupić, Lucas Tendick, and Xiangling Xu, 2025.
We establish quantitative soundness for multipartite compiled nonlocal games through a sequential NPA-like hierarchy.
Selected publications
Distributed quantum computing
Distributed quantum advantage for local problems
Proceedings of the 57th Annual ACM Symposium on Theory of Computing (STOC 2025), pp. 451–462.
We construct the first locally checkable problem exhibiting a superconstant separation between classical and quantum distributed computing.
Online locality meets distributed quantum computing
Proceedings of the 57th Annual ACM Symposium on Theory of Computing (STOC 2025), pp. 1295–1306.
We connect distributed quantum computing with online locality, dynamic graph algorithms, and finitely dependent processes.
No distributed quantum advantage for approximate graph coloring
Proceedings of the 56th Annual ACM Symposium on Theory of Computing (STOC 2024), pp. 1901–1910.
We show that approximate graph coloring does not admit a distributed quantum advantage across a broad range of computational models.
Quantum networks and foundations
Quantum networks self-test all entangled states
Nature Physics 19, 670–675 (2023).
We introduce a network-assisted self-testing framework that can certify any pure multipartite entangled state.
Experimental demonstration that no tripartite-nonlocal causal theory explains nature’s correlations
Physical Review Letters 129, 150402 (2022). Editors’ Suggestion.
This experiment shows that the observed correlations cannot be reproduced by causal theories built exclusively from bipartite nonclassical resources.
Quantum theory based on real numbers can be experimentally falsified
Nature 600, 625–629 (2021).
We show that real and complex quantum theory make different predictions in networks with independently prepared sources, making the distinction experimentally testable.
Genuine quantum nonlocality in the triangle network
Physical Review Letters 123, 140401 (2019).
We identify forms of quantum nonlocality that arise specifically from the network structure and do not reduce to a standard Bell experiment.
Self-testing entangled measurements in quantum networks
Physical Review Letters 121, 250507 (2018).
We develop device-independent methods for certifying entangled measurements in quantum networks.
Quantum many-body systems and optimization
Certifying ground-state properties of quantum many-body systems
Physical Review X 14, 031006 (2024).
We combine variational upper bounds and semidefinite relaxations to obtain rigorous bounds on ground-state observables beyond the energy.
Quantum information and computational assumptions
Nonlocality under computational assumptions
With Khashayar Barooti, Alexandru Gheorghiu, and Grzegorz Głuch.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing (STOC 2024).
We introduce a computational notion of nonlocality and show, under a quantum hardness assumption for Learning With Errors, that every entangled state can produce correlations that cannot be efficiently reproduced using shared randomness.
Review
Bell nonlocality in networks
Reports on Progress in Physics 85, 056001 (2022).
A review of theoretical and experimental developments in quantum nonlocality involving networks with multiple independent sources.