544 citations · 1.2k across the 20 of their papers we have counts for
6 papers · 1 filter
Learning quantum states prepared by shallow circuits in polynomial time
Zeph Landau, Yunchao Liu
We give a polynomial time algorithm that, given copies of an unknown quantum state that is prepared by an unknown constant depth circuit on a…
Incompressibility and spectral gaps of random circuits
Chi-Fang Chen, Jeongwan Haah, Jonas Haferkamp +3
Random reversible and quantum circuits form random walks on the alternating group and unitary group , respectively. Known bounds on the spectr…
A generalized cycle benchmarking algorithm for characterizing mid-circuit measurements
Zhihan Zhang, Senrui Chen, Yunchao Liu +1
Mid-circuit measurements (MCMs) are crucial ingredients in the development of fault-tolerant quantum computation. While there have been rapid experimental progresses in realizing M…
Quantum computational advantage with constant-temperature Gibbs sampling
Thiago Bergamaschi, Chi-Fang Chen, Yunchao Liu
A quantum system coupled to a bath at some fixed, finite temperature converges to its Gibbs state. This thermalization process defines a natural, physically-motivated model of quan…
Efficient approximate unitary designs from random Pauli rotations
Jeongwan Haah, Yunchao Liu, Xinyu Tan
We construct random walks on simple Lie groups that quickly converge to the Haar measure for all moments up to order . Specifically, a step of the walk on the unitary or orthogn…
Learning shallow quantum circuits
Hsin-Yuan Huang, Yunchao Liu, Michael Broughton +4
Despite fundamental interests in learning quantum circuits, the existence of a computationally efficient algorithm for learning shallow quantum circuits remains an open question. B…