2015/11/02 by Peter S. Turner, Damian Markham · 15 citations
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Combinatorics #Computer science #Electronic circuit #Mathematics #Multipartite #Physics #Pseudorandom number generator #Pseudorandomness #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum circuit #Quantum computer #Quantum entanglement #Quantum mechanics #Quantum network #Random number generation #Statistical physics #Stochastic Gradient Optimization Techniques #Theoretical computer science #Topology (electrical circuits) #Unitary state #quant-ph
paper · pdf · doi:10.1103/physrevlett.116.200501
published in Physical Review Letters 116(20), 200501 (American Physical Society)
arxiv created 2015/11/02 · openalex publication_date 2016/05/19 · arxiv updated 2016/05/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
Entangled multipartite states are resources for universal quantum computation, but they can also give rise to ensembles of unitary transformations, a topic usually studied in the context of random quantum circuits. Using several graph state techniques, we show that these resources can "derandomize" circuit results by sampling the same kinds of ensembles quantum mechanically, analogously to a quantum random number generator. Furthermore, we find simple examples that give rise to new ensembles whose statistical moments exactly match those of the uniformly random distribution over all unitaries up to order t, while foregoing adaptive feedforward entirely. Such ensembles-known as t designs-often cannot be distinguished from the "truly" random ensemble, and so they find use in many applications that require this implied notion of pseudorandomness.