On the quantum time complexity of divide and conquer
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918226174148608 |
|---|---|
| author | Allcock, Jonathan Bao, Jinge Belovs, Aleksandrs Lee, Troy Santha, Miklos |
| author_facet | Allcock, Jonathan Bao, Jinge Belovs, Aleksandrs Lee, Troy Santha, Miklos |
| contents | We initiate a systematic study of the time complexity of quantum divide and conquer algorithms for classical problems. We establish generic conditions under which search and minimization problems with classical divide and conquer algorithms are amenable to quantum speedup and apply these theorems to an array of problems involving strings, integers, and geometric objects. They include LONGEST DISTINCT SUBSTRING, KLEE'S COVERAGE, several optimization problems on stock transactions, and k-INCREASING SUBSEQUENCE. For most of these results, our quantum time upper bound matches the quantum query lower bound for the problem, up to polylogarithmic factors. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2311_16401 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | On the quantum time complexity of divide and conquer Allcock, Jonathan Bao, Jinge Belovs, Aleksandrs Lee, Troy Santha, Miklos Quantum Physics Data Structures and Algorithms We initiate a systematic study of the time complexity of quantum divide and conquer algorithms for classical problems. We establish generic conditions under which search and minimization problems with classical divide and conquer algorithms are amenable to quantum speedup and apply these theorems to an array of problems involving strings, integers, and geometric objects. They include LONGEST DISTINCT SUBSTRING, KLEE'S COVERAGE, several optimization problems on stock transactions, and k-INCREASING SUBSEQUENCE. For most of these results, our quantum time upper bound matches the quantum query lower bound for the problem, up to polylogarithmic factors. |
| title | On the quantum time complexity of divide and conquer |
| topic | Quantum Physics Data Structures and Algorithms |
| url | https://arxiv.org/abs/2311.16401 |