✦ LIBER ✦

NP Problem in Quantum Algorithm

✍ Scribed by Masanori Ohya; Natsuki Masuda

Book ID: 110277930
Publisher: World Scientific Publishing Company
Year: 2000
Tongue: English
Weight: 173 KB
Volume: 7
Category: Article
ISSN: 1230-1612
DOI: 10.1023/a:1009651417615

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New quantum algorithm solving the NP com

New quantum algorithm solving the NP complete problem

✍ M. Ohya 📂 Article 📅 2012 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 504 KB

A Quantum Adiabatic Evolution Algorithm

A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem

✍ Farhi, E.; Goldstone, J.; Gutmann, S.; Lapan, J.; Lundgren, A.; Preda, D. 📂 Article 📅 2001 🏛 American Association for the Advancement of Scienc 🌐 English ⚖ 194 KB

Prediction problem in quantum mechanics

Prediction problem in quantum mechanics is intractable (NP-Hard)

✍ Vladik Kreinovich; Alejandro Vazquez; Olga Kosheleva 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 563 KB

Nested Quantum Search and NP-Hard Proble

Nested Quantum Search and NP-Hard Problems

✍ Nicolas J. Cerf; Lov K. Grover; Colin P. Williams 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 194 KB

NP-Complete operations research problems

NP-Complete operations research problems and approximation algorithms

✍ Peter Brucker 📂 Article 📅 1979 🏛 Springer 🌐 English ⚖ 979 KB

DNA Models and Algorithms for NP-Complet

DNA Models and Algorithms for NP-Complete Problems

✍ Eric Bach; Anne Condon; Elton Glaser; Celena Tanguay 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 488 KB

A goal of research on DNA computing is to solve problems that are beyond the capabilities of the fastest silicon-based supercomputers. Adleman and Lipton present exhaustive search algorithms for 3Sat and 3-coloring, which can only be run on small instances and, hence, are not practical. In this pape