Quantum Hamiltonian Complexity
by S. Gharibian, Y. Huang, Z. Landau, S. W. Shin
Publisher: arXiv 2014
Number of pages: 58
Description:
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.
Download or read it online for free here:
Download link
(1.3MB, PDF)
Similar books
An Introduction to Many Worlds in Quantum Computation
by Clare Hewitt-Horsman - arXiv
This paper introduces one interpretation of quantum mechanics, a modern 'many-worlds' theory, from the perspective of quantum computation. Reasons for seeking to interpret quantum mechanics are discussed, then the specific theory is introduced.
(14591 views)
by Clare Hewitt-Horsman - arXiv
This paper introduces one interpretation of quantum mechanics, a modern 'many-worlds' theory, from the perspective of quantum computation. Reasons for seeking to interpret quantum mechanics are discussed, then the specific theory is introduced.
(14591 views)
Theory of Quantum Information
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.
(11552 views)
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.
(11552 views)
Quantum Information and Computation
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.
(8747 views)
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.
(8747 views)
Superconducting Qubits and Circuits
by Steven M. Girvin - Yale University
These lectures are devoted to understanding the basic components of quantum machines that can be constructed from superconducting electrical circuits. These circuits can be used to create resonators which store individual microwave photons.
(7385 views)
by Steven M. Girvin - Yale University
These lectures are devoted to understanding the basic components of quantum machines that can be constructed from superconducting electrical circuits. These circuits can be used to create resonators which store individual microwave photons.
(7385 views)