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 Samuel J. Lomonaco, jr - arXiv
These notes provide readers, who have some mathematical background but little exposure to quantum mechanics and quantum computation, with enough material to begin reading the research literature in quantum computation and quantum information theory.
by Man-Hong Yung, et al. - arXiv
The text focuses on applications of quantum computation to problems of interest in physics and chemistry. The authors describe quantum simulation algorithms that have been developed for electronic-structure problems, thermal-state preparation, etc.
by N. Gisin, G. Ribordy, W. Tittel, H. Zbinden - arXiv
Quantum cryptography could well be the first application of quantum mechanics at the individual quanta level. The fast progress in theory and experiments over the recent years are reviewed, with emphasis on open questions and technological issues.
by Artur Ekert, Patrick Hayden, Hitoshi Inamori - arXiv
Contents: Qubits, gates and networks; Quantum arithmetic and function evaluations; Algorithms and their complexity; From interferometers to computers; The first quantum algorithms; Quantum search; Optimal phase estimation; and more.