output
20192026
most citedInformation Scrambling in Computationally Complex Quantum Circuits

304 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions
Showing 2022 · quant-phShow all

3 papers · 2 filters

quant-ph2022★ 18 cited

Lower Bounds on Quantum Annealing Times

Luis Pedro García-Pintos, Lucas T. Brady, Jacob Bringewatt +1

The adiabatic theorem provides sufficient conditions for the time needed to prepare a target ground state. While it is possible to prepare a target state much faster with more gene…

quant-ph2022★ 33 cited

Real-Time Krylov Theory for Quantum Computing Algorithms

Yizhi Shen, Katherine Klymko, James Sud +3

Quantum computers provide new avenues to access ground and excited state properties of systems otherwise difficult to simulate on classical hardware. New approaches using subspaces…

quant-ph2022★ 2 cited

Simultaneous Stoquasticity

Jacob Bringewatt, Lucas T. Brady

Stoquastic Hamiltonians play a role in the computational complexity of the local Hamiltonian problem as well as the study of classical simulability. In particular, stoquastic Hamil…