Abstract
While quantum computers hold the promise of significant computational speedups, the limited size of early quantum machines motivates the study of spacebounded quantum computation. We relate the quantum space complexity of computing a function f with onesided error to the logarithm of its span program size, a classical quantity that is wellstudied in attempts to prove formula size lower bounds.
In the more natural bounded error model, we show that the amount of space needed for a unitary quantum algorithm to compute f with bounded (twosided) error is lower bounded by the logarithm of its approximate span program size. Approximate span programs were introduced in the field of quantum algorithms but not studied classically. However, the approximate span program size of a function is a natural generalization of its span program size.
While no nontrivial lower bound is known on the span program size (or approximate span program size) of any concrete function, a number of lower bounds are known on the monotone span program size. We show that the approximate monotone span program size of f is a lower bound on the space needed by quantum algorithms of a particular form, called monotone phase estimation algorithms, to compute f. We then give the first nontrivial lower bound on the approximate span program size of an explicit function.
BibTeX  Entry
@InProceedings{jeffery:LIPIcs:2020:11689,
author = {Stacey Jeffery},
title = {{Span Programs and Quantum Space Complexity}},
booktitle = {11th Innovations in Theoretical Computer Science Conference (ITCS 2020)},
pages = {4:14:37},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {9783959771344},
ISSN = {18688969},
year = {2020},
volume = {151},
editor = {Thomas Vidick},
publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2020/11689},
URN = {urn:nbn:de:0030drops116896},
doi = {10.4230/LIPIcs.ITCS.2020.4},
annote = {Keywords: Quantum space complexity, span programs}
}
Keywords: 

Quantum space complexity, span programs 
Seminar: 

11th Innovations in Theoretical Computer Science Conference (ITCS 2020) 
Issue Date: 

2020 
Date of publication: 

10.01.2020 