scientific article; zbMATH DE number 1530002
From MaRDI portal
Publication:4514535
DOI10.1023/A:1009651417615zbMath0963.68083arXivquant-ph/9809075MaRDI QIDQ4514535
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: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Quantum computation (81P68)
Related Items (11)
Three ``quantum algorithms to solve 3-SAT ⋮ Rigorous Estimation of Computational Complexity for OMV SAT Algorithm ⋮ Computational complexity and applications of quantum algorithm ⋮ New quantum algorithm for studying NP-complete problems ⋮ Quantum algorithm for SAT problem andquantum mutual entropy ⋮ On Generalized Quantum Turing Machine and Its Applications ⋮ Language Classes Defined by Generalized Quantum Turing Machine ⋮ New quantum algorithm solving the NP complete problem ⋮ Quantum information processing: The case of vanishing interaction energy ⋮ On Halting Process of Quantum Turing Machine ⋮ Quantum Information and Probability: My Collaboration with Professor Ingarden
This page was built for publication:
