Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
On the Power of Quantum Computation
SIAM Journal on Computing
Molecular scale heat engines and scalable quantum computation
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Quantum computation and quantum information
Quantum computation and quantum information
Parallel Quantum Computation and Quantum Codes
SIAM Journal on Computing
Quantum and Stochastic Branching Programs of Bounded Width
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Permutational quantum computing
Quantum Information & Computation
Estimating Jones and Homfly polynomials with one clean qubit
Quantum Information & Computation
Estimating Jones polynomials is a complete problem for one clean qubit
Quantum Information & Computation
| Hi-index | 0.01 |
Device initialization is a difficult challenge in some proposed realizations of quantum computers, and as such, must be treated as a computational resource. The degree of initialization can be quantified by k, the number of clean qubits in the initial state of the register. In this article, we show that unless m∈O(k + log n), oblivious (gate-by-gate) simulation of an ideal m-qubit quantum circuit by an n-qubit circuit with k clean qubits is impossible. Effectively, this indicates that there is no avoiding physical initialization of a quantity of qubits proportional to that required by the best ideal quantum circuit.