complete problem for perfect zero-knowledge quantum proof
文献类型：会议论文
| 作者 | Yan Jun |
| 出版日期 | 2012 |
| 会议名称 | 38th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2012 |
| 会议日期 | January 21 |
| 会议地点 | Spindleruv Mlyn, Czech republic |
| 关键词 | Computer science Quantum cryptography Quantum optics |
| 页码 | 419-430 |
| 中文摘要 | 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. |
| 收录类别 | EI |
| 会议录 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
 |
| 语种 | 英语 |
| ISSN号 | 0302-9743 |
| ISBN号 | 9783642276590 |
| 源URL | [http://ir.iscas.ac.cn/handle/311060/15682]  |
| 专题 | 软件研究所_软件所图书馆_会议论文 |
| 推荐引用方式 GB/T 7714 | Yan Jun. complete problem for perfect zero-knowledge quantum proof[C]. 见:38th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2012. Spindleruv Mlyn, Czech republic. January 21. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。