Automata, Languages and Programming
From MaRDI portal
Publication:5716753
DOI10.1007/11523468zbMath1081.68027OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716753
Vincent Nesme, Natacha Portier, Pascal Koiran
Publication date: 10 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11523468
Quantum computation (81P68) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (6)
The quantum query complexity of the abelian hidden subgroup problem ⋮ Sample complexity of hidden subgroup problem ⋮ Quantum and classical query complexities for generalized Simon's problem ⋮ Adversary lower bounds for nonadaptive quantum algorithms ⋮ Quantum evolutionary algorithm with rotational gate and \(H_\epsilon\)-gate updating in real and integer domains for optimization ⋮ Query complexity of generalized Simon's problem
This page was built for publication: Automata, Languages and Programming
