Institutional Repository
| complete problem for perfect zero-knowledge quantum proof | |
| Yan Jun | |
| 2012 | |
| Conference Name | 38th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2012 |
| Source | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Pages | 419-430 |
| Conference Date | January 21 |
| Conference Place | Spindleruv Mlyn, Czech republic |
| Indexed Type | EI |
| ISSN | 0302-9743 |
| ISBN | 9783642276590 |
| Department | (1) School of Computer Science and Technology University of Science and Technology of China Hefei Anhui 230027 China; (2) State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing 100190 China |
| English Abstract | The main purpose of this paper is to prove that (promise) problem Quantum State Identicalness (abbreviated QSI) is essentially complete for perfect zero-knowledge quantum interactive proof (QPZK). Loosely speaking, problem QSI is to decide whether two efficiently preparable quantum states (captured by quantum circuit of polynomial size) are identical or far apart (in trace distance). It is worthy noting that our result does not have classical counterpart yet; natural complete problem for perfect zero-knowledge interactive proof (PZK) is still unknown. Our proof generalizes Watrous' completeness proof for statistical zero-knowledge quantum interactive proof (QSZK), with an extra idea inspired by Malka to deal with completeness error. With complete problem at our disposal, we can immediately prove (and reprove) several interesting facts about QPZK. © 2012 Springer-Verlag.; The main purpose of this paper is to prove that (promise) problem Quantum State Identicalness (abbreviated QSI) is essentially complete for perfect zero-knowledge quantum interactive proof (QPZK). Loosely speaking, problem QSI is to decide whether two efficiently preparable quantum states (captured by quantum circuit of polynomial size) are identical or far apart (in trace distance). It is worthy noting that our result does not have classical counterpart yet; natural complete problem for perfect zero-knowledge interactive proof (PZK) is still unknown. Our proof generalizes Watrous' completeness proof for statistical zero-knowledge quantum interactive proof (QSZK), with an extra idea inspired by Malka to deal with completeness error. With complete problem at our disposal, we can immediately prove (and reprove) several interesting facts about QPZK. © 2012 Springer-Verlag. |
| Keyword | Computer Science Quantum Cryptography Quantum Optics |
| Language | 英语 |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/15682 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Yan Jun. complete problem for perfect zero-knowledge quantum proof[C],2012:419-430. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment