• Mathematics
  • Published 2015

Hamiltonian Complexity and QMA-Completeness

@inproceedings{Pallister2015HamiltonianCA,
  title={Hamiltonian Complexity and QMA-Completeness},
  author={Sam Pallister},
  year={2015}
}
One of the cornerstone results in computational complexity theory is the Cook-Levin Theorem [1]: the theorem that establishes that Boolean satisfiability problems are NP-complete. A Boolean satisfiability problem (SAT) asks the following question: given a set of clauses built from literals (variables that take values “TRUE” and “FALSE”), Boolean operators and parentheses, does there exist an assignment of values for the literals such that all clauses evaluate to TRUE? The Cook-Levin theorem… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 19 REFERENCES

The complexity of satisfiability problems

T. J. Schaefer
  • Proceedings of the tenth annual ACM symposium on Theory of computing - STOC ’78, (New York, New York, USA), pp. 216– 226, ACM Press, May 1978.
  • 1978
VIEW 14 EXCERPTS
HIGHLY INFLUENTIAL

Monte Carlo simulation of stoquastic Hamiltonians

  • Quantum Information & Computation
  • 2014
VIEW 2 EXCERPTS

Computational Complexity in Electronic Structure

  • Physical chemistry chemical physics : PCCP
  • 2012
VIEW 2 EXCERPTS