On the Possibility of Classical Client Blind Quantum Computing

被引:9
|
作者
Cojocaru, Alexandru [1 ]
Colisson, Leo [2 ]
Kashefi, Elham [1 ,2 ]
Wallden, Petros [1 ]
机构
[1] Univ Edinburgh, Sch Informat, Edinburgh EH8 9AB, Midlothian, Scotland
[2] Sorbonne Univ, Dept Informat & Reseaux, LIP6, F-75005 Paris, France
基金
英国工程与自然科学研究理事会;
关键词
remote state preparation; blind quantum computing; learning with errors; KEY-DISTRIBUTION; CRYPTOGRAPHY;
D O I
10.3390/cryptography5010003
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Classical client remote state preparation (CC - RSP) is a primitive where a fully classical party (client) can instruct the preparation of a sequence of random quantum states on some distant party (server) in a way that the description is known to the client but remains hidden from the server. This primitive has many applications, most prominently, it makes blind quantum computing possible for classical clients. In this work, we give a protocol for classical client remote state preparation, that requires minimal resources. The protocol is proven secure against honest-but-curious servers and any malicious third party in a game-based security framework. We provide an instantiation of a trapdoor (approximately) 2-regular family of functions whose security is based on the hardness of the Learning-With-Errors problem, including a first analysis of the set of usable parameters. We also run an experimentation on IBM's quantum cloud using a toy function. This is the first proof-of-principle experiment of classical client remote state preparation.
引用
收藏
页码:1 / 50
页数:50
相关论文
共 50 条
  • [1] Experimental Blind Quantum Computing for a Classical Client
    Huang, He-Liang
    Zhao, Qi
    Ma, Xiongfeng
    Liu, Chang
    Su, Zu-En
    Wang, Xi-Lin
    Li, Li
    Liu, Nai-Le
    Sanders, Barry C.
    Lu, Chao-Yang
    Pan, Jian-Wei
    [J]. PHYSICAL REVIEW LETTERS, 2017, 119 (05)
  • [2] IMPOSSIBILITY OF BLIND QUANTUM SAMPLING FOR CLASSICAL CLIENT
    Morimae, Tomoyuki
    Nishimura, Harumichi
    Takeuchi, Yuki
    Tani, Seiichiro
    [J]. QUANTUM INFORMATION & COMPUTATION, 2019, 19 (9-10) : 793 - 806
  • [3] Impossibility of blind quantum sampling for classical client
    Morimae, Tomoyuki
    Nishimura, Harumichi
    Takeuchi, Yuki
    Tani, Seiichiro
    [J]. Quantum Information and Computation, 2019, 19 (9-10): : 793 - 806
  • [4] Client-friendly continuous-variable blind and verifiable quantum computing
    Liu, Nana
    Demarie, Tommaso F.
    Tan, Si-Hui
    Aolita, Leandro
    Fitzsimons, Joseph F.
    [J]. PHYSICAL REVIEW A, 2019, 100 (06)
  • [5] Quantum Computing’s Classical Problem, Classical Computing’s Quantum Problem
    Rodney Van Meter
    [J]. Foundations of Physics, 2014, 44 : 819 - 828
  • [6] Quantum Computing's Classical Problem, Classical Computing's Quantum Problem
    Van Meter, Rodney
    [J]. FOUNDATIONS OF PHYSICS, 2014, 44 (08) : 819 - 828
  • [7] From classical computing to quantum computing
    Barila, Adina
    [J]. 2014 INTERNATIONAL CONFERENCE ON DEVELOPMENT AND APPLICATION SYSTEMS (DAS), 2014, : 196 - 203
  • [8] IMPOSSIBILITY OF PERFECTLY-SECURE ONE-ROUND DELEGATED QUANTUM COMPUTING FOR CLASSICAL CLIENT
    Morimae, Tomoyuki
    Koshiba, Takeshi
    [J]. QUANTUM INFORMATION & COMPUTATION, 2019, 19 (3-4) : 214 - 221
  • [9] Distributed Quantum Computing via Integrating Quantum and Classical Computing
    Tang, Wei
    Martonosi, Margaret
    Jones, Timothy
    Mullins, Robert
    [J]. COMPUTER, 2024, 57 (04) : 131 - 136
  • [10] Quantum computing classical physics
    Meyer, DA
    [J]. PHILOSOPHICAL TRANSACTIONS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES, 2002, 360 (1792): : 395 - 405