ISCAS OpenIR
a surprisingly simple way of reversing trace distance via entanglement
Yan Jun
2012
会议名称9th Annual Conference on Theory and Applications of Models of Computation, TAMC 2012
会议录名称Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
页码273-283
会议日期May 16, 2012 - May 21, 2012
会议地点Beijing, China
收录类别EI
ISSN0302-9743
ISBN9783642299513
部门归属(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
摘要Trace distance (between two quantum states) can be viewed as quantum generalization of statistical difference (between two probability distributions). On input a pair of quantum states (represented by quantum circuits), how to construct another pair, such that their trace distance is large (resp. small) if the original trace distance is small (resp. large)? That is, how to reverse trace distance? This problem originally arose in the study of statistical zero-knowledge quantum interactive proof. We discover a surprisingly simple way to do this job. In particular, our construction has two interesting features: first, entanglement plays a key role underlying our construction; second, strictly speaking, our construction is non-black-box. © 2012 Springer-Verlag.; Trace distance (between two quantum states) can be viewed as quantum generalization of statistical difference (between two probability distributions). On input a pair of quantum states (represented by quantum circuits), how to construct another pair, such that their trace distance is large (resp. small) if the original trace distance is small (resp. large)? That is, how to reverse trace distance? This problem originally arose in the study of statistical zero-knowledge quantum interactive proof. We discover a surprisingly simple way to do this job. In particular, our construction has two interesting features: first, entanglement plays a key role underlying our construction; second, strictly speaking, our construction is non-black-box. © 2012 Springer-Verlag.
关键词Probability Distributions
主办者State Key Laboratory of Computer Science; Chinese Academy of Sciences, Institute of Software; Chinese Academy of Sciences
语种英语
内容类型会议论文
URI标识http://ir.iscas.ac.cn/handle/311060/15717
专题中国科学院软件研究所
推荐引用方式
GB/T 7714
Yan Jun. a surprisingly simple way of reversing trace distance via entanglement[C],2012:273-283.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Yan Jun]的文章
百度学术
百度学术中相似的文章
[Yan Jun]的文章
必应学术
必应学术中相似的文章
[Yan Jun]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。