Simulation of finite state machines in a quantum computer

Simple item page
dc.creatorDunlavey, M. R.
dc.date1998-07-09
dc.date.accessioned2026-07-07T06:15:17Z
dc.date.available2026-07-07T06:15:17Z
dc.descriptionA construction is given for simulating any deterministic finite state machine (FSM) on a quantum computer in a space-efficient manner. By constructing a superposition of input strings of lengths K or less, questions can be asked about the FSM, such as the inputs that reach particular nodes, and the answers can be found using a search algorithm such as Grover's. This has implications for the eventual utility of quantum computers for software validation.
dc.descriptionPlain TEX, 6 pages, 3 GIF figures, includes C program
dc.identifierhttps://arxiv.org/abs/quant-ph/9807026
dc.identifierhttp://arxiv.org/abs/quant-ph/9807026
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/93749
dc.subjectQuantum Physics
dc.titleSimulation of finite state machines in a quantum computer
dc.typetext

Files

Collections

arXiv