Random unitary circuits with constant spectral gap
Tim Baer, Jeongwan Haah
Abstract
We prove constant lower bounds for the spectral gap of the following random walks on unitary groups SU(2n) on n qubits. (i) Random Pauli Rotation: choose an n-qubit Pauli operator P and an angle θ∈ R / 2π Z, both uniformly at random, and apply e i θP. (ii) Brickwork Random Unitary Circuit: choose n-1 unitaries Ui uniformly at random from SU(4) independently, and apply U2j-1 on two qubits 2j-1, 2j and then U2j on two qubits 2j, 2j+1. Importantly, the spectral gaps are independent of n and apply for all finite dimensional unitary representations of SU(2n) uniformly, including those that appear in unitary t-designs. We also prove analogous constant gap results for Clifford unitaries, which are indispensable for our result on Brickwork Random Unitary Circuit.
Create a lesson
Related papers
Trading Circuit Depth for Pulse Sparsity in Chromatic Dynamical Decoupling
Amy F. Brown, Daniel A. Lidar
Optimal spectrum estimation
Ainesh Bakshi, Apoorv Vikram Singh, Xinyu Tan
Non-Abelian sheaf quantum LDPC codes: good and magical
Zimu Li, Fuchuan Wei, Zhengyi Han et al.
Learning and interpreting policies for simultaneous entanglement requests in quantum networks
Leon Rode, Sumeet Khatri, Supartha Podder
Sharp universal death of entanglement threshold for Pauli Hamiltonians
Bobak T. Kiani
Proper Agnostic Learning of Matrix Product States and Tree Tensor Networks
Constantin Cedillo Vayson de Pradenne, Jordan Cotler