Lower Bounds in the Quantum Cell Probe Model

@inproceedings{Sen2001LowerBI,
  title={Lower Bounds in the Quantum Cell Probe Model},
  author={Pranab Kumar Sen and Venkatesh Srinivasan},
  booktitle={ICALP},
  year={2001}
}
We introduce a new model for studying quantum data structure problems -- the quantum cell probe model. We prove a lower bound for the static predecessor problem in the address-only version of this model where, essentially, we allow quantum parallelism only over the 'address lines' of the queries. This model subsumes the classical cell probe model, and many quantum query algorithms like Grover's algorithm fall into this framework. We prove our lower bound by obtaining a round elimination lemma… 
Data Structures in Classical and Quantum Computing
TLDR
This survey summarizes several results about quantum computing related to (mostly static) data structures and gives proofs for lower bounds in this setting that show that the classical data structures from the first section are, in some sense, asymptotically optimal - even in the quantum model.
A ug 2 01 3 Data Structures in Classical and Quantum Computing
TLDR
This survey summarizes several results about quantum computing related to (mostly static) data structures and gives proofs for lower bounds in this setting that show that the classical data structures are, in some sense, asymptotically optimal even in the quantum model.
Lower bounds for predecessor searching in the cell probe model
TLDR
A strong round elimination lemma for communication complexity that enables a tight lower bound for the predecessor problem is proved and it is believed that this lemma is of independent interest and should have other applications.
THE QUANTUM ADVERSARY METHOD AND CLASSICAL FORMULA SIZE LOWER BOUNDS
TLDR
Two new complexity measures for Boolean functions are introduced, which are named sumPI and maxPI, and the main result is proven via a combinatorial lemma which relates the square of the spectral norm of a matrix to the squares ofthe spectral norms of its submatrices.
The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version
TLDR
This work shows a separation between the communication complexity of k and k - 1 round bounded error quantum protocols, for all k < O((m/log2 m)1/5), where m is the size of the inputs to Alice and Bob.
Exponential Lower Bound for 2-Query Locally Decodable Codes via a Quantum Argument
TLDR
This work uses a quantum argument to prove that LDCs with 2 classical queries need exponential length: m=2Ω(n), and shows that a 2-query LDC can be decoded with only 1 quantum query, and proves an exponential lower bound for such 1-query locally quantum-decodable codes.
Prior entanglement, message compression and privacy in quantum communication
TLDR
It is shown that the first message of P can be compressed to 0(k) classical bits using prior entanglement if it carries at most k bits of information about the sender's input, which implies a general direct sum result for one-round and simultaneous quantum protocols.
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.
Exponential separation of quantum and classical one-way communication complexity
TLDR
The Hidden Matching Problem HMn is defined and it is proved that any randomized linear one-way protocol with bounded error for this problem requires Ω(√[3] n log n) bits of communication.
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.
...
...

References

SHOWING 1-10 OF 29 REFERENCES
The Quantum Complexity of Set Membership
TLDR
The results show that the lower bounds shown in [BMRV] for the classical model also hold (with minor differences) in the quantum bit probe model, and almost match the classical upper bounds.
Invariant quantum algorithms for insertion into an ordered list
TLDR
The "greedy" invariant algorithm is constructed and shown numerically that it outperforms the best classical algorithm for various N queries and also finds invariant algorithms that succeed exactly in fewer queries than is classically possible.
Bounds on quantum ordered searching
We prove that any exact quantum algorithm searching an ordered list of N elements requires more than \frac{1}{\pi}(\ln(N)-1) queries to the list. This improves upon the previously best known lower
On quantum and probabilistic communication: Las Vegas and one-way protocols
TLDR
It is proved that for oneway protocols computing total functions quantum Las Vegas communication is asymptotical ly as efficient as exact quantum communication, which is exactly asefficient as determinist ic communication.
A fast quantum mechanical algorithm for database search
TLDR
In early 1994, it was demonstrated that a quantum mechanical computer could efficiently solve a well-known problem for which there was no known efficient algorithm using classical computers, i.e. testing whether or not a given integer, N, is prime, in a time which is a finite power of o (logN) .
Interaction in Quantum Communication Complexity
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, thus answering the question as to whether every classical protocol may be transformed to a ``simpler'' quantum protocol of similar efficiency.
Quantum circuits with mixed states
TLDR
A solution for the subroutine problem: the general function that a quantum circuit outputs is a probabilistic function, but using pure state language, such a function can not be used as a black box in other computations.
Quantum Circuit Complexity
  • A. Yao
  • Computer Science
    FOCS
  • 1993
TLDR
It is shown that any function computable in polynomial time by a quantum Turing machine has aPolynomial-size quantum circuit, and this result enables us to construct a universal quantum computer which can simulate a broader class of quantum machines than that considered by E. Bernstein and U. Vazirani (1993), thus answering an open question raised by them.
Lower bounds for union-split-find related problems on random access machines
We prove Ω(√log log n) lower bounds on the random access machine complexity of several dynamic, partially dynamic and static data structure problems, including the union-split-find problem, dynamic
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness
TLDR
An exact quantum algorithm for ordered searching using roughly 0.631 log2(N) oracle accesses and a quantum routine for traversing through a binary search tree faster than classically, and it is of a nature very different from a faster exact algorithm due to Farhi, Goldstone, Gutmann, and Sipser.
...
...