12 citations · 14 across the 4 of their papers we have counts for
4 papers · 1 filter
Three Birds with One Stone: Improving Performance, Convergence, and System Throughput with Nest
Yuqian Huo, David Quiroga, Anastasios Kyrillidis +1
Variational quantum algorithms (VQAs) have the potential to demonstrate quantum utility on near-term quantum computers. However, these algorithms often get executed on the highest-…
Quantum EigenGame for excited state calculation
David Quiroga, Jason Han, Anastasios Kyrillidis
Computing the excited states of a given Hamiltonian is computationally hard for large systems, but methods that do so using quantum computers scale tractably. This problem is equiv…
Grover-QAOA for 3-SAT: Quadratic Speedup, Fair-Sampling, and Parameter Clustering
Zewen Zhang, Roger Paredes, Bhuvanesh Sundar +5
The SAT problem is a prototypical NP-complete problem of fundamental importance in computational complexity theory with many applications in science and engineering; as such, it ha…
Using non-convex optimization in quantum process tomography: Factored gradient descent is tough to beat
David A. Quiroga, Anastasios Kyrillidis
We propose a non-convex optimization algorithm, based on the Burer-Monteiro (BM) factorization, for the quantum process tomography problem, in order to estimate a low-rank process…