Random quantum circuits

MPA Fisher, V Khemani, A Nahum… - Annual Review of …, 2023 - annualreviews.org
Quantum circuits—built from local unitary gates and local measurements—are a new
playground for quantum many-body physics and a tractable setting to explore universal …

Avoiding barren plateaus using classical shadows

SH Sack, RA Medina, AA Michailidis, R Kueng… - PRX Quantum, 2022 - APS
Variational quantum algorithms are promising algorithms for achieving quantum advantage
on near-term devices. The quantum hardware is used to implement a variational wave …

Operator spreading in random unitary circuits

A Nahum, S Vijay, J Haah - Physical Review X, 2018 - APS
Random quantum circuits yield minimally structured models for chaotic quantum dynamics,
which are able to capture, for example, universal properties of entanglement growth. We …

Measurement-induced phase transitions in the dynamics of entanglement

B Skinner, J Ruhman, A Nahum - Physical Review X, 2019 - APS
We define dynamical universality classes for many-body systems whose unitary evolution is
punctuated by projective measurements. In cases where such measurements occur …

Characterizing quantum supremacy in near-term devices

S Boixo, SV Isakov, VN Smelyanskiy, R Babbush… - Nature Physics, 2018 - nature.com
A critical question for quantum computing in the near future is whether quantum devices
without error correction can perform a well-defined computational task beyond the …

Quantum entanglement growth under random unitary dynamics

A Nahum, J Ruhman, S Vijay, J Haah - Physical Review X, 2017 - APS
Characterizing how entanglement grows with time in a many-body system, for example, after
a quantum quench, is a key problem in nonequilibrium quantum physics. We study this …

[图书][B] Geometry of quantum states: an introduction to quantum entanglement

I Bengtsson, K Życzkowski - 2017 - books.google.com
Quantum information theory is a branch of science at the frontier of physics, mathematics,
and information science, and offers a variety of solutions that are impossible using classical …

Local random quantum circuits are approximate polynomial-designs

FGSL Brandao, AW Harrow, M Horodecki - … in Mathematical Physics, 2016 - Springer
We prove that local random quantum circuits acting on n qubits composed of O (t 10 n 2)
many nearest neighbor two-qubit gates form an approximate unitary t-design. Previously it …

Efficient classical simulation of random shallow 2D quantum circuits

JC Napp, RL La Placa, AM Dalzell, FGSL Brandao… - Physical Review X, 2022 - APS
A central question of quantum computing is determining the source of the advantage of
quantum computation over classical computation. Even though simulating quantum …

Random quantum circuits are approximate 2-designs

AW Harrow, RA Low - Communications in Mathematical Physics, 2009 - Springer
Given a universal gate set on two qubits, it is well known that applying random gates from
the set to random pairs of qubits will eventually yield an approximately Haar-distributed …