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 (26)
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Improved Simulation of Stabilizer Circuits
- Strengths and Weaknesses of Quantum Computing
- Perfect state transfer in quantum spin networks
- On the Power of One Bit of Quantum Information
- Quantum measurements and the Abelian Stabilizer Problem
- The power of quantum systems on a line
- Spin Chains as Perfect Quantum State Mirrors
- Distinguishability and Accessible Information in Quantum Theory
- Instantaneous Quantum Computation
- Fast simulation of stabilizer circuits using a graph state representation
- Globally controlled quantum wires for perfect qubit transport, mirroring and computing
- On entropy growth and the hardness of simulating time evolution
- Reversible quantum cellular automata
- Quantum Circuits with Unbounded Fan-out
- Hamiltonian Quantum Cellular Automata in 1D
- A quantum cellular automaton for universal quantum computation
- Quantum computation via translation-invariant operations on a chain of qubits
- A universally programmable Quantum Cellular Automaton
- 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
- Universal quantum computation with unlabeled qubits
- Programmable Quantum Networks with Pure States
- Hardness of approximating the weight enumerator of a binary linear code
- Quantum Computation and Quadratically Signed Weight Enumerators
Cited by in corpus (5)
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
- From estimation of quantum probabilities to simulation of quantum circuits
- Changing the circuit-depth complexity of measurement-based quantum computation with hypergraph states
- The computational power of normalizer circuits over black-box groups
- Normalizer Circuits and Quantum Computation