Quantum complexity for vector domination problem

DOI10.1007/978-3-031-23101-8_22MaRDI QIDQ6169538zbMATH OpenFDO

Authors Andris Ambainis, Ansis Zvirbulis

Publication date 14 August 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

quantum query complexityquantum queryelement distinctnessFenwick treesLWSQSETH

Mathematics Subject Classification ID

Data structures (68P05) Quantum algorithms and complexity in the theory of computing (68Q12)

Recommendations

• Automata, Languages and Programming
• Quantum Query Complexity of Some Graph Problems
• The quantum query complexity of the determinant
• Quantum adversary lower bound for element distinctness with small range

Cites work

• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 2063240 (Why is no real title available?)
• scientific article; zbMATH DE number 7561744 (Why is no real title available?)
• scientific article; zbMATH DE number 7204473 (Why is no real title available?)
• scientific article; zbMATH DE number 3240929 (Why is no real title available?)
• A new algorithm for optimal 2-constraint satisfaction and its implications
• Computing and Combinatorics
• Exponential-time quantum algorithms for graph coloring problems
• Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language
• Quantum adversary lower bound for element distinctness with small range
• Quantum algorithms for the subset-sum problem
• Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems
• Quantum speedups for exponential-time dynamic programming algorithms
• The String-to-String Correction Problem
• The Traveling-Salesman Problem and Minimum Spanning Trees

Cited in

(2)

• The fine-grained complexity of multi-dimensional ordering properties
• On the Power of Quantum Algorithms for Vector Valued Mean Computation

This page was built for publication: Quantum complexity for vector domination problem

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