• Corpus ID: 39781602

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

@article{Huang2015ASE,
  title={A simple efficient algorithm in frustration-free one-dimensional gapped systems},
  author={Yichen Huang},
  journal={arXiv: Strongly Correlated Electrons},
  year={2015}
}
  • Yichen Huang
  • Published 5 October 2015
  • Computer Science
  • arXiv: Strongly Correlated Electrons
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., and thus may be easily accessible to a general audience in the community. We present all the details in two pages. 

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

It is shown that the two-dimensional (2D) local Hamiltonian problem with the constraint that the ground state obeys area laws is QMA-complete, and not all ground states of 2D local Hamiltonians with area laws have efficient classical representations that support efficient computation of local expectation values.

Rigorous RG Algorithms and Area Laws for Low Energy Eigenstates in 1D

A new algorithm is given, based on a rigorously justified RG type transformation, for finding low energy states for 1D Hamiltonians acting on a chain of n particles, which is natural and efficient.

2D Local Hamiltonian with Area Laws Is QMA-Complete

  • Yichen Huang
  • Mathematics
    2020 IEEE International Symposium on Information Theory (ISIT)
  • 2020
The 2D local Hamiltonian problem with the constraint that the ground state obeys area laws is QMA-complete and similar results are proved in 2D translation- invariant systems and for the 3D Heisenberg and Hubbard models with local magnetic fields.

Entanglement Dynamics from Random Product States at Long Times

  • Yichen Huang
  • Physics
    2021 IEEE International Symposium on Information Theory (ISIT)
  • 2021
For any geometrically local Hamiltonian on a lattice, starting from a random product state the entanglement entropy almost never approaches the Page curve.

Approximating local properties by tensor network states with constant bond dimension

In one dimension, it is proved that an area law for the Renyi entanglement entropy with index $\alpha<1$ implies a matrix product state representation with bond dimension $\mathrm{poly}(1/\delta)$.

References

SHOWING 1-9 OF 9 REFERENCES

Improved one-dimensional area law for frustration-free systems

We present a new proof for the 1D area law for frustration-free systems with a constant gap, which exponentially improves the entropy bound in Hastings' 1D area law, and which is tight to within a

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

A polynomial time algorithm that provably finds the ground state of any 1D quantum system described by a gapped local Hamiltonian with constant ground-state energy is developed.

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

A (deterministic) polynomial-time algorithm is proposed for approximating the ground state of (general) one-dimensional gapped Hamiltonians. Let $\epsilon,n,\eta$ be the energy gap, the system size,

Hamiltonian complexity

  • T. Osborne
  • Physics
    Reports on progress in physics. Physical Society
  • 2012
The foundational results, guiding problems, and future directions of this emergent field known as Hamiltonian complexity are reviewed.

Computing the Degenerate Ground Space of Gapped Spin Chains in Polynomial Time

The main new idea is to incorporate the local distinguishability of ground states on the half-chain to ensure that the algorithm returns a complete set of global ground states.

An area law and sub-exponential algorithm for 1D systems

A new proof for the area law for general 1D gapped systems, which exponentially improves Hastings' famous result, and establishes a new, “random-walk like”, bound on the entanglement rank of an arbitrary power of a 1D Hamiltonian.

Quantum Hamiltonian Complexity

This survey provides an introduction to the rapidly growing field of Quantum Hamiltonian Complexity, which includes the study of quantum constraint satisfaction problems, and provides a novel information theoretic presentation of Bravyi's polynomial time algorithm for Quantum 2-SAT.

Local algorithms for 1D quantum systems

    Local algorithms for 1D quantum systems. https://simons.berkeley.edu/talks/ zeph-landau-2015-05-05

    • The slides were posted in mid-October
    • 2015