Demonstration of Blind Quantum Computing

Author:

Barz Stefanie12,Kashefi Elham3,Broadbent Anne45,Fitzsimons Joseph F.67,Zeilinger Anton12,Walther Philip12

Affiliation:

1. Vienna Center for Quantum Science and Technology, Faculty of Physics, University of Vienna, Boltzmanngasse 5, A-1090 Vienna, Austria.

2. Institute for Quantum Optics and Quantum Information, Austrian Academy of Sciences, Boltzmanngasse 3, A-1090 Vienna, Austria.

3. School of Informatics, University of Edinburgh, 10 Crichton Street, Edinburgh EH8 9AB, UK.

4. Institute for Quantum Computing, University of Waterloo, 200 University Avenue West, Waterloo, Ontario N2L 3G1, Canada.

5. Department of Combinatorics and Optimization, University of Waterloo, 200 University Avenue West, Waterloo, Ontario N2L 3G1, Canada.

6. Centre for Quantum Technologies, National University of Singapore, Block S15, 3 Science Drive 2, 117543 Singapore.

7. School of Physics, University College Dublin, Belfield, Dublin 4, Ireland.

Abstract

Quantum Blindness While quantum computers offer speed advantages over their classical counterparts, the technological challenges facing their eventual realization suggest that they will need to be located in specialized facilities. Thus, interaction would then need to be on a quantum client:quantum server basis. Barz et al. (p. 303 ; see the Perspective by Vedral ) implemented a proof-of-principle protocol that illustrates complete security in such a setup—for both the client and the server. In this blind quantum computing protocol, the client maintains the security of their data and the specifics of the calculation they want to perform, and the server cannot access the data or calculation of the client.

Funder

Air Force Office of Scientific Research

Publisher

American Association for the Advancement of Science (AAAS)

Subject

Multidisciplinary

Reference50 articles.

1. Simulating physics with computers

2. Rapid solution of problems by quantum computation

3. L. K. Grover in Proceedings of the 28th Annual ACM Symposium on the Theory of Computing G. L. Miller Ed. [Association for Computing Machinery (ACM) New York 1996] pp. 212–219.

4. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

5. Quantum Computations with Cold Trapped Ions

Cited by 303 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3