Estimating the randomness of quantum circuit ensembles up to 50 qubits
arXiv:2205.09900 · doi:10.1038/s41534-022-00648-7
Abstract
Random quantum circuits have been utilized in the contexts of quantum supremacy demonstrations, variational quantum algorithms for chemistry and machine learning, and blackhole information. The ability of random circuits to approximate any random unitaries has consequences on their complexity, expressibility, and trainability. To study this property of random circuits, we develop numerical protocols for estimating the frame potential, the distance between a given ensemble and the exact randomness. Our tensor-network-based algorithm has polynomial complexity for shallow circuits and is high-performing using CPU and GPU parallelism. We study 1. local and parallel random circuits to verify the linear growth in complexity as stated by the Brown-Susskind conjecture, and; 2. hardware-efficient ansätze to shed light on its expressibility and the barren plateau problem in the context of variational algorithms. Our work shows that large-scale tensor network simulations could provide important hints toward open problems in quantum information science.
arXiv comment11 pages, many figures
References in corpus (59)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Quantum Machine Learning
- A variational eigenvalue solver on a quantum processor
- Variational Quantum Algorithms
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Supervised learning with quantum enhanced feature spaces
- Quantum computational advantage using photons
- Barren plateaus in quantum neural network training landscapes
- The theory of variational hybrid quantum-classical algorithms
- Quantum machine learning in feature Hilbert spaces
- Black holes as mirrors: quantum information in random subsystems
- Characterizing Quantum Supremacy in Near-Term Devices
- Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms
- Connecting ansatz expressibility to gradient magnitudes and barren plateaus
- Tensor networks for complex quantum systems
- A rigorous and robust quantum speed-up in supervised machine learning
- Qudits and high-dimensional quantum computing
- Chaos and complexity by design
- Quantum Optimization of Maximum Independent Set using Rydberg Atom Arrays
- A class of ansatz wave functions for 1D spin systems and their relation to DMRG
- Towards the fast scrambling conjecture
- Entanglement and the Power of One Qubit
- Evenly distributed unitaries: on the structure of unitary designs
- Random Quantum Circuits are Approximate 2-designs
- Local random quantum circuits are approximate polynomial-designs
- The Second Law of Quantum Complexity
- Chaos, Complexity, and Random Matrices
- Quantum Computer Systems for Scientific Discovery
- Quantum Computation vs. Firewalls
- Quantum circuit architecture search for variational quantum algorithms
- Linear growth of quantum circuit complexity
- Pseudorandom States, Non-Cloning Theorems and Quantum Money
- Models of quantum complexity growth
- Spectral form factors and late time quantum chaos
- Expressibility of the alternating layered ansatz for quantum computation
- Efficient classical simulation of noisy random quantum circuits in one dimension
- Decoupling with random quantum circuits
- Tunable Efficient Unitary Neural Networks (EUNN) and their application to RNNs
- Layer VQE: A Variational Approach for Combinatorial Optimization on Noisy Quantum Computers
- Classical Simulation of Quantum Supremacy Circuits
- Quantum simulation with hybrid tensor networks
- Representation Learning via Quantum Neural Tangent Kernels
- Quantum Physical Unclonable Functions: Possibilities and Impossibilities
- Collisions of false-vacuum bubble walls in a quantum spin chain
- Unitary designs from statistical mechanics in random quantum circuits
- Efficient Quantum Pseudorandomness
- Mixing properties of stochastic quantum Hamiltonians
- Classical simulation of lossy boson sampling using matrix product operators
- Simulating the Sycamore quantum supremacy circuits
- Comment on the paper "Random Quantum Circuits are Approximate 2-designs"
- An adaptive algorithm for quantum circuit simulation
- Scrambling and decoding the charged quantum information
- Tensor Network Quantum Simulator With Step-Dependent Parallelization
- Theoretical framework for physical unclonable functions, including quantum readout
- Performance Evaluation and Acceleration of the QTensor Quantum Circuit Simulator on GPUs
- Embedding Learning in Hybrid Quantum-Classical Neural Networks
- Efficient Construction of Quantum Physical Unclonable Functions with Unitary t-designs
- Cryptography from Pseudorandom Quantum States
Cited by in corpus (5)
- Feedback-driven quantum reservoir computing for time-series analysis
- Exploring Shallow-Depth Boson Sampling: Towards Scalable Quantum Supremacy
- Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement
- Benchmarking a boson sampler with Hamming nets
- Benchmarking the performance of a high-Q cavity qudit using random unitaries