New quantum algorithm for studying NP-complete problems
From MaRDI portal
Publication:1422459
DOI10.1016/S0034-4877(03)90002-4zbMath1053.81014arXivquant-ph/0406216MaRDI QIDQ1422459
Masanori Ohya, Igor V. Volovich
Publication date: 15 February 2004
Published in: Reports on Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0406216
Quantum computation (81P68) Quantum chaos (81Q50) Quantum measurement theory, state operations, state preparations (81P15)
Related Items (13)
On Quantum Algorithm for Binary Search and Its Computational Complexity ⋮ Non-Kolmogorovian approach to the context-dependent systems breaking the classical probability law ⋮ Subspace projection method for unstructured searches with noisy quantum oracles using a signal-based quantum emulation device ⋮ Quantum mutual entropy defined by liftings ⋮ Rigorous Estimation of Computational Complexity for OMV SAT Algorithm ⋮ Computational complexity and applications of quantum algorithm ⋮ Quantum algorithm for SAT problem andquantum mutual entropy ⋮ On Generalized Quantum Turing Machine and Its Applications ⋮ Language Classes Defined by Generalized Quantum Turing Machine ⋮ Igor V. Volovich ⋮ New quantum algorithm solving the NP complete problem ⋮ Quantum Information and Probability: My Collaboration with Professor Ingarden ⋮ Quantum binary search algorithm
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complexities and their applications to characterization of chaos
- Almost-everywhere superiority for quantum polynomial time
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Strengths and Weaknesses of Quantum Computing
- Quantum complexity theory
This page was built for publication: New quantum algorithm for studying NP-complete problems
