13 citations · 21 across the 6 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
quant-ph2024★ 2 cited
Efficient Sparse State Preparation via Quantum Walks
Alvin Gonzales, Rebekah Herrman, Colin Campbell +4
Continuous-time quantum walks (CTQWs) on dynamic graphs, referred to as dynamic CTQWs, are a recently introduced universal model of computation that offers a new paradigm in which…
quant-ph2024★ 6 cited
Quantum approximate optimization algorithm with random and subgraph phase operators
Anthony Wilkie, Igor Gaidai, James Ostrowski +1
The quantum approximate optimization algorithm (QAOA) is a promising quantum algorithm that can be used to approximately solve combinatorial optimization problems. The usual QAOA a…