English
Related papers

Related papers: Verified Delegated Quantum Computing with One Pure…

200 papers

In blind quantum computation (BQC), a client delegates her quantum computation to a server with universal quantum computers who learns nothing about the client's private information. In measurement-based BQC model, entangled states are…

Quantum Physics · Physics 2019-08-27 Xiaoqian Zhang , Weiqi Luo , Guoqiang Zeng , Jian Weng , Yaxi Yang , Minrong Chen , Xiaoqing Tan

Blind Quantum Computing (BQC) allows a client to have a server carry out a quantum computation for them such that the client's input, output and computation remain private. A desirable property for any BQC protocol is verification, whereby…

Quantum Physics · Physics 2017-07-12 Joseph F. Fitzsimons , Elham Kashefi

In the medium term, quantum computing must tackle two key challenges: fault tolerance and security. Fault tolerance will be solved with sufficiently high quality experiments on large numbers of qubits, but the scale and complexity of these…

Quantum Physics · Physics 2024-04-11 Ethan Davies , Alastair Kay

Recent advances in theoretical and experimental quantum computing bring us closer to scalable quantum computing devices. This makes the need for protocols that verify the correct functionality of quantum operations timely and has led to the…

Quantum Physics · Physics 2015-08-26 Alexandru Gheorghiu , Elham Kashefi , Petros Wallden

Blind quantum computation is a scheme that adds unconditional security to cloud quantum computation. In the protocol proposed by Broadbent, Fitzsimons, and Kashefi, the ability to prepare and transmit a single qubit is required for a user…

Quantum Physics · Physics 2019-04-24 Kurumiko Nagao , Tomoyuki Horikiri , Toshihiko Sasaki

Quantum technologies hold the promise of not only faster algorithmic processing of data, via quantum computation, but also of more secure communications, in the form of quantum cryptography. In recent years, a number of protocols have…

Quantum Physics · Physics 2016-12-01 Joseph F. Fitzsimons

Verification of quantum computation is a task to efficiently check whether an output given from a quantum computer is correct. Existing verification protocols conducted between a quantum computer to be verified and a verifier necessitate…

Quantum Physics · Physics 2024-04-01 Yuki Takeuchi , Akihiro Mizutani

We present a quantumly-enhanced protocol to achieve unconditionally secure delegated classical computation where the client and the server have both limited classical and quantum computing capacity. We prove the same task cannot be achieved…

Quantum Physics · Physics 2014-05-20 Vedran Dunjko , Theodoros Kapourniotis , Elham Kashefi

The exploitation of certification tools by end users represents a fundamental aspect of the development of quantum technologies as the hardware scales up beyond the regime of classical simulatability. Certifying quantum networks becomes…

Blind quantum computing enables a client, who does not have enough quantum technologies, to delegate her quantum computing to a remote quantum server in such a way that her privacy is protected against the server. Some blind quantum…

Quantum Physics · Physics 2018-03-21 Tomoyuki Morimae

In the absence of any efficient classical schemes for verifying a universal quantum computer, the importance of limiting the required quantum resources for this task has been highlighted recently. Currently, most of efficient quantum…

Quantum Physics · Physics 2015-06-24 Theodoros Kapourniotis , Vedran Dunjko , Elham Kashefi

We introduce a protocol between a classical polynomial-time verifier and a quantum polynomial-time prover that allows the verifier to securely delegate to the prover the preparation of certain single-qubit quantum states. The protocol…

Quantum Physics · Physics 2019-04-15 Alexandru Gheorghiu , Thomas Vidick

The efficient certification of classically intractable quantum devices has been a central research question for some time. However, to observe a "quantum advantage", it is believed that one does not need to build a large scale universal…

Quantum Physics · Physics 2018-03-05 Daniel Mills , Anna Pappa , Theodoros Kapourniotis , Elham Kashefi

Cloud-based quantum computing, coupled with the rapid progress in quantum algorithms, brings to the forefront the question of verifiability in delegated quantum computations. In the current landscape of noisy quantum devices, this question…

Quantum Physics · Physics 2025-12-01 Anne Broadbent , Joshua Nevin

Blind quantum computation protocols allow a user with limited quantum technology to delegate an intractable computation to a quantum server while keeping the computation perfectly secret. Whereas in some protocols a user can verify that…

Quantum Physics · Physics 2016-04-04 Kentaro Honda

Blind quantum computation allows a client without enough quantum technologies to delegate her quantum computation to a remote quantum server, while keeping her input, output and algorithm secure. In this paper, we propose a universal…

Quantum Physics · Physics 2021-12-07 Hai-Ru Xu , Bang-Hai Wang

With the advent of cloud-based quantum computing, it has become vital to provide strong guarantees that computations delegated by clients to quantum service providers have been executed faithfully. Secure - blind and verifiable - Delegated…

Quantum Physics · Physics 2024-05-06 Theodoros Kapourniotis , Elham Kashefi , Dominik Leichtle , Luka Music , Harold Ollivier

With experimental quantum computing technologies now in their infancy, the search for efficient means of testing the correctness of these quantum computations is becoming more pressing. An approach to the verification of quantum computation…

Quantum Physics · Physics 2018-04-18 Alexandru Gheorghiu , Matty J. Hoban , Elham Kashefi

Blind quantum computation (BQC) allows a user who has limited quantum capability to complete a quantum computational task with the aid of a remote quantum server, such that the user's input, output, and even the algorithm can be kept hidden…

Quantum Physics · Physics 2021-06-02 Qin Li , Chengdong Liu , Yu Peng , Fang Yu , Cai Zhang

We give a new theoretical solution to a leading-edge experimental challenge, namely to the verification of quantum computations in the regime of high computational complexity. Our results are given in the language of quantum interactive…

Quantum Physics · Physics 2018-06-25 Anne Broadbent