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
Handbook of Quantum Information
- Quantiki
An encyclopedia of everything quantum. Sections: Mathematical Structure; Quantum States; Evolution and Operations; Entanglement; Quantum Information Theory; Quantum Discord; Quantum Communication; Quantum Cryptography; Quantum Computation; etc.
(9653 views)
- Quantiki
An encyclopedia of everything quantum. Sections: Mathematical Structure; Quantum States; Evolution and Operations; Entanglement; Quantum Information Theory; Quantum Discord; Quantum Communication; Quantum Cryptography; Quantum Computation; etc.
(9653 views)
A brief introduction of quantum cryptography for engineers
by Bing Qi, Li Qian, Hoi-Kwong Lo - arXiv
We present the principles behind quantum key distribution and discuss a few well-known QKD protocols. We focus more on the implementation of QKD protocols rather than security analysis. Another topic covered here is the security of QKD systems.
(13758 views)
by Bing Qi, Li Qian, Hoi-Kwong Lo - arXiv
We present the principles behind quantum key distribution and discuss a few well-known QKD protocols. We focus more on the implementation of QKD protocols rather than security analysis. Another topic covered here is the security of QKD systems.
(13758 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)
Quantum Information Meets Quantum Matter
by Bei Zeng, et al. - Springer
The draft version of a textbook, introducing the quantum information science viewpoints on condensed matter physics to graduate students. We keep the writing in a self-consistent way, requiring minimum background in quantum information science.
(6735 views)
by Bei Zeng, et al. - Springer
The draft version of a textbook, introducing the quantum information science viewpoints on condensed matter physics to graduate students. We keep the writing in a self-consistent way, requiring minimum background in quantum information science.
(6735 views)