activity
20162026
most citedBeyond Barren Plateaus: Quantum Variational Algorithms Are Swamped With Traps

233 citations · 516 across the 26 of their papers we have counts for

collaborators
Showing 2022 · quant-phShow all

5 papers · 2 filters

quant-ph2022★ 5 cited

SupercheQ: Quantum Advantage for Distributed Databases

E. R. Anschuetz, P. Gokhale, B. Tonekaboni +18

We introduce Supercheq, a family of quantum protocols that achieves asymptotic advantage over classical protocols for checking the equivalence of files, a task also known as finger…

quant-ph2022★ 31 cited

Efficient classical algorithms for simulating symmetric quantum systems

Eric R. Anschuetz, Andreas Bauer, Bobak T. Kiani +1

In light of recently proposed quantum algorithms that incorporate symmetries in the hope of quantum advantage, we show that with symmetries that are restrictive enough, classical a…

quant-ph2022★ 33 cited

Interpretable Quantum Advantage in Neural Sequence Learning

Eric R. Anschuetz, Hong-Ye Hu, Jin-Long Huang +1

Quantum neural networks have been widely studied in recent years, given their potential practical utility and recent results regarding their ability to efficiently express certain…

quant-ph2022

Degeneracy Engineering for Classical and Quantum Annealing: A Case Study of Sparse Linear Regression in Collider Physics

Eric R. Anschuetz, Lena Funcke, Patrick T. Komiske +2

Classical and quantum annealing are computing paradigms that have been proposed to solve a wide range of optimization problems. In this paper, we aim to enhance the performance of…

quant-ph2022★ 233 cited

Beyond Barren Plateaus: Quantum Variational Algorithms Are Swamped With Traps

Eric R. Anschuetz, Bobak T. Kiani

One of the most important properties of classical neural networks is how surprisingly trainable they are, though their training algorithms typically rely on optimizing complicated,…