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 Zachary Burell - arXiv
We present a concise but complete conceptual treatment of quantum computing implemented with Cavity Quantum Electrodynamics (CQED). The paper is intended as a brief overview for professionals who are coming over to the field from other areas.
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.
by Emily Grumbling, Mark Horowitz - National Academies Press
Quantum mechanics provides the basis for a new paradigm of computing. First proposed in the 1980s as a way to improve computational modeling of quantum systems, the field of quantum computing has recently garnered significant attention ...
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.