arXiv (All)
open access
Impossibility of One-Way One-Round Quantum 4-Coloring via Matrix-Space Stability
We show that one-way one-round quantum LOCAL algorithms cannot $4$-color directed cycles with high probability, even with unbounded local computation and quantum message length. This is the first lower bound in the high-probability quantum LOCAL setting that goes beyond the non-signaling and bounded
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- One-shot Routing in Quantum Networks#1077679
- Finite-blocklength classical communication over the quantum erasure channel with and without classical feedback#1155375
- Multi-Pair Fidelity-Aware Rate Allocation in a Quantum Network: Approximation Schemes#447907
- Generating pairwise entanglement in periodically driven quantum spin chains with stochastic resetting#1076863
- A pretty-tight converse on the classical capacity of generalized amplitude-damping channels#1084561
Record · ID 986694
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive