Corpus ID: 209460721

# The aBc Problem and Equator Sampling Renyi Divergences

@article{Klauck2019TheAP,
title={The aBc Problem and Equator Sampling Renyi Divergences},
author={Hartmut Klauck and Debbie Lim},
journal={ArXiv},
year={2019},
volume={abs/1912.11275}
}
• Published 2019
• Mathematics, Computer Science, Physics
• ArXiv
• We investigate the problem of approximating the product $a^TBc$, where $a,c\in S^{n-1}$ and $B\in O_n$, in models of communication complexity and streaming algorithms. The worst meaningful approximation is to simply decide whether the product is 1 or -1, given the promise that it is either. We call that problem the aBc problem. This is a modification of computing approximate inner products, by allowing a basis change. While very efficient streaming algorithms and one-way communication protocols… CONTINUE READING

## The Power of One Clean Qubit in Communication Complexity

• Computer Science, Physics, Mathematics
• ArXiv
• 2018

#### References

##### Publications referenced by this paper.
SHOWING 1-10 OF 14 REFERENCES

## An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance

• Computer Science, Mathematics
• SIAM J. Comput.
• 2012

## The Complexity of Quantum Disjointness

VIEW 2 EXCERPTS

## A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem

• Mathematics, Computer Science
• J. Algorithms
• 1985
VIEW 1 EXCERPT

## Exponential separation of quantum and classical communication complexity

• Ran Raz
• Computer Science
• STOC '99
• 1999
VIEW 1 EXCERPT

## The Power of One Clean Qubit in Communication Complexity

• Computer Science, Physics, Mathematics
• ArXiv
• 2018
VIEW 2 EXCERPTS

## Quantum and Classical Communication-Space Tradeoffs from Rectangle Bounds

VIEW 1 EXCERPT

## Rényi Divergence and Kullback-Leibler Divergence

• Computer Science, Mathematics
• IEEE Transactions on Information Theory
• 2014
VIEW 2 EXCERPTS

## The Space Complexity of Approximating the Frequency Moments

• Computer Science, Mathematics
• J. Comput. Syst. Sci.
• 1999
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

## Quantum One-Way Communication is Exponentially Stronger Than Classical Communication

• Mathematics, Computer Science, Physics
• Electronic Colloquium on Computational Complexity
• 2010
VIEW 11 EXCERPTS
HIGHLY INFLUENTIAL

## Quantum one-way communication can be exponentially stronger than classical communication

• Computer Science
• STOC '11
• 2011