Improved Quantum Query Complexity on Easier Inputs-Reference-Cited by-同舟云学术

Improved Quantum Query Complexity on Easier Inputs

Published:2024-04-08 Issue: Volume:8 Page:1309
ISSN:2521-327X
Container-title:Quantum
language:en
Short-container-title:Quantum

Author:

Anderson Noel T.¹,Chung Jay-U¹,Kimmel Shelby¹^ORCID,Koh Da-Yeon²,Ye Xiaohan¹³

Affiliation:

1. Middlebury College, Middlebury, VT, USA

2. Williams College, Williamstown, MA, USA

3. Brown University, Providence, RI, USA

Abstract

Quantum span program algorithms for function evaluation sometimes have reduced query complexity when promised that the input has a certain structure. We design a modified span program algorithm to show these improvements persist even without a promise ahead of time, and we extend this approach to the more general problem of state conversion. As an application, we prove exponential and superpolynomial quantum advantages in average query complexity for several search problems, generalizing Montanaro's Search with Advice [Montanaro, TQC 2010].

Funder

U.S. Army Research Office

Publisher

Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften

Link

https://quantum-journal.org/papers/q-2024-04-08-1309/pdf/

Reference26 articles.

1. Andris Ambainis and Ronald de Wolf. Average-case quantum query complexity. Journal of Physics A: Mathematical and General, 34(35):6741, 2001. doi:10.1088/0305-4470/34/35/302.

2. Dorit Aharonov. Quantum Computation. Annual Reviews of Computational Physics VI, pages 259–346, 1999. doi:10.1142/9789812815569_0007.

3. Michel Boyer, Gilles Brassard, Peter Høyer, and Alain Tapp. Tight Bounds on Quantum Searching. Fortschritte der Physik, 46(4-5):493–505, 1998. doi:10.1002/(SICI)1521-3978(199806)46:4/5<493::AID-PROP493>3.0.CO;2-P.

4. Aleksandrs Belovs. Span programs for functions with constant-sized 1-certificates: Extended abstract. In Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing, STOC '12, pages 77–84, 2012. doi:10.1145/2213977.2213985.

5. Gilles Brassard, Peter Høyer, Michele Mosca, and Alain Tapp. Quantum amplitude amplification and estimation. In Quantum computation and information, volume 305 of Contemp. Math., pages 53–74. Amer. Math. Soc., Providence, RI, 2002. doi:10.1090/conm/305/05215.