Local random quantum circuits are approximate polynomial-designs - numerical results
arXiv:1212.2556 · doi:10.1088/1751-8113/46/30/305301
Abstract
We numerically investigate the statement that local random quantum circuits acting on n qubits composed of polynomially many nearest neighbour two-qubit gates form an approximate unitary poly(n)-design [F.G.S.L. Brandao et al., arXiv:1208.0692]. Using a group theory formalism, spectral gaps that give a ratio of convergence to a given t-design are evaluated for a different number of qubits n (up to 20) and degrees t (t=2,3,4 and 5), improving previously known results for n=2 in the case of t=2 and 3. Their values lead to a conclusion that the previously used lower bound that bounds spectral gaps values may give very little information about the real situation and in most cases, only tells that a gap is closed. We compare our results to the another lower bounding technique, again showing that its results may not be tight.
arXiv comment9 pages, 6 figures, 1 table, v2: reorganized version, new references added, lenghts of circuts added, submitted to JPA
References in corpus (26)
- An Area Law for One Dimensional Quantum Systems
- Exact and Approximate Unitary 2-Designs: Constructions and Applications
- Scalable Noise Estimation with Random Unitary Operators
- Lieb-Robinson Bounds and the Exponential Clustering Theorem
- 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
- The mother of all protocols: Restructuring quantum information's family tree
- Random Quantum Circuits and Pseudo-Random Operators: Theory and Applications
- Efficient Generation of Generic Entanglement
- Unitary designs and codes
- Convergence Conditions for Random Quantum Circuits
- Convergence rates for arbitrary statistical moments of random quantum circuits
- Convergence to equilibrium under a random Hamiltonian
- Exact convergence times for generation of random bipartite entanglement
- Emergence of typical entanglement in two-party random processes
- The complexity of energy eigenstates as a mechanism for equilibration
- Large Deviation Bounds for k-designs
- Preparing projected entangled pair states on a quantum computer
- Thermalization under randomized local Hamiltonians
- Statistical properties of random matrix product states
- Comment on the paper "Random Quantum Circuits are Approximate 2-designs"
- Efficiency of Producing Random Unitary Matrices with Quantum Circuits
- Phase-random states: ensembles of states with fixed amplitudes and uniformly distributed phases in a fixed basis
- Search for B -> phi pi decays
Cited by in corpus (15)
- Chaos and complexity by design
- Multiqubit Clifford groups are unitary 3-designs
- Random bosonic states for robust quantum metrology
- Unitary designs from statistical mechanics in random quantum circuits
- Efficient Quantum Pseudorandomness
- Efficient unitary designs with a system-size independent number of non-Clifford gates
- Generating a state -design by diagonal quantum circuits
- Fastest local entanglement scrambler, multistage thermalization, and a non-Hermitian phantom
- Diagonal quantum circuits: their computational power and applications
- Improved spectral gaps for random quantum circuits: large local dimensions and all-to-all interactions
- Adaptive compressive tomography: a numerical study
- Observation of entanglement negativity transition of pseudo-random mixed states
- Experimental Implementation of Efficient Quantum Pseudorandomness on a 12-spin System
- Modern compressive tomography for quantum information science
- Thermal states of random quantum many-body systems