A Quantum Analogue of the Covering Lemma: Limits of Exact Anonymous Computation
quant-ph, cs.DC, cs.DM
Submitted: 2026-10-11
Updated: 2026-10-11
Sources
- Dining Philosophers, Leader Election and Ring Size problems, in the quantum setting
- No distributed quantum advantage for approximate graph coloring
- Matrix Product State Representations
- A quantum walk-based scheme for distributed searching on arbitrary graphs
- A quantum walk inspired model for distributed computing on arbitrary graphs
- A Fast Exact Quantum Algorithm for Solitude Verification
- Exact Quantum Algorithms for the Leader Election Problem
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- A quasiparticle-protected superconducting qubit
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians