Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language

DOI10.4230/LIPICS.MFCS.2020.8OpenAlexW3082242318MaRDI QIDQ5089167FDOQ5089167

Authors: Kaspars Balodis, Jānis Iraids, Vladislavs Kļevickis, Krišjānis Prūsis, Yixin Shen, J. Smotrovs, Jevgēnijs Vihrovs, Andris Ambainis, Kamil Khadiev 

Publication date: 18 July 2022

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

zbMATH Keywords

quantum algorithmsquantum query complexityDyck languagegrid path

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited In (5)

• Near-optimal quantum algorithms for string problems
• Quantum algorithm for dynamic programming approach for DAGs and applications
• Quantum complexity for vector domination problem
• Quantum bounds for 2D-grid and Dyck language
• Quantum algorithms for string processing

This page was built for publication: Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language

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