# A direct product theorem for quantum communication complexity with applications to device-independent QKD

@article{Jain2022ADP, title={A direct product theorem for quantum communication complexity with applications to device-independent QKD}, author={Rahul Jain and Srijita Kundu}, journal={2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)}, year={2022}, pages={1285-1295} }

We give a direct product theorem for the entanglement-assisted interactive quantum communication complexity in terms of the quantum partition bound for product distributions. The quantum partition or efficiency bound is a lower bound on communication complexity, a non-distributional version of which was introduced by Laplante, Lerays and Roland (2012). For a two-input boolean function, the best result for interactive quantum communication complexity known previously was due to Sherstov (2018…

## 2 Citations

### Security of device-independent quantum key distribution protocols: a review

- Computer Science
- 2022

This review will provide an introduction to DI-QKD, an overview of the related experiments performed, and the theory and techniques required to analyse its security, and concludes with an outlook on future DI- QKD research.

### Quantum secure non-malleable-extractors

- Mathematics, Computer ScienceArXiv
- 2021

This work constructs several explicit quantum secure non-malleable-extractors based on the constructions by Chattopadhyay, Goyal and Li [CGL20] and Cohen [Coh15], and constructs the first explicit Quantum Secure Non-Malleable Extractor for (source) minentropy k ≥ poly.

## References

SHOWING 1-10 OF 55 REFERENCES

### A direct product theorem for one-way quantum communication

- MathematicsElectron. Colloquium Comput. Complex.
- 2020

The techniques are inspired by the parallel repetition theorems for the entangled value of two-player non-local games, under product distributions due to Jain, Pereszlenyi and Yao, and under anchored distribution due to Bavarian, Vidick and Yuen, as well as message-compression for quantum protocols.

### Classical and Quantum Partition Bound and Detector Inefficiency

- Computer ScienceICALP
- 2012

For one- way communication, it is shown that the quantum one-way partition bound is tight for classical communication with shared entanglement up to arbitrarily small error.

### A Hypercontractive Inequality for Matrix-Valued Functions with Applications to Quantum Computing and LDCs

- Computer Science, Mathematics2008 49th Annual IEEE Symposium on Foundations of Computer Science
- 2008

This paper analyzes maps that encode n classical bits into m qubits, in such a way that each set of k bits can be recovered with some probability by an appropriate measurement on the quantum encoding and proves that error-correcting codes that are locally decodable with 2 queries require length exponential in the length of the encoded string.

### Prior entanglement, message compression and privacy in quantum communication

- Computer Science20th Annual IEEE Conference on Computational Complexity (CCC'05)
- 2005

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.

### A Direct Product Theorem for Two-Party Bounded-Round Public-Coin Communication Complexity

- Computer Science, Mathematics2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
- 2012

A direct product theorem for the communication complexity of any complete relation in this model of two-party bounded-round public-coin randomized communication complexity is shown and can be considered as an important progress towards settling the strong direct product conjecture for two- party public-coins communication complexity.

### Quantum and classical strong direct product theorems and optimal time-space tradeoffs

- Computer Science, Mathematics45th Annual IEEE Symposium on Foundations of Computer Science
- 2004

Theorems for the classical as well as quantum query complexity of the OR function are established, which imply a time-space tradeoff T/sup 2/S = /spl Omega/(N/sup 3/) for sorting N items on a quantum computer, which is optimal up to polylog factors.

### The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version

- Computer ScienceFSTTCS
- 2002

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.

### A Direct Product Theorem for Discrepancy

- Mathematics2008 23rd Annual IEEE Conference on Computational Complexity
- 2008

This work shows an optimal product theorem for discrepancy, namely that for any two Boolean functions f, g, disc(f odot g)=thetas(disc(f) disc(g)).

### Informationally restricted quantum correlations

- Computer ScienceQuantum
- 2020

It is shown that quantum communication carrying $\log d$ bits of information is at least as strong a resource as $d$-dimensional classical communication assisted by pre-shared entanglement, and limiting information rather than dimension leads to stronger quantum correlations.

### Quantum Measurement Adversary

- Computer ScienceArXiv
- 2021

qm-adv is the strongest adversary among all the known adversaries, in the sense that the side-information of all other adversaries can be generated by qm-Adv.