activity
20102023
most citedComputing quantum discord is NP-complete

288 citations · 1.7k across the 40 of their papers we have counts for

collaborators
Showing 2014Show all

6 papers · 1 filter

cond-mat.str-el2014★ 6 cited

Two-dimensional local Hamiltonian problem with area laws is QMA-complete

Yichen Huang

We show that the two-dimensional (2D) local Hamiltonian problem with the constraint that the ground state obeys area laws is QMA-complete. We also prove similar results in 2D trans…

cond-mat.str-el2014★ 14 cited

A polynomial-time algorithm for the ground state of one-dimensional gapped Hamiltonians

Yichen Huang

A (deterministic) polynomial-time algorithm is proposed for approximating the ground state of (general) one-dimensional gapped Hamiltonians. Let be the energy gap, the syst…

cond-mat.dis-nn2014★ 60 cited

Excited-state entanglement and thermal mutual information in random spin chains

Yichen Huang, Joel E. Moore

Entanglement properties of excited eigenstates (or of thermal mixed states) are difficult to study with conventional analytical methods. We approach this problem for random spin ch…

cond-mat.str-el2014★ 23 cited

Area law in one dimension: Degenerate ground states and Renyi entanglement entropy

Yichen Huang

An area law is proved for the Renyi entanglement entropy of possibly degenerate ground states in one-dimensional gapped quantum systems. Suppose in a chain of spins the ground…

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…

quant-ph2014★ 66 cited

Quantum circuit complexity of one-dimensional topological phases

Yichen Huang, Xie Chen

Topological quantum states cannot be created from product states with local quantum circuits of constant depth and are in this sense more entangled than topologically trivial state…