✦ LIBER ✦

Superiority of exact quantum automata for promise problems

✍ Scribed by Andris Ambainis; Abuzer Yakaryılmaz

Book ID: 113663316
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 118 KB
Volume: 112
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2012.01.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Exact results for accepting probabilitie

Exact results for accepting probabilities of quantum automata

✍ Andris Ambainis; Arnolds Ķikusts 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 222 KB

One of the properties of the Kondacs-Watrous model of quantum ÿnite automata (QFA) is that the probability of the correct answer for a QFA cannot be ampliÿed arbitrarily. In this paper, we determine the maximum probabilities achieved by QFAs for several languages. In particular, we show that any lan

Exact complexity of problems of incomple

Exact complexity of problems of incompletely specified automata

✍ Nadia Creignou 📂 Article 📅 1996 🏛 Springer Netherlands 🌐 English ⚖ 662 KB

Decidable and Undecidable Problems about

Decidable and Undecidable Problems about Quantum Automata

✍ Blondel, Vincent D.; Jeandel, Emmanuel; Koiran, Pascal; Portier, Natacha 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 159 KB

Exact Quantum Algorithms for the Leader

Exact Quantum Algorithms for the Leader Election Problem

✍ Tani, Seiichiro; Kobayashi, Hirotada; Matsumoto, Keiji 📂 Article 📅 2012 🏛 Association for Computing Machinery 🌐 English ⚖ 245 KB

Bistable saturation in coupled quantum d

Bistable saturation in coupled quantum dots for quantum cellular automata

✍ Lent, Craig S.; Tougaw, P. Douglas; Porod, Wolfgang 📂 Article 📅 1993 🏛 American Institute of Physics 🌐 English ⚖ 617 KB

Undecidable Problems for Probabilistic A

Undecidable Problems for Probabilistic Automata of Fixed Dimension

✍ Blondel; Canterini 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 120 KB