286 citations · 303 across the 17 of their papers we have counts for
7 papers · 1 filter
The Adjoint Is All You Need: Characterizing Barren Plateaus in Quantum Ansätze
Enrico Fontana, Dylan Herman, Shouvanik Chakrabarti +5
Using tools from the representation theory of compact Lie groups, we formulate a theory of Barren Plateaus (BPs) for parameterized quantum circuits whose observables lie in their d…
Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem
Ruslan Shaydulin, Changhao Li, Shouvanik Chakrabarti +26
The quantum approximate optimization algorithm (QAOA) is a leading candidate algorithm for solving optimization problems on quantum computers. However, the potential of QAOA to tac…
Quantum computing for finance
Dylan Herman, Cody Googin, Xiaoyuan Liu +5
Quantum computers are expected to surpass the computational capabilities of classical computers and have a transformative impact on numerous industry sectors. We present a comprehe…
Hardness of the Maximum Independent Set Problem on Unit-Disk Graphs and Prospects for Quantum Speedups
Ruben S. Andrist, Martin J. A. Schuetz, Pierre Minssen +9
Rydberg atom arrays are among the leading contenders for the demonstration of quantum speedups. Motivated by recent experiments with up to 289 qubits [Ebadi et al., Science 376, 12…
Parameter Setting in Quantum Approximate Optimization of Weighted Problems
Shree Hari Sureshbabu, Dylan Herman, Ruslan Shaydulin +4
Quantum Approximate Optimization Algorithm (QAOA) is a leading candidate algorithm for solving combinatorial optimization problems on quantum computers. However, in many cases QAOA…
Alignment between Initial State and Mixer Improves QAOA Performance for Constrained Optimization
Zichang He, Ruslan Shaydulin, Shouvanik Chakrabarti +4
Quantum alternating operator ansatz (QAOA) has a strong connection to the adiabatic algorithm, which it can approximate with sufficient depth. However, it is unclear to what extent…