Original title: Distinctness threshold for pseudorandom unitaries
Asad Raza, Jens Eisert, Bill Fefferman · September 2026
Quantum computers rely on operations called unitaries. Researchers often study quantum pseudorandomness, which means operations that look completely random even when they follow strict rules. This comes in two flavors: statistical randomness, like unitary designs, and computational randomness, which fools computers. Scientists used to think building computational pseudorandom unitaries required statistical randomness as a starting ingredient. The researchers wanted to see if that requirement was true. They proved that statistical pseudorandomness is not necessary. Instead of using statistically random layers, they used quantum ensembles that are not even state 1-designs. The key was ensuring the operations are sufficiently distinct, meaning they separate states well enough. This distinct property is actually necessary for any pseudorandom unitary. Their method successfully created new non-adaptively secure pseudorandom unitaries without any statistical randomness. They also showed how this distinctness rule limits properties like quantum coherence and imaginary numbers.
Imagine packing for a trip without a weather forecast. Normally, you'd rely on a forecast, which is statistically random but can be wrong. Instead, you could pack distinct items for every possible condition, so you're always prepared. In this paper, the weather forecast represents statistical pseudorandomness, and having distinct packing options represents distinctness, allowing computational pseudorandomness without statistical randomness.
This clarifies the foundations of quantum randomness, which is crucial for developing secure quantum technologies. It shows computational security in quantum systems can be achieved without relying on statistical randomness, potentially simplifying designs.
The abstract doesn't discuss practical implementations or computational costs, so this is a theoretical contribution. It establishes a mathematical property but doesn't provide specific constructions or test performance in real systems.
Ask anything about this paper. Answers come from its abstract, and say so when the abstract doesn't cover your question.
Distinctness threshold for pseudorandom unitaries — Asad Raza, Jens Eisert, Bill Fefferman
Abstract licence: CC0
Explanation generated by Synthesis from the abstract — it is not the original paper. This is a preprint, so it hasn't necessarily been peer reviewed.