Depth-1 distinctness for pseudorandom unitaries

Lineage and corrections

This event attributed to Bill Fefferman

Depth-1 distinctness for pseudorandom unitaries parent of this event

This event attributed to ChatGPT 5.6 Sol

Depth-1 distinctness for pseudorandom unitaries evidence for this event

This event attributed to Asad Raza

VibeMathed record: Depth-1 distinctness for pseudorandom unitaries evidence for this event

The paper proves that a tensor-product ensemble of independently chosen single-qubit Clifford gates is $\operatorname{negl}(n)$-distinct when the number of queries is polynomial in $n$. This disproves the authors' conjecture that negligibly distinct ensembles must necessarily be entangling. As an application, the depth-$\log n$ global Clifford/unitary-$2$-design layer used in the $PFC$ pseudorandom-unitary construction can be replaced by a single depth-1 layer of local single-qubit $2$-designs while preserving the required distinctness property. parent of this event

This event attributed to Jens Eisert