Demonstrates a task solvable with 12 qubits but requiring 62-382 classical bits of memory, yielding unconditional quantum information supremacy on a trapped-ion processor.
Nayak, Optimal lower bounds for quantum automata and random access codes, in 40th 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
-
Demonstrating an unconditional separation between quantum and classical information resources
Demonstrates a task solvable with 12 qubits but requiring 62-382 classical bits of memory, yielding unconditional quantum information supremacy on a trapped-ion processor.