most citedQuantum Hamiltonian Complexity

143 citations · 294 across the 6 of their papers we have counts for

collaborators

6 papers

cs.CE2015★ 23 cited

A domain-level DNA strand displacement reaction enumerator allowing arbitrary non-pseudoknotted secondary structures

Casey Grun, Karthik Sarma, Brian Wolfe +2

DNA strand displacement systems have proven themselves to be fertile substrates for the design of programmable molecular machinery and circuitry. Domain-level reaction enumerators…

cs.CE2014★ 20 cited

Verifying Chemical Reaction Network Implementations: A Pathway Decomposition Approach

Seung Woo Shin, Chris Thachuk, Erik Winfree

Here we focus on the challenge of verifying the correctness of molecular implementations of abstract chemical reaction networks, where operation in a well-mixed "soup" of molecules…

quant-ph2014★ 3 cited

Tensor network non-zero testing

Sevag Gharibian, Zeph Landau, Seung Woo Shin +1

Tensor networks are a central tool in condensed matter physics. In this paper, we study the task of tensor network non-zero testing (TNZ): Given a tensor network T, does T represen…

quant-ph2014★ 16 cited

Comment on "Distinguishing Classical and Quantum Models for the D-Wave Device"

Seung Woo Shin, Graeme Smith, John A. Smolin +1

The SSSV model is a simple classical model that achieves excellent correlation with published experimental data on the D-Wave machine's behavior on random instances of its native p…

quant-ph2014★ 89 cited

How "Quantum" is the D-Wave Machine?

Seung Woo Shin, Graeme Smith, John A. Smolin +1

Recently there has been intense interest in claims about the performance of the D-Wave machine. In this paper, we outline a simple classical model, and show that it achieves excell…

quant-ph2014★ 143 cited

Quantum Hamiltonian Complexity

Sevag Gharibian, Yichen Huang, Zeph Landau +1

Constraint satisfaction problems are a central pillar of modern computational complexity theory. This survey provides an introduction to the rapidly growing field of Quantum Hamilt…