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 cond-mat.str-elShow all

7 papers · 1 filter

cond-mat.str-el2020★ 2 cited

Computing local properties in the trivial phase

Yichen Huang

A translation-invariant gapped local Hamiltonian is in the trivial phase if it can be connected to a completely decoupled Hamiltonian with a smooth path of translation-invariant ga…

cond-mat.str-el2015★ 5 cited

A simple efficient algorithm in frustration-free one-dimensional gapped systems

Yichen Huang

We propose an efficient algorithm for the ground state of frustration-free one-dimensional gapped Hamiltonians. This algorithm is much simpler than the original one by Landau et al…

cond-mat.str-el2015★ 15 cited

Computing energy density in one dimension

Yichen Huang

We study the problem of computing energy density in one-dimensional quantum systems. We show that the ground-state energy per site or per bond can be computed in time (i) independe…

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.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…