Comment on the paper "Random Quantum Circuits are Approximate 2-designs"

Abstract

In [A.W. Harrow and R.A. Low, Commun. Math. Phys. 291, 257-302 (2009)], it was shown that a quantum circuit composed of random 2-qubit gates converges to an approximate quantum 2-design in polynomial time. We point out and correct a flaw in one of the paper's main arguments. Our alternative argument highlights the role played by transpositions induced by the random gates in achieving convergence.

References in corpus (10)

• Exact and Approximate Unitary 2-Designs: Constructions and Applications
• Evenly distributed unitaries: on the structure of unitary designs
• Quantum Data Hiding
• Randomizing quantum states: Constructions and applications
• Random Quantum Circuits are Approximate 2-designs
• Random Quantum Circuits and Pseudo-Random Operators: Theory and Applications
• Superdense coding of quantum states
• Efficient Generation of Generic Entanglement
• Convergence rates for arbitrary statistical moments of random quantum circuits
• Emergence of typical entanglement in two-party random processes

Cited by in corpus (32)

• A bound on chaos
• Towards the fast scrambling conjecture
• Local random quantum circuits are approximate polynomial-designs
• Approximate unitary $t$-designs by short random quantum circuits using nearest-neighbor and long-range gates
• Quantum chaos in the Brownian SYK model with large finite $N$: OTOCs and tripartite information
• Efficient unitary designs with nearly time-independent Hamiltonian dynamics
• A Random Unitary Circuit Model for Black Hole Evaporation
• Decoupling with unitary approximate two-designs
• Chaos in Classical D0-Brane Mechanics
• Unitary designs from statistical mechanics in random quantum circuits
• Efficient Quantum Pseudorandomness
• Subsystem dynamics under random Hamiltonian evolution
• Quantum circuits for exact unitary $t$-designs and applications to higher-order randomized benchmarking
• Unitary $2$-designs from random $X$- and $Z$-diagonal unitaries
• Generating a state $t$-design by diagonal quantum circuits
• Diagonal quantum circuits: their computational power and applications
• Translation symmetry restoration under random unitary dynamics
• Optimal Universal Quantum Error Correction via Bounded Reference Frames
• Ensembles of physical states and random quantum circuits on graphs
• Stringy effects in scrambling
• Local random quantum circuits are approximate polynomial-designs - numerical results
• Designs via Free Probability
• Automatic quantum circuit encoding of a given arbitrary quantum state
• One-Shot Randomized and Nonrandomized Partial Decoupling
• Decoupling with random diagonal unitaries
• Estimating the randomness of quantum circuit ensembles up to 50 qubits
• Purity of thermal mixed quantum states
• Unitary k-designs from random number-conserving quantum circuits
• Effective field theory of random quantum circuits
• Thermal states of random quantum many-body systems
• Implementation of single-qubit measurement-based t-designs using IBM processors
• Investigating the effect of noise channels on the quality of unitary t-designs