4 citations · 4 across the 1 of their papers we have counts for
7 papers · 1 filter
Behavior of Analog Quantum Algorithms
Lucas T. Brady, Lucas Kocia, Przemyslaw Bienias +3
Analog quantum algorithms are formulated in terms of Hamiltonians rather than unitary gates and include quantum adiabatic computing, quantum annealing, and the quantum approximate…
Quantum routing with fast reversals
Aniruddha Bapat, Andrew M. Childs, Alexey V. Gorshkov +3
We present methods for implementing arbitrary permutations of qubits under interaction constraints. Our protocols make use of previous methods for rapidly reversing the order of qu…
Optimal Protocols in Quantum Annealing and QAOA Problems
Lucas T. Brady, Christopher L. Baldwin, Aniruddha Bapat +2
Quantum Annealing (QA) and the Quantum Approximate Optimization Algorithm (QAOA) are two special cases of the following control problem: apply a combination of two Hamiltonians to…
Entanglement bounds on the performance of quantum computing architectures
Zachary Eldredge, Leo Zhou, Aniruddha Bapat +4
There are many possible architectures of qubit connectivity that designers of future quantum computers will need to choose between. However, the process of evaluating a particular…
Quantum Approximate Optimization of the Long-Range Ising Model with a Trapped-Ion Quantum Simulator
G. Pagano, A. Bapat, P. Becker +13
Quantum computers and simulators may offer significant advantages over their classical counterparts, providing insights into quantum many-body systems and possibly improving perfor…
Bang-bang control as a design principle for classical and quantum optimization algorithms
Aniruddha Bapat, Stephen Jordan
Physically motivated classical heuristic optimization algorithms such as simulated annealing (SA) treat the objective function as an energy landscape, and allow walkers to escape l…