Solving in the quantum computer every classical NP problem in polynomial time

1998/01/16 by Fernando Maroto, Fernando M. Maroto, Maroto, Fernando M.
Computer Science · Physics and Astronomy · #Computability, Logic, AI Algorithms #Quantum Computing Algorithms and Architecture #quant-ph

paper · pdf · doi:10.48550/arxiv.quant-ph/9801036

WITHDRAWN

arxiv created 1998/01/20 · arxiv updated 2009/12/01

Abstract

This paper has been withdrawn by the author due to a crucial error in eq.59. I apologize for the inconveniences.

Related

• A Quantum NP Solver: NP in QP
• Quantum Computation Relative to Oracles
• BQP is not in NP
• Quantum advantage for combinatorial optimization problems, Simplified
• Finding Solutions to NP Problems: Philosophical Difference Between Quantum and Evolutionary Search Algorithms