129 citations · 145 across the 6 of their papers we have counts for
8 papers
Renormalization group approach to satisfiability
S. N. Coppersmith
Satisfiability is a classic problem in computational complexity theory, in which one wishes to determine whether an assignment of values to a collection of Boolean variables exists…
Electron spin coherence in Si/SiGe quantum wells
J. L. Truitt, K. A. Slinker, K. L. M. Lewis +11
The mechanisms limiting the spin coherence time of electrons are of great importance for spintronics. We present electron spin resonance (ESR) and transport measurements of six dif…
Exchange in a silicon-based quantum dot quantum computer architecture
S. N. Coppersmith, Seungwon Lee, Paul von Allmen
In bulk silicon, intervalley electronic interference has been shown to lead to strong oscillations in the exchange coupling between impurity electronic wavefunctions, posing a seri…
Physically-motivated dynamical algorithms for the graph isomorphism problem
Shiue-yuan Shiau, Robert Joynt, S. N. Coppersmith
We investigate classical and quantum physics-based algorithms for solving the graph isomorphism problem. Our work integrates and extends previous work by Gudkov et al. (cond-mat/02…
Performance Limitations of Flat Histogram Methods and Optimality of Wang-Landau Sampling
P. Dayal, S. Trebst, S. Wessel +4
We determine the optimal scaling of local-update flat-histogram methods with system size by using a perfect flat-histogram scheme based on the exact density of states of 2D Ising m…
Dynamics of a Complex Quantum Magnet
J. W. Landry, S. N. Coppersmith
We have computed the low energy quantum states and low frequency dynamical susceptibility of complex quantum spin systems in the limit of strong interactions, obtaining exact resul…