Probabilities to accept languages by quantum finite automata

Simple item page
dc.creatorAmbainis, Andris
dc.creatorBonner, Richard
dc.creatorFreivalds, Rusins
dc.creatorKikusts, Arnolds
dc.date1999-04-16
dc.date.accessioned2026-07-07T06:16:24Z
dc.date.available2026-07-07T06:16:24Z
dc.descriptionWe construct a hierarchy of regular languages such that the current language in the hierarchy can be accepted by 1-way quantum finite automata with a probability smaller than the corresponding probability for the preceding language in the hierarchy. These probabilities converge to 1/2.
dc.description14 pages, to appear in COCOON'99
dc.identifierhttps://arxiv.org/abs/quant-ph/9904066
dc.identifierhttp://arxiv.org/abs/quant-ph/9904066
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/94052
dc.subjectQuantum Physics
dc.subjectComputational Complexity
dc.titleProbabilities to accept languages by quantum finite automata
dc.typetext

Files

Collections

arXiv