Multi-client distributed blind quantum computation with the Qline architecture

Type: Article

Publication Date: 2023-11-25

Citations: 5

DOI: https://doi.org/10.1038/s41467-023-43617-0

Abstract

Universal blind quantum computing allows users with minimal quantum resources to delegate a quantum computation to a remote quantum server, while keeping intrinsically hidden input, algorithm, and outcome. State-of-art experimental demonstrations of such a protocol have only involved one client. However, an increasing number of multi-party algorithms, e.g. federated machine learning, require the collaboration of multiple clients to carry out a given joint computation. In this work, we propose and experimentally demonstrate a lightweight multi-client blind quantum computation protocol based on a recently proposed linear quantum network configuration (Qline). Our protocol originality resides in three main strengths: scalability, since we eliminate the need for each client to have its own trusted source or measurement device, low-loss, by optimizing the orchestration of classical communication between each client and server through fast classical electronic control, and compatibility with distributed architectures while remaining intact even against correlated attacks of server nodes and malicious clients.

Locations

Similar Works

Action Title Year Authors
+ Multi-client distributed blind quantum computation with the Qline architecture 2023 Beatrice Polacchi
Dominik Leichtle
Leonardo Limongi
Gonzalo Carvacho
Giorgio Milani
Nicolò Spagnolo
Marc Kaplan
Fabio Sciarrino
Elham Kashefi
+ PDF Chat Experimental verifiable multi-client blind quantum computing on a Qline architecture 2024 Beatrice Polacchi
Dominik Leichtle
Gonzalo Carvacho
Giorgio Milani
Nicolò Spagnolo
Marc Kaplan
Elham Kashefi
Fabio Sciarrino
+ PDF Chat Multi-server blind quantum computation protocol with limited classical communication among servers 2022 Yuichi Sano
+ Blind Multiparty Quantum Computing 2016 Elham Kashefi
Anna Pappa
+ PDF Chat Demonstration of Blind Quantum Computing 2012 Stefanie Barz
Elham Kashefi
Anne Broadbent
Joseph F. Fitzsimons
Anton Zeilinger
Philip Walther
+ Blind quantum computing with two almost identical states 2016 Vedran Dunjko
Elham Kashefi
+ Universal Single-Server Blind Quantum Computation for Classical Clients 2014 Hai-Ru Xu
Bang-Hai Wang
+ PDF Chat Multiparty Delegated Quantum Computing 2017 Elham Kashefi
Anna Pappa
+ Blind quantum machine learning with quantum bipartite correlator 2023 Changhao Li
Boning Li
Omar Amer
Ruslan Shaydulin
Shouvanik Chakrabarti
Guoqing Wang
Haowei Xu
Hao Tang
Isidor Schoch
Niraj Kumar
+ PDF Chat Universal single-server blind quantum computation for classical clients 2021 Hai-Ru Xu
Bang-Hai Wang
+ Verifiable blind quantum computation with identity authentication for different types of clients 2022 Junyu Quan
Qin Li
Lvzhou Li
+ Blind Oracular Quantum Computation 2020 Cica Gustiani
David P. DiVincenzo
+ Blind oracular quantum computation 2021 Cica Gustiani
David P. DiVincenzo
+ PDF Chat Equivalence of single-server and multiple-server blind quantum computation protocols 2023 Yuichi Sano
+ PDF Chat Demonstration of measurement-only blind quantum computing 2016 Chiara Greganti
Marie-Christine Roehsner
Stefanie Barz
Tomoyuki Morimae
Philip Walther
+ PDF Chat Optimal Blind Quantum Computation 2013 Atul Mantri
Carlos A. Pérez-Delgado
Joseph F. Fitzsimons
+ PDF Chat Experimental Blind Quantum Computing for a Classical Client 2017 He-Liang Huang
Qi Zhao
Xiongfeng Ma
Chang Liu
Zu-En Su
Xi‐Lin Wang
Li Li
Nai-Le Liu
Barry C. Sanders
Chao‐Yang Lu
+ Blind quantum computation with completely classical client and a trusted center 2015 Min Liang
+ PDF Chat Measurement-based universal blind quantum computation with minor resources 2021 Xiaoqian Zhang
+ PDF Chat Verifying BQP Computations on Noisy Devices with Minimal Overhead 2021 Dominik Leichtle
Luka Music
Elham Kashefi
H Ollivier