1 citations · 2 across the 5 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
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…