A hypercontractive inequality for matrix-valued functions with applications to quantum computing and LDCs

Avraham Ben-Aroya, Oded Regev, Ronald De Wolf

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The Bonami-Beckner hypercontractive inequality is a powerful tool in Fourier analysis of real-valued functions on the Boolean cube. In this paper we present a version of this inequality for matrix-valued functions on the Boolean cube. Its proof is based on a powerful inequality by Ball, Carlen, and Lieb. We also present a number of applications. First, we analyze 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; we show that if m < 0.7n, then the success probability is exponentially small in k. This result may be viewed as a direct product version of Nayak's quantum random access code bound. It in turn implies strong direct product theorems for the one-way quantum communication complexity of Disjointness and other problems. Second, we prove that error-correcting codes that are locally decodable with 2 queries require length exponential in the length of the encoded string. This gives what is arguably the first "non-quantum" proof of a result originally derived by Kerenidis and de Wolf using quantum information theory.

Original languageEnglish (US)
Title of host publicationProceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008
Pages477-486
Number of pages10
DOIs
StatePublished - 2008
Event49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008 - Philadelphia, PA, United States
Duration: Oct 25 2008Oct 28 2008

Other

Other49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008
CountryUnited States
CityPhiladelphia, PA
Period10/25/0810/28/08

Fingerprint

Quantum communication
Fourier analysis
Information theory

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Ben-Aroya, A., Regev, O., & De Wolf, R. (2008). A hypercontractive inequality for matrix-valued functions with applications to quantum computing and LDCs. In Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008 (pp. 477-486). [4690981] https://doi.org/10.1109/FOCS.2008.45

A hypercontractive inequality for matrix-valued functions with applications to quantum computing and LDCs. / Ben-Aroya, Avraham; Regev, Oded; De Wolf, Ronald.

Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008. 2008. p. 477-486 4690981.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ben-Aroya, A, Regev, O & De Wolf, R 2008, A hypercontractive inequality for matrix-valued functions with applications to quantum computing and LDCs. in Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008., 4690981, pp. 477-486, 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, Philadelphia, PA, United States, 10/25/08. https://doi.org/10.1109/FOCS.2008.45
Ben-Aroya A, Regev O, De Wolf R. A hypercontractive inequality for matrix-valued functions with applications to quantum computing and LDCs. In Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008. 2008. p. 477-486. 4690981 https://doi.org/10.1109/FOCS.2008.45
Ben-Aroya, Avraham ; Regev, Oded ; De Wolf, Ronald. / A hypercontractive inequality for matrix-valued functions with applications to quantum computing and LDCs. Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008. 2008. pp. 477-486
@inproceedings{e6d60344430e4aaa9b19fab7e425d039,
title = "A hypercontractive inequality for matrix-valued functions with applications to quantum computing and LDCs",
abstract = "The Bonami-Beckner hypercontractive inequality is a powerful tool in Fourier analysis of real-valued functions on the Boolean cube. In this paper we present a version of this inequality for matrix-valued functions on the Boolean cube. Its proof is based on a powerful inequality by Ball, Carlen, and Lieb. We also present a number of applications. First, we analyze 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; we show that if m < 0.7n, then the success probability is exponentially small in k. This result may be viewed as a direct product version of Nayak's quantum random access code bound. It in turn implies strong direct product theorems for the one-way quantum communication complexity of Disjointness and other problems. Second, we prove that error-correcting codes that are locally decodable with 2 queries require length exponential in the length of the encoded string. This gives what is arguably the first {"}non-quantum{"} proof of a result originally derived by Kerenidis and de Wolf using quantum information theory.",
author = "Avraham Ben-Aroya and Oded Regev and {De Wolf}, Ronald",
year = "2008",
doi = "10.1109/FOCS.2008.45",
language = "English (US)",
isbn = "9780769534367",
pages = "477--486",
booktitle = "Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008",

}

TY - GEN

T1 - A hypercontractive inequality for matrix-valued functions with applications to quantum computing and LDCs

AU - Ben-Aroya, Avraham

AU - Regev, Oded

AU - De Wolf, Ronald

PY - 2008

Y1 - 2008

N2 - The Bonami-Beckner hypercontractive inequality is a powerful tool in Fourier analysis of real-valued functions on the Boolean cube. In this paper we present a version of this inequality for matrix-valued functions on the Boolean cube. Its proof is based on a powerful inequality by Ball, Carlen, and Lieb. We also present a number of applications. First, we analyze 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; we show that if m < 0.7n, then the success probability is exponentially small in k. This result may be viewed as a direct product version of Nayak's quantum random access code bound. It in turn implies strong direct product theorems for the one-way quantum communication complexity of Disjointness and other problems. Second, we prove that error-correcting codes that are locally decodable with 2 queries require length exponential in the length of the encoded string. This gives what is arguably the first "non-quantum" proof of a result originally derived by Kerenidis and de Wolf using quantum information theory.

AB - The Bonami-Beckner hypercontractive inequality is a powerful tool in Fourier analysis of real-valued functions on the Boolean cube. In this paper we present a version of this inequality for matrix-valued functions on the Boolean cube. Its proof is based on a powerful inequality by Ball, Carlen, and Lieb. We also present a number of applications. First, we analyze 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; we show that if m < 0.7n, then the success probability is exponentially small in k. This result may be viewed as a direct product version of Nayak's quantum random access code bound. It in turn implies strong direct product theorems for the one-way quantum communication complexity of Disjointness and other problems. Second, we prove that error-correcting codes that are locally decodable with 2 queries require length exponential in the length of the encoded string. This gives what is arguably the first "non-quantum" proof of a result originally derived by Kerenidis and de Wolf using quantum information theory.

UR - http://www.scopus.com/inward/record.url?scp=57949116863&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=57949116863&partnerID=8YFLogxK

U2 - 10.1109/FOCS.2008.45

DO - 10.1109/FOCS.2008.45

M3 - Conference contribution

AN - SCOPUS:57949116863

SN - 9780769534367

SP - 477

EP - 486

BT - Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008

ER -