✦ LIBER ✦

Virtually-deterministic quantum computing of nondeterministic polynomial problems

✍ Scribed by J. D. Brasher; C. F. Hester; H. J. Caulfield

Publisher: Springer
Year: 1991
Tongue: English
Weight: 255 KB
Volume: 30
Category: Article
ISSN: 0020-7748
DOI: 10.1007/bf00673989

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Deterministic polynomial-time quantum al

Deterministic polynomial-time quantum algorithms for Simon’s problem

✍ Takashi Mihara; Shao Chin Sung 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 211 KB

Deterministic realization of nondetermin

Deterministic realization of nondeterministic computations with a low measure of nondeterminism

✍ I. R. Nasyrov 📂 Article 📅 1991 🏛 Springer US 🌐 English ⚖ 902 KB

Deterministic Polynomial-Time Equivalenc

Deterministic Polynomial-Time Equivalence of Computing the RSA Secret Key and Factoring

✍ Jean-Sebastien Coron; Alexander May 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 230 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

Implementation and characterization of a

Implementation and characterization of active feed-forward for deterministic linear optics quantum computing

✍ P. Böhi; R. Prevedel; T. Jennewein; A. Stefanov; F. Tiefenbacher; A. Zeilinger 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 731 KB

To solving multiparameter problems of al

To solving multiparameter problems of algebra. 10. Computing zeros of a scalar polynomial

✍ V. N. Kublanovskaya 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 166 KB