New quantum algorithm for studying NP-complete problems (Q1422459): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: quant-ph/0406216 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Quantum theory, the Church–Turing principle and the universal quantum computer / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Quantum complexity theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Strengths and Weaknesses of Quantum Computing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4514535 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2707520 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4258585 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Almost-everywhere superiority for quantum polynomial time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complexities and their applications to characterization of chaos / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 15:03, 6 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | New quantum algorithm for studying NP-complete problems |
scientific article |
Statements
New quantum algorithm for studying NP-complete problems (English)
0 references
15 February 2004
0 references
It is known that the quantum computer based on quantum Turing machine or quantum circuits is not powerful enough to solve NP complete problems. It is known that it is possible to speed up NP problem solution quadratically but not exponentially. The problem is that measurements of two quantum states distinguish them with exponentially small probability if their inner product is close to 1. In this paper it is proposed to use an output of quantum computer as an input for another device instead of measurement which will overwhelmingly likely to fail. This device uses chaotic dynamic to amplify the distinguishability of the quantum states. Authors describe the quantum chaos algorithm which in combining with ordinary quantum algorithm can be powerful enough to solve the NP-complete problems in a polynomial time.
0 references
quantum computer
0 references
NP-problem
0 references