2010/11/04 by Abuzer Yakaryılmaz, Abuzer Yakaryilmaz, Rūsiņš Freivalds +3 · 1 voice
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #cs.CC #cs.FL #quant-ph
paper · pdf · doi:10.1007/s11047-011-9270-0
arxiv published 2010/11/04 · arxiv updated 2010/11/04 · openalex publication_date 2011/08/23 · openalex created_date 2020/11/23 · openalex updated_date 2026/07/23
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.