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 John Preskill - California Institute of Technology
We will study the properties that distinguish quantum information from classical information. And we will see how these properties can be exploited in the design of quantum algorithms that solve certain problems faster than classical algorithms can.
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 S. M. Girvin - arXiv
These notes will present a brief introduction to the basic theoretical concepts behind the 'second quantum revolution'. They also provide an introduction to 'circuit QED', which offers an architecture for constructing quantum information processors.
by John Watrous - University of Calgary
The focus is on the mathematical theory of quantum information. We will begin with basic principles and methods for reasoning about quantum information, and then move on to a discussion of various results concerning quantum information.