Two constructions yield strong unitary k-designs and pseudorandom unitaries on D-dimensional grids with provably optimal depth.
arXiv preprint arXiv:2103.09320 , year=
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2verdicts
UNVERDICTED 2representative citing papers
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.
citing papers explorer
-
Arts & crafts: Strong random unitaries and geometric locality
Two constructions yield strong unitary k-designs and pseudorandom unitaries on D-dimensional grids with provably optimal depth.
-
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.