scientific article; zbMATH DE number 1530002
From MaRDI portal
Publication:4514535
DOI10.1023/A:1009651417615zbMATH Open0963.68083arXivquant-ph/9809075MaRDI QIDQ4514535FDOQ4514535
Publication date: 14 November 2000
Published in: Open Systems and Information Dynamics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/9809075
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 1555956
- Quantum computation and NP-complete problems
- Solving NP-Complete Problems with Quantum Search
- New quantum algorithm for studying NP-complete problems
- A quantum characterization of NP
- Quantum advantage in deciding NP-complete problems
- Nested quantum search and NP-hard problems
- New quantum algorithm solving the NP complete problem
- scientific article; zbMATH DE number 5049912
- Strong NP-hardness of the quantum separability problem
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Quantum computation (81P68)
Cited In (13)
- Rigorous Estimation of Computational Complexity for OMV SAT Algorithm
- Language Classes Defined by Generalized Quantum Turing Machine
- New quantum algorithm for studying NP-complete problems
- Quantum information processing: The case of vanishing interaction energy
- Quantum Information and Probability: My Collaboration with Professor Ingarden
- Title not available (Why is that?)
- New quantum algorithm solving the NP complete problem
- Computational complexity and applications of quantum algorithm
- Three ``quantum algorithms to solve 3-SAT
- Quantum algorithm for SAT problem andquantum mutual entropy
- On Halting Process of Quantum Turing Machine
- Solving NP-Complete Problems with Quantum Search
- On Generalized Quantum Turing Machine and Its Applications
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4514535)
