155 citations · 285 across the 5 of their papers we have counts for
5 papers
Quantifying the barren plateau phenomenon for a model of unstructured variational ansätze
John Napp
Quantifying the flatness of the objective-function landscape associated with unstructured parameterized quantum circuits is important for understanding the performance of variation…
Efficient classical simulation of random shallow 2D quantum circuits
John Napp, Rolando L. La Placa, Alexander M. Dalzell +2
Random quantum circuits are commonly viewed as hard to simulate classically. In some regimes this has been formally conjectured, and there had been no evidence against the more gen…
Low-depth gradient measurements can improve convergence in variational hybrid quantum-classical algorithms
Aram Harrow, John Napp
A broad class of hybrid quantum-classical algorithms known as "variational algorithms" have been proposed in the context of quantum simulation, machine learning, and combinatorial…
Quantum computation and real multiplication
Matilde Marcolli, John Napp
We propose a construction of anyon systems associated to quantum tori with real multiplication and the embedding of quantum tori in AF algebras. These systems generalize the Fibona…
Optimal Bacon-Shor codes
John Napp, John Preskill
We study the performance of Bacon-Shor codes, quantum subsystem codes which are well suited for applications to fault-tolerant quantum memory because the error syndrome can be extr…