Reducing Provers in Distributed Quantum Verification
quant-ph, cs.DC
Submitted: 2026-11-09
Updated: 2026-11-09
Terminology
Sources
- An Optimal Analysis of the Product Test
- On quantum estimation, quantum cloning and finite quantum de Finetti theorems
- Distributed Quantum Algorithms Cannot Color Cycles with Probability 1
- Tight Communication Bounds for Distributed Algorithms in the Quantum Routing Model
- Quantum Advantage for Distributed Symmetry Breaking
- No Distributed Quantum Advantage for 3-Coloring Rooted Trees and 2-Coloring Even Cycles
- Impossibility of One-Way One-Round Quantum 4-Coloring via Matrix-Space Stability
- A classical oracle separation between QMA and QMA(2)
- Exponential Quantum Advantage for Message Complexity in Distributed Algorithms
- Non-trivial lower bound for 3-coloring the ring in the quantum LOCAL model
Related papers
- Computational regimes in matrix-product-state-based quantum trajectory simulations
- Toward chemically accurate quantum simulations on quantum hardware: A quantum-HPC hybrid approach
- Transversal surface-code game with reconfigurable qubits
- Fulqrum: a generalized framework for quantum subspace diagonalization
- Flux-Activated Resonant Control of a Bosonic Quantum Memory
- Machine learning the effects of many quantum measurements