Formalizes quantum prepare-and-measure scenarios with entanglement and constructs stochastic teleportation protocols achieving exact recovery with two classical bits under super-quantum resources or multi-particle entanglement.
Nayak, Optimal lower bounds for quantum automata and random access codes, in40th Annual Symposium on Foundations of Computer Science (Cat
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Quantum inputs in the prepare-and-measure scenario and stochastic teleportation
Formalizes quantum prepare-and-measure scenarios with entanglement and constructs stochastic teleportation protocols achieving exact recovery with two classical bits under super-quantum resources or multi-particle entanglement.