Complexity bounds on some fundamental computational problems for quantum branching programs.

zbMATH Open1094.68033MaRDI QIDQ5477283FDOQ5477283

Authors: Airat Khasianov 

Publication date: 3 July 2006

Full work available at URL: http://hss.ulb.uni-bonn.de/diss_online/math_nat_fak/2005/khasianov_airat/

Recommendations

• On the complexity of the hidden subgroup problem
• On the Complexity of the Hidden Subgroup Problem
• The quantum query complexity of the abelian hidden subgroup problem
• Quantum measurements for hidden subgroup problems with optimal sample complexity
• Automata, Languages and Programming

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)

Cited In (4)

• Title not available (Why is that?)
• On the computational power of probabilistic and quantum branching program
• Entropy lower bounds for quantum decision tree complexity
• Title not available (Why is that?)

This page was built for publication: Complexity bounds on some fundamental computational problems for quantum branching programs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5477283)