arXiv:quant-ph/9801036

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

Fernando Maroto

Published Jan 16, 1998• 0 citations

Abstract

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

DOI: 10.48550/arxiv.quant-ph/9801036

Related papers

WITHDRAWN: Trace preserving quantum dynamics using a novel reparametrization-neutral summation-by-parts difference operator

Oskar Ålund, Yukinao Akamatsu, Fredrik Laurén +3 more

This article has been transferred from JCPX to YJCPH at the request of the author(s) and editor. The Publisher apologizes for any inconvenience this may cause. The full Elsevier Policy on Article Withdrawal can be found at https://www.elsevier.com/about/our-business/policies/article-withdrawal.

Journal of Computational Physics XSep 1, 20200 citations

From classical versus quantum algorithms to P versus NP

M. Feldmann

May 30, 20124 citations

Quantum Period Query Proves NP in BQP

Philippe Jorrand, Mehdi Mhalla

Withdrawn by the authors. Since the elements within each period of function hA are not distinct, period finding cannot operate properly. Thanks to all for the comments and sorry for the inconvenience.

arXiv:quant-ph/0105005May 2, 20010 citations

Solving NP-Complete Problems with a Quantum Computer

Colin P. Williams

Texts in computer scienceDec 6, 20103 citations

A Quantum NP Solver: NP in QP

Clarke, Thomas L.

A attempt at a quantum algorithm for solving NP problems is presented. Now withdrawn because some crucial operators were not unitary.

arXiv:quant-ph/9908080Aug 27, 19990 citations

A New Efficient Quantum Algorithm for Solving NP-complete Problems

Dhananjay P. Mehendale

Jan 1, 20260 citations