Quantum computation and NP-complete problems

MaRDI QIDQ2735169zbMATH OpenFDO

Authors Tetsuro Nishino

Publication date 10 March 2002

zbMATH Keywords

exponential timenon-standard quantum mechanicsnuclear magnetic resonancepolynomial spacequantum Turing machine

Mathematics Subject Classification ID

Quantum computation (81P68)

Recommendations

• Strengths and Weaknesses of Quantum Computing
• Quantum Complexity Theory
• Mathematical models of quantum computation
• scientific article; zbMATH DE number 1555956
• Solving NP-Complete Problems with Quantum Search

Cited in

(14)

• Quantum computation based on retarded and advanced propagation.
• Necessary and sufficient condition for quantum computing
• Mathematical models of quantum computation
• The Sturm-Liouville eigenvalue problem and NP-complete problems in the quantum setting with queries
• Computational complexity and applications of quantum algorithm
• Necessary and Sufficient Conditions for Quantum Computation
• scientific article; zbMATH DE number 1530002 (Why is no real title available?)
• scientific article; zbMATH DE number 1555956 (Why is no real title available?)
• scientific article; zbMATH DE number 1406122 (Why is no real title available?)
• Generalized Turing quantum machine and its alternative bulk NMR implementation
• Solving NP-Complete Problems with Quantum Search
• scientific article; zbMATH DE number 5049912 (Why is no real title available?)
• New Computational Paradigms
• Quantum resonance for simulating combinatorial problems

This page was built for publication: Quantum computation and NP-complete problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2735169)