activity
20232025
most citedOn the approximability of random-hypergraph MAX-3-XORSAT problems with quantum algorithms

1 citations · 2 across the 5 of their papers we have counts for

collaborators

5 papers

quant-ph2025

Classical Thermometry of Quantum Annealers

George Grattan, Pratik Sathe, Cristiano Nisoli

Quantum annealers are emerging as programmable, dynamical experimental platforms for probing strongly correlated spin systems. Yet key thermal assumptions, chiefly a Gibbs-distribu…

quant-ph2024

Iterative quantum optimization of spin glass problems with rapidly oscillating transverse fields

Brandon Barton, Jacob Sagal, Sean Feeney +5

In this work, we introduce a new iterative quantum algorithm, called Iterative Symphonic Tunneling for Satisfiability problems (IST-SAT), which solves quantum spin glass optimizati…

quant-ph2024

Characterization and thermometry of dissapatively stabilized steady states

George Grattan, Alek M. Liguori-Schremp, David. Rodríguez Pérez +3

In this work we study the properties of dissipatively stabilized steady states of noisy quantum algorithms, exploring the extent to which they can be well approximated as thermal d…

quant-ph2023★ 1 cited

On the approximability of random-hypergraph MAX-3-XORSAT problems with quantum algorithms

Eliot Kapit, Brandon A. Barton, Sean Feeney +5

A canonical feature of the constraint satisfaction problems in NP is approximation hardness, where in the worst case, finding sufficient-quality approximate solutions is exponentia…

cond-mat.str-el2023★ 1 cited

Exponential acceleration of macroscopic quantum tunneling in a Floquet Ising model

George Grattan, Brandon A. Barton, Sean Feeney +6

The exponential suppression of macroscopic quantum tunneling (MQT) in the number of elements to be reconfigured is an essential element of broken symmetry phases. This suppression…