Dense quantum coding and a lower bound for 1-way quantum automata

Andris Ambainis; Ashwin Nayak; Amnon Ta-Shma; Umesh Vazirani

doi:10.1145/301250.301347

Dense quantum coding and a lower bound for 1-way quantum automata

Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh Vazirani

Research output: Contribution to journal › Conference article › peer-review

Abstract

We consider the possibility of encoding m classical bits into much fewer n quantum bits so that an arbitrary bit from the original m bits can be recovered with a good probability, and we show that non-trivial quantum encodings exist that have no classical counterparts. On the other hand, we show that quantum encodings cannot be much more succint as compared to classical encodings, and we provide a lower bound on such quantum encodings. Finally, using this lower bound, we prove an exponential lower bound on the size of 1-way quantum finite automata for a family of languages accepted by linear sized deterministic finite automata.

Original language	English
Pages (from-to)	376-383
Number of pages	8
Journal	Conference Proceedings of the Annual ACM Symposium on Theory of Computing
DOIs	https://doi.org/10.1145/301250.301347
State	Published - 1999
Externally published	Yes
Event	Proceedings of the 1999 31st Annual ACM Symposium on Theory of Computing - FCRC '99 - Atlanta, GA, USA Duration: 1 May 1999 → 4 May 1999

Access to Document

10.1145/301250.301347

Cite this

@article{496dc7d0381d484398fd5f08a99ddd61,

title = "Dense quantum coding and a lower bound for 1-way quantum automata",

abstract = "We consider the possibility of encoding m classical bits into much fewer n quantum bits so that an arbitrary bit from the original m bits can be recovered with a good probability, and we show that non-trivial quantum encodings exist that have no classical counterparts. On the other hand, we show that quantum encodings cannot be much more succint as compared to classical encodings, and we provide a lower bound on such quantum encodings. Finally, using this lower bound, we prove an exponential lower bound on the size of 1-way quantum finite automata for a family of languages accepted by linear sized deterministic finite automata.",

author = "Andris Ambainis and Ashwin Nayak and Amnon Ta-Shma and Umesh Vazirani",

year = "1999",

doi = "10.1145/301250.301347",

language = "אנגלית",

pages = "376--383",

journal = "Conference Proceedings of the Annual ACM Symposium on Theory of Computing",

issn = "0734-9025",

publisher = "Association for Computing Machinery (ACM)",

note = "null ; Conference date: 01-05-1999 Through 04-05-1999",

}

TY - JOUR

T1 - Dense quantum coding and a lower bound for 1-way quantum automata

AU - Ambainis, Andris

AU - Nayak, Ashwin

AU - Ta-Shma, Amnon

AU - Vazirani, Umesh

PY - 1999

Y1 - 1999

N2 - We consider the possibility of encoding m classical bits into much fewer n quantum bits so that an arbitrary bit from the original m bits can be recovered with a good probability, and we show that non-trivial quantum encodings exist that have no classical counterparts. On the other hand, we show that quantum encodings cannot be much more succint as compared to classical encodings, and we provide a lower bound on such quantum encodings. Finally, using this lower bound, we prove an exponential lower bound on the size of 1-way quantum finite automata for a family of languages accepted by linear sized deterministic finite automata.

AB - We consider the possibility of encoding m classical bits into much fewer n quantum bits so that an arbitrary bit from the original m bits can be recovered with a good probability, and we show that non-trivial quantum encodings exist that have no classical counterparts. On the other hand, we show that quantum encodings cannot be much more succint as compared to classical encodings, and we provide a lower bound on such quantum encodings. Finally, using this lower bound, we prove an exponential lower bound on the size of 1-way quantum finite automata for a family of languages accepted by linear sized deterministic finite automata.

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

U2 - 10.1145/301250.301347

DO - 10.1145/301250.301347

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:0032631760

SP - 376

EP - 383

JO - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

JF - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

SN - 0734-9025

Y2 - 1 May 1999 through 4 May 1999

ER -

Dense quantum coding and a lower bound for 1-way quantum automata

Abstract

Access to Document

Other files and links

Fingerprint

Cite this