activity
20182020
collaborators

5 papers

quant-ph2020

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…

quant-ph2019

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…

quant-ph2019

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…

quant-ph2018

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…

quant-ph2018

Unitary Entanglement Construction in Hierarchical Networks

Aniruddha Bapat, Zachary Eldredge, James R. Garrison +3

The construction of large-scale quantum computers will require modular architectures that allow physical resources to be localized in easy-to-manage packages. In this work, we exam…