✦ LIBER ✦

Determination of equivalence between quantum sequential machines

✍ Scribed by Lvzhou Li; Daowen Qiu

Book ID: 108281189
Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 212 KB
Volume: 358
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2006.03.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Characterization of Sequential Quantum M

Characterization of Sequential Quantum Machines

✍ Daowen Qiu 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 71 KB

The Equivalence of Sequential Machine Mo

The Equivalence of Sequential Machine Models

✍ Hartmanis, Juris 📂 Article 📅 1963 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 488 KB

Perfect computational equivalence betwee

Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families

✍ Harumichi Nishimura; Masanao Ozawa 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 202 KB

Testing the shift-equivalence of polynom

Testing the shift-equivalence of polynomials using quantum machines

✍ D. Grigoriev 📂 Article 📅 1996 🏛 Springer US 🌐 English ⚖ 742 KB

On the Equivalence of Finite-State Seque

On the Equivalence of Finite-State Sequential Machine Models

✍ Ibarra, Oscar H. 📂 Article 📅 1967 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 555 KB

Testing shift-equivalence of polynomials

Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines

✍ D. Grigoriev 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 930 KB

The polynomials f, g E F[Xl, ,X,J are called shift-equivalent if there exists a shift (a~, , cc,) E F" such that f(Xl furl, . . ,X,, + CC,) = g. In three different cases algorithms which produce the set of all shift-equivalences of f, g in polynomial time are designed. Here (1) in the case of a zero