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 B. Aoun, M. Tarifi - arXiv
In this text the authors attempt to provide a useful introduction to quantum cellular automata from a computing perspective. For clarity and accessibility they provide a brief overview of both quantum computing and classical cellular automata.
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 Riley T. Perry
A quantum computing tutorial for everyone, including those who have no background in physics. In quantum computers we exploit quantum effects to compute in ways that are faster or more efficient than, or even impossible, on conventional computers.