Natural Computing

, Volume 11, Issue 1, pp 81–94

Quantum computation with write-only memory

  • Abuzer Yakaryılmaz
  • Rūsiņš Freivalds
  • A. C. Cem Say
  • Ruben Agadzanyan
Article

DOI: 10.1007/s11047-011-9270-0

Cite this article as:
Yakaryılmaz, A., Freivalds, R., Say, A.C.C. et al. Nat Comput (2012) 11: 81. doi:10.1007/s11047-011-9270-0

Abstract

In classical computation, a “write-only memory” (WOM) is little more than an oxymoron, and the addition of WOM to a (deterministic or probabilistic) classical computer brings no advantage. We prove that quantum computers that are augmented with WOM can solve problems that neither a classical computer with WOM nor a quantum computer without WOM can solve, when all other resource bounds are equal. We focus on realtime quantum finite automata, and examine the increase in their power effected by the addition of WOMs with different access modes and capacities. Some problems that are unsolvable by two-way probabilistic Turing machines using sublogarithmic amounts of read/write memory are shown to be solvable by these enhanced automata.

Keywords

Quantum computationWrite-only memoryQuantum finite automataCounter automataQuantum Fourier transform

Copyright information

© Springer Science+Business Media B.V. 2011

Authors and Affiliations

  • Abuzer Yakaryılmaz
    • 1
  • Rūsiņš Freivalds
    • 2
  • A. C. Cem Say
    • 1
  • Ruben Agadzanyan
    • 2
  1. 1.Department of Computer EngineeringBoğaziçi UniversityİstanbulTurkey
  2. 2.Institute of Mathematics and Computer ScienceUniversity of LatviaRigaLatvia