Optimal lower bounds for quantum automata and random access codes

DOI10.1109/SFFCS.1999.814608MaRDI QIDQ7238300zbMATH OpenFDO

Authors Ashwin Nayak

Publication date 6 May 2026

Full work available at URL https://doi.org/10.1109/SFFCS.1999.814608

Mathematics Subject Classification ID

Graph theory (05Cxx) Data structures (68P05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Formal languages and automata (68Q45) Discrete mathematics in relation to computer science (68Rxx) Nonnumerical algorithms (68W05) Quantum computation (81P68)

Cited in

(1)

• Consumable data via quantum communication

This page was built for publication: Optimal lower bounds for quantum automata and random access codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7238300)