scientific article; zbMATH DE number 1530002
From MaRDI portal
Publication:4514535
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
Cited in
(15)- Computational complexity and applications of quantum algorithm
- Method for organizing Grover's quantum oracle
- Quantum information and probability: my collaboration with Professor Ingarden
- scientific article; zbMATH DE number 1555956 (Why is no real title available?)
- Solving NP-Complete Problems with Quantum Search
- Quantum adder for superposition states
- Three ``quantum algorithms to solve 3-SAT
- New quantum algorithm for studying NP-complete problems
- On generalized quantum Turing machine and its applications
- New quantum algorithm solving the NP complete problem
- Rigorous Estimation of Computational Complexity for OMV SAT Algorithm
- Quantum information processing: The case of vanishing interaction energy
- On Halting Process of Quantum Turing Machine
- Language classes defined by generalized quantum Turing machine
- Quantum algorithm for SAT problem andquantum mutual entropy
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)
