Quantum algorithm for dynamic programming approach for DAGs. Applications for Zhegalkin polynomial evaluation and some problems on DAGs

DOI10.1007/978-3-030-19311-9_13OpenAlexW2946502317MaRDI QIDQ2326812

Liliya Safina, Kamil Khadiev

Publication date: 10 October 2019

Full work available at URL: https://arxiv.org/abs/1804.09950

zbMATH Keywords

computational complexitygraphdynamic programmingquantum computationquantum algorithmZhegalkin polynomialDAGBoolean formulaquery modelDNFquantum modelsNANDAND-OR-NOT formulaBoolean formula evaluationclassical vs. quantum

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (3)

Quantum algorithm for Dyck language with multiple types of brackets ⋮ Quantum algorithm for dynamic programming approach for DAGs and applications ⋮ Classical and Quantum Algorithms for Assembling a Text from a Dictionary

This page was built for publication: Quantum algorithm for dynamic programming approach for DAGs. Applications for Zhegalkin polynomial evaluation and some problems on DAGs