Corpus ID: 15750932

ROM-based computation: quantum versus classical

@article{Travaglione2002ROMbasedCQ,
  title={ROM-based computation: quantum versus classical},
  author={B. Travaglione and M. Nielsen and H. Wiseman and A. Ambainis},
  journal={Quantum Inf. Comput.},
  year={2002},
  volume={2},
  pages={324-332}
}
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. 
Designing and implementing small quantum circuits and algorithms
  • B. Travaglione
  • Computer Science, Mathematics
  • Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451)
  • 2003
Reducing Quantum Cost of Reversible Circuits for Homogeneous Boolean Functions
  • A. Younes
  • Mathematics, Computer Science
  • J. Circuits Syst. Comput.
  • 2010
Substituting a qubit for an arbitrarily large number of classical bits.
On Computational Power of Quantum Branching Programs
Reversible logic circuit synthesis
Synthesis of reversible logic circuits
...
1
2
...

References

SHOWING 1-10 OF 19 REFERENCES
Two-bit gates are universal for quantum computation.
  • DiVincenzo
  • Physics, Medicine
  • Physical review. A, Atomic, molecular, and optical physics
  • 1995
Quantum information and computation
Algorithms for quantum computation: discrete logarithms and factoring
  • P. Shor
  • Mathematics, Computer Science
  • Proceedings 35th Annual Symposium on Foundations of Computer Science
  • 1994
An algorithmic benchmark for quantum information processing
Elementary gates for quantum computation.
1-way quantum finite automata: strengths, weaknesses and generalizations
  • A. Ambainis, R. Freivalds
  • Computer Science, Physics
  • Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)
  • 1998
Rapid solution of problems by quantum computation
  • D. Deutsch, R. Jozsa
  • Mathematics
  • Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences
  • 1992
Reversible Computing
Space-Bounded Quantum Complexity
  • J. Watrous
  • Computer Science
  • J. Comput. Syst. Sci.
  • 1999
...
1
2
...