A Note on Quantum Divide and Conquer for Minimal String Rotation

10/17/2022
by   Qisheng Wang, et al.
0

Lexicographically minimal string rotation is a fundamental problem on string processing that has recently attracted a lot of attention in quantum computing. Near-optimal quantum algorithms have been proposed during its development, with new ideas such as quantum divide and conquer introduced. In this note, we further study its quantum query complexity. Slightly improved quantum algorithms by divide and conquer are proposed: 1. For the function problem, its query complexity is shown to be √(n)· 2^O(√(log n)), improving the recent result of √(n)· 2^(log n)^1/2+ε by Akmal and Jin (2022). 2. For the decision problem, its query complexity is shown to be O(√(n log^3 n loglog n)), improving the recent result of O(√(n log^5 n)) by Childs et al. (2022). The purpose of this note is to point out some useful algorithmic tricks, e.g., preprocessing and level-wise optimization, that can be used to improve quantum algorithms, especially for those with a divide-and-conquer structure.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/12/2022

Quantum divide and conquer

The divide-and-conquer framework, used extensively in classical algorith...
research
12/17/2020

Quantum Algorithm for Lexicographically Minimal String Rotation

Lexicographically minimal string rotation (LMSR) is a problem to find th...
research
03/30/2021

A note about claw function with a small range

In the claw detection problem we are given two functions f:D→ R and g:D→...
research
01/15/2001

Multiple-Size Divide-and-Conquer Recurrences

This short note reports a master theorem on tight asymptotic solutions t...
research
10/19/2021

Near-Optimal Quantum Algorithms for String Problems

We study quantum algorithms for several fundamental string problems, inc...
research
09/03/2023

Longest Common Substring and Longest Palindromic Substring in 𝒪̃(√(n)) Time

The Longest Common Substring (LCS) and Longest Palindromic Substring (LP...
research
11/29/2022

The Adversary Bound Revisited: From Optimal Query Algorithms to Optimal Control

This note complements the paper "One-Way Ticket to Las Vegas and the Qua...

Please sign up or login with your details

Forgot password? Click here to reset