Quantum Hamiltonian Complexity
by S. Gharibian, Y. Huang, Z. Landau, S. W. Shin
Publisher: arXiv 2014
Number of pages: 58
We survey the growing field of Quantum Hamiltonian Complexity, which includes the study of Quantum Constraint Satisfaction. In particular, our aim is to provide a computer science-oriented introduction to the subject in order to help bridge the language barrier between computer scientists and physicists in the field.
Home page url
Download or read it online for free here:
by Valerio Scarani - arXiv
I rapidly review the basic notions of quantum physics and many primitives of quantum information. The second part is devoted to a detailed introduction to the topic of quantum correlations, covering the evidence for failure of alternative theories...
by Salvador E. Venegas-Andraca - arXiv
Quantum walks is an advanced tool for building quantum algorithms that constitute a universal model of quantum computation. In this paper we review theoretical advances on the foundations of both discrete- and continuous-time quantum walks.
by Eleanor G. Rieffel, Wolfgang Polak - arXiv
This paper will guide computer scientists and other non-physicists through the barriers that separate quantum computing from conventional computing. We introduce basics of quantum mechanics to explain where the power of quantum computers comes from.
by Michele Mosca - arXiv
This text surveys the state of the art in quantum computer algorithms, including both black-box and non-black-box results. A representative sample of quantum algorithms is given. This includes a summary of the early quantum algorithms, etc.