Augmented Index and Quantum Streaming Algorithms for DYCK(2)

@article{Nayak2017AugmentedIA,
  title={Augmented Index and Quantum Streaming Algorithms for DYCK(2)},
  author={Ashwin Nayak and Dave Touchette},
  journal={ArXiv},
  year={2017},
  volume={abs/1610.04937}
}
We show how two recently developed quantum information theoretic tools can be applied to obtain lower bounds on quantum information complexity. We also develop new tools with potential for broader applicability, and use them to establish a lower bound on the quantum information complexity for the Augmented Index function on an easy distribution. This approach allows us to handle superpositions rather than distributions over inputs, the main technical challenge faced previously. By providing a… 
Augmented index and quantum streaming algorithms for DYCK(2)
TLDR
By providing a quantum generalization of the argument of Jain and Nayak, this work leverages this to obtain a lower bound on the space complexity of multi-pass, unidirectional quantum streaming algorithms for the Dyck(2) language.
23 : 2 Quantum Chebyshev ’ s Inequality and Applications
In this paper we provide new quantum algorithms with polynomial speed-up for a range of problems for which no such results were known, or we improve previous algorithms. First, we consider the
Separating Quantum Communication and Approximate Rank
TLDR
This work exhibits a total function H with quantum communication complexity almost quadratically larger than the logarithm of its approximate rank, and shows the upper bound on the approximate rank of F_G by relating it to the Boolean circuit size of the starting function F.
N ov 2 01 6 Separating quantum communication and approximate rank
One of the best lower bound methods for the quantum communication complexity of a function H (with or without shared entanglement) is the logarithm of the approximate rank of the communication matrix
Exponential separation of quantum communication and classical information
TLDR
A simple proof for an optimal trade-off between Alice's and Bob's communication is given, even when allowing pre-shared entanglement, while computing the related Greater-Than function on n bits.
Quantum Log-Approximate-Rank Conjecture is Also False
TLDR
This work derives a polynomially-related quantum communication complexity lower bound using the quantum information complexity approach, thus providing an exponential separation between the log approximate rank and quantum communication complex of f.
Quantum Chebyshev's Inequality and Applications
TLDR
A new quantum paradigm that is based on a refinement of the Amplitude Estimation algorithm of Brassard et al. is developed, and it is demonstrated that, in a certain model of quantum sampling, one can approximate with relative error the mean of any random variable with a number of quantum samples that is linear in the ratio of the square root of the variance to the mean.
The Flow of Information in Interactive Quantum Protocols: the Cost of Forgetting
TLDR
This work provides a specific sense in which forgetting information is a necessary feature of interactive quantum protocols, and proves that any quantum protocol that does not forget information solves Disjointness on n-bits in Omega (n) communication, completely losing the quadratic quantum speedup.
A Quantum Advantage for a Natural Streaming Problem
TLDR
This work gives a one-pass quantum streaming algorithm for one of the best-studied problems in classical graph streaming—the triangle counting problem; the algorithm uses polynomially less space in certain regions of the parameter space.

References

SHOWING 1-10 OF 37 REFERENCES
Augmented index and quantum streaming algorithms for DYCK(2)
TLDR
By providing a quantum generalization of the argument of Jain and Nayak, this work leverages this to obtain a lower bound on the space complexity of multi-pass, unidirectional quantum streaming algorithms for the Dyck(2) language.
Quantum Information Complexity
TLDR
A new notion of information cost for quantum protocols, and a corresponding notion of quantum information complexity for bipartite quantum tasks are defined, and it is proved that using this definition leads to the first general direct sum theorem for bounded round quantum communication complexity.
Quantum Information Complexity and Amortized Communication
TLDR
A new notion of information cost for quantum protocols, and a corresponding notion of quantum information complexity for bipartite quantum channels are defined, and an operational interpretation for this quantity is provided: it is exactly equal to the amortized quantum communication complexity of a bipartites channel on a given state.
Exponential separation of quantum and classical online space complexity
  • F. Gall
  • Mathematics, Computer Science
    SPAA
  • 2006
TLDR
This paper introduces a very natural and simple model of a space-bounded quantum online machine and proves an exponential separation of classical and quantum online space complexity, in the bounded-error setting and for a total language.
Exponential Separation of Quantum and Classical Online Space Complexity
Abstract Although quantum algorithms realizing an exponential time speed-up over the best known classical algorithms exist, no quantum algorithm is known performing computation using less space
Information cost of quantum communication protocols
TLDR
This work studies two different notions of quantum information cost and analyzes their relation, and provides new quantum protocols for the Inner Product function and for Private Information Retrieval, and shows that protocols for private information retrieval can have exponentially different information cost for the server.
Exponential separations for one-way quantum communication complexity, with applications to cryptography
We give an exponential separation between one-way quantum and classical communication protocols for twopartial Boolean functions, both of which are variants of the Boolean Hidden Matching Problem of
Interaction in Quantum Communication
TLDR
It is shown that for any constant k, there is a problem such that its k+1 message classical communication complexity is exponentially smaller than its k message quantum communication complexity.
Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography
TLDR
This work gives an exponential separation between one-way quantum and classical communication protocols for a partial Boolean function (a variant of the Boolean hidden matching problem of Bar-Yossef et al.) and gives a number of applications of this separation.
Dense quantum coding and quantum finite automata
TLDR
The technique is applied to show the surprising result that there are languages for which quantum finite automata take exponentially more states than those of corresponding classical automata.
...
1
2
3
4
...