Fast pseudorandom quantum state generators via inflationary quantum gates
Abstract We propose a mechanism for reaching pseudorandom quantum states, computationally indistinguishable from Haar random, with shallow log-n depth quantum circuits, where n is the number of qudits. We argue that $$\log n$$ log n depth 2-qubit-gate-based generic random quantum circuits that are c...
Main Authors: | Claudio Chamon, Eduardo R. Mucciolo, Andrei E. Ruckenstein, Zhi-Cheng Yang |
---|---|
Format: | Article |
Language: | English |
Published: |
Nature Portfolio
2024-04-01
|
Series: | npj Quantum Information |
Online Access: | https://doi.org/10.1038/s41534-024-00831-y |
Similar Items
-
Fast counting with tensor networks
by: Stefanos Kourtis, Claudio Chamon, Eduardo R. Mucciolo, Andrei E. Ruckenstein
Published: (2019-11-01) -
Efficient Quantum Pseudorandomness
by: Brandão, Fernando G. S. L., et al.
Published: (2018) -
Post-Quantum Verifiable Oblivious Pseudorandom Functions
by: Propson, Helen
Published: (2024) -
A Pseudorandom Number Generator Based on the Chaotic Map and Quantum Random Walks
by: Wenbo Zhao, et al.
Published: (2023-01-01) -
Ultraslow dynamics in a translationally invariant spin model for multiplication and factorization
by: Lei Zhang, et al.
Published: (2019-10-01)