Exact results for accepting probabilities of quantum automata
Andris Ambainis, Arnolds Kikusts
Abstract
One of the properties of Kondacs-Watrous model of quantum finite automata (QFA) is that the probability of the correct answer for a QFA cannot be amplified arbitrarily. In this paper, we determine the maximum probabilities achieved by QFAs for several languages. In particular, we show that any language that is not recognized by an RFA (reversible finite automaton) can be recognized by a QFA with probability at most 0.7726...
Create a lesson
Related papers
Logical CCZ state cultivation
Yuta Hirasaki, Jong Yeon Lee
Quantum-Aware Key Rank for Side-Channel Attacks evaluation
Yevgen Kotukh
Intermediate memory costs of quantum channel synthesis with a protected subsystem
Kai Liu, Deguang Han
Quantum Work Statistics from Entanglement-Assisted Invariance
Akira Sone, Akram Touil, Emery Doucet et al.
Petz Recovery through a Single Polar Transformation for Approximate Quantum Error Correction
Hanzhang Zhao, Shenglong Xu
Demonstration of a mobile ion-trap quantum device
Sara Alfaro, Dipesh Bhanushali, Sankarshan Choudapurkar et al.