**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.

(

**11013**views)

**Quantum Computation**

by

**John Watrous**-

**University of Calgary**

Topics: Quantum information; Superdense coding, quantum circuits, and partial measurements; Quantum Teleportation; Searching algorithms; Simon's algorithm; Phase estimation; Order finding; Grover's Algorithm; Quantum error correction; etc.

(

**6074**views)

**The Functional Analysis of Quantum Information Theory**

by

**Ved Prakash Gupta, Prabha Mandayam, V. S. Sunder**-

**arXiv**

This book is a compilation of notes from a two-week international workshop on the 'Functional Analysis of Quantum Information Theory'. Contents: Operator Spaces; Entanglement in Bipartite Quantum States; Operator Systems; Quantum Information Theory.

(

**3960**views)

**Quantum Walks: A Comprehensive Review**

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.

(

**6742**views)