arXiv (All)
open access
Quantum Černý complexity of binary words
We introduce the quantum Černý complexity $\mathrm{qc}(w)$ of a binary word $w$: the least dimension $d$ for which there exist quantum channels $A_0,A_1$ on $d\times d$ density matrices and a start state $ρ_0$ such that $w$ is the unique shortest word whose associated channel is constant on the reac
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
- Microwave Quantum Key Distribution with Cryogenic Microwave Components for Superconducting Quantum Computing#475843
- Quantum hypothesis testing of non-mixed-unitarity: A multifaceted hierarchy of quantum channel discrimination#1154614
- Local autonomous inference machines for quantum LDPC codes#1142434
- Toward the Goldilocks Blind Compression of Quantum States#1156343
- UCQM: A Six-Metric Quality Framework for Continuous-Variable Cluster States#1034829
Record · ID 1154420
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