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
Space-bounded Quantum complexity
Journal of Computer and System Sciences
Proceedings of the 7th Colloquium on Automata, Languages and Programming
1-way quantum finite automata: strengths, weaknesses and generalizations
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Algorithms for quantum computation: discrete logarithms and factoring
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Irreversibility and heat generation in the computing process
IBM Journal of Research and Development
Quantum Computation and Quantum Information: 10th Anniversary Edition
Quantum Computation and Quantum Information: 10th Anniversary Edition
Designing and implementing small quantum circuits and algorithms
Proceedings of the 40th annual Design Automation Conference
Asymptotically optimal circuits for arbitrary n-qubit diagonal comutations
Quantum Information & Computation
Hi-index | 0.01 |
We introduce a model of computation based on read only memory (ROM), which allows us to compare the space-efficiency of reversible, error-free classical computation with reversible, error-free quantum computation. We show that a ROM-based quantum computer with one writable qubit is universal, whilst two writable bits are required for a universal classical ROM-based computer. We also comment on the time-efficiency advantages of quantum computation within this model.