On the Hardness of the Minimum Distance Problem of Quantum Codes
Author:
Affiliation:
1. Centre of Quantum Technologies, National University of Singapore, Queenstown, Singapore
2. Institute for Quantum Computing, University of Waterloo, Waterloo, Canada
Funder
NRF
Innovation, Science and Economic Development (ISED), Canada, through the NSERC Canada Discovery Grants Program and Fujitsu Labs America; research at the Institute for Quantum Computing
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Subject
Library and Information Sciences,Computer Science Applications,Information Systems
Link
http://xplorestaging.ieee.org/ielx7/18/10253618/10154053.pdf?arnumber=10154053
Reference18 articles.
1. Hardness of Decoding Quantum Stabilizer Codes
2. On the hardnesses of several quantum decoding problems
3. Lecture notes for physics 229: Quantum information and computation;preskill;California Institute of Technology,1998
4. Theory of quantum error-correcting codes
5. Quantum McEliece public-key cryptosystem
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3