1 citations · 1 across the 4 of their papers we have counts for
4 papers
A complexity phase transition at the EPR Hamiltonian
Kunal Marwaha, James Sud
We study the computational complexity of 2-local Hamiltonian problems generated by a positive-weight symmetric interaction term, encompassing many canonical problems in statistical…
Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm
Anuj Apte, Shree Hari Sureshbabu, Ruslan Shaydulin +5
Quantum Approximate Optimization Algorithm (QAOA) is a promising quantum heuristic with empirical evidence of speedup over classical state-of-the-art for some problems. QAOA uses a…
Quantum Approximate Optimization Algorithm in Finite Size and Large Depth and Equivalence to Quantum Annealing
Sami Boulebnane, James Sud, Ruslan Shaydulin +1
The quantum approximate optimization algorithm (QAOA) and quantum annealing are two of the most popular quantum optimization heuristics. While QAOA is known to be able to approxima…
A Quantum Annealing Approach to Reduce Covid-19 Spread on College Campuses
James Sud, Victor Li
Disruptions of university campuses caused by COVID-19 have motivated strategies to prevent the spread of infectious diseases while maintaining some level of in person learning. In…