Quantum Complexity: restrictions on algorithms and architectures
arXiv:1005.1425
Abstract
A dissertation submitted to the University of Bristol in accordance with the requirements of the degree of Doctor of Philosophy (PhD) in the Faculty of Engineering, Department of Computer Science, July 2009.
137 pages, 10 figs.
References in corpus (10)
- The power of quantum systems on a line
- Spin Chains as Perfect Quantum State Mirrors
- Fast simulation of stabilizer circuits using a graph state representation
- On entropy growth and the hardness of simulating time evolution
- Reversible quantum cellular automata
- Hamiltonian Quantum Cellular Automata in 1D
- Quantum Information Processing with Delocalized Qubits under Global Control
- Classical simulation of limited-width cluster-state quantum computation
- The Quantum Fourier Transform and Extensions of the Abelian Hidden Subgroup Problem
- Hardness of approximating the weight enumerator of a binary linear code