Lower Bounds for Parallel Quantum Counting

10/08/2019
by   Paul Burchard, et al.
0

We prove a generalization of the parallel adversary method to multi-valued functions, and apply it to prove that there is no parallel quantum advantage for approximate counting.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/07/2018

Quantum Lower Bound for Approximate Counting Via Laurent Polynomials

We consider the following problem: estimate the size of a nonempty set S...
research
04/18/2019

Quantum Lower Bounds for Approximate Counting via Laurent Polynomials

This paper proves new limitations on the power of quantum computers to s...
research
01/03/2020

Quantum Interference for Counting Clusters

Counting the number of clusters, when these clusters overlap significant...
research
08/10/2022

Improved Quantum Supersampling for Quantum Ray Tracing

Ray tracing algorithm is a category of rendering algorithms that calcula...
research
04/06/2022

Quantum Approximate Counting for Markov Chains and Application to Collision Counting

In this paper we show how to generalize the quantum approximate counting...
research
08/28/2019

Quantum Approximate Counting, Simplified

In 1998, Brassard, Hoyer, Mosca, and Tapp (BHMT) gave a quantum algorith...
research
06/26/2023

Robust and Space-Efficient Dual Adversary Quantum Query Algorithms

The general adversary dual is a powerful tool in quantum computing becau...

Please sign up or login with your details

Forgot password? Click here to reset