Superlinear advantage for exact quantum algorithms

Abstract

A quantum algorithm is exact if, on any input data, it outputs the correct answer with certainty (probability 1). A key question is: how big is the advantage of exact quantum algorithms over their classical counterparts: deterministic algorithms. For total Boolean functions in the query model, the biggest known gap was just a factor of 2: PARITY of N input… (More)
DOI: 10.1145/2488608.2488721

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Blog articles referencing this paper

Slides referencing similar topics