6533b861fe1ef96bd12c587d
RESEARCH PRODUCT
Quantum Computation With Devices Whose Contents Are Never Read
Ruben AgadzanyanRusins FreivaldsA. C. Cem SayAbuzer Yakaryilmazsubject
FOS: Computer and information sciencesQuantum sortQuantum PhysicsTheoretical computer scienceQuantum Turing machineComputer scienceFormal Languages and Automata Theory (cs.FL)ComputationQuantum simulatorFOS: Physical sciencesComputer Science - Formal Languages and Automata TheoryComputational Complexity (cs.CC)Computer Science - Computational ComplexityQuantum algorithmQuantum informationComputational problemQuantum Physics (quant-ph)Quantum computerdescription
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.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2010-11-04 |