Equivalence in delegated quantum computing

• URL: http://arxiv.org/abs/2206.07469v3
• Date: Fri, 14 Apr 2023 11:03:18 GMT
• Title: Equivalence in delegated quantum computing
• Authors: Fabian Wiesner, Jens Eisert, Anna Pappa
• Abstract summary: Delegated quantum computing (DQC) enables limited clients to perform operations that are outside their capabilities remotely on a quantum server. Two approaches are followed in DQC that demand completely different operations on the clients' side. In this work, we provide a novel stringent definition of the equivalence of protocols and show that these distinct DQC settings are, in fact, equivalent in this sense.
• Score: 0.7734726150561088
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Delegated quantum computing (DQC) enables limited clients to perform operations that are outside their capabilities remotely on a quantum server. Protocols for DQC are usually set up in the measurement-based quantum computation framework, as this allows for a natural separation of the different parts of the computation between the client and the server. The existing protocols achieve several desired properties, including the security of inputs, the blindness of computation and its verifiability, and have also recently been extended to the multiparty setting. Two approaches are followed in DQC that demand completely different operations on the clients' side. In one, the clients are able to prepare quantum states, in the other, the clients are able to measure them. In this work, we provide a novel stringent definition of the equivalence of protocols and show that these distinct DQC settings are, in fact, equivalent in this sense. We use the abstract cryptography framework to prove our claims and provide a novel technique that enables changing from one setting to the other. In this way, we demonstrate that both approaches can be used to perform tasks with the same properties. I.e., using our proposed techniques, we can always translate from one setting to the other. We finally use our results to propose a hybrid-client model for DQC.

Related papers

• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Multi-client distributed blind quantum computation with the Qline architecture [0.0]
  Universal blind quantum computing allows users with minimal quantum resources to delegate a quantum computation to a remote quantum server. We propose and experimentally demonstrate a lightweight multi-client blind quantum computation protocol based on a novel linear quantum network configuration.
  arXiv  Detail & Related papers  (2023-06-08T13:50:02Z)
• Robust and efficient verification of graph states in blind measurement-based quantum computation [52.70359447203418]
  Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients. It is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario. Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension.
  arXiv  Detail & Related papers  (2023-05-18T06:24:45Z)
• Quantum Imitation Learning [74.15588381240795]
  We propose quantum imitation learning (QIL) with a hope to utilize quantum advantage to speed up IL. We develop two QIL algorithms, quantum behavioural cloning (Q-BC) and quantum generative adversarial imitation learning (Q-GAIL) Experiment results demonstrate that both Q-BC and Q-GAIL can achieve comparable performance compared to classical counterparts.
  arXiv  Detail & Related papers  (2023-04-04T12:47:35Z)
• Delegated variational quantum algorithms based on quantum homomorphic encryption [69.50567607858659]
  Variational quantum algorithms (VQAs) are one of the most promising candidates for achieving quantum advantages on quantum devices. The private data of clients may be leaked to quantum servers in such a quantum cloud model. A novel quantum homomorphic encryption (QHE) scheme is constructed for quantum servers to calculate encrypted data.
  arXiv  Detail & Related papers  (2023-01-25T07:00:13Z)
• Ancilla-driven blind quantum computation for clients with different quantum capabilities [2.2591663389676295]
  Blind quantum computation (BQC) allows a client with limited quantum power to delegate his quantum computational task to a powerful server. This paper proposes two types of ADBQC protocols for clients with different quantum capabilities, such as performing single-qubit measurements or single-qubit gates.
  arXiv  Detail & Related papers  (2022-10-18T14:12:34Z)
• Verifiable blind quantum computation with identity authentication for different types of clients [3.0058005235097123]
  Blind quantum computing (BQC) provides a solution for clients with limited quantum capabilities to delegate their quantum computation to remote quantum servers while keeping input, output, and even algorithm private. In this paper, we propose three multi-party verifiable blind quantum computing (VBQC) protocols with identity authentication to handle clients with varying quantum capabilities in quantum networks.
  arXiv  Detail & Related papers  (2022-10-18T13:21:34Z)
• Gradient-descent quantum process tomography by learning Kraus operators [63.69764116066747]
  We perform quantum process tomography (QPT) for both discrete- and continuous-variable quantum systems. We use a constrained gradient-descent (GD) approach on the so-called Stiefel manifold during optimization to obtain the Kraus operators. The GD-QPT matches the performance of both compressed-sensing (CS) and projected least-squares (PLS) QPT in benchmarks with two-qubit random processes.
  arXiv  Detail & Related papers  (2022-08-01T12:48:48Z)
• Unifying Quantum Verification and Error-Detection: Theory and Tools for Optimisations [0.5825410941577593]
  Cloud-based quantum computing has become vital to provide strong guarantees that computations delegated by clients to quantum service providers have been executed faithfully. Current protocols lack at least one of the following three ingredients: composability, noise-robustness and modularity. This paper lays out the fundamental structure of SDQC protocols, namely mixing two components: the Cryptography which the client would like the server to perform and tests that are designed to detect a server's malicious behaviour. Changing the types of tests and how they are mixed with the client's computation automatically yields new SDQC protocols with different security and noise-
  arXiv  Detail & Related papers  (2022-06-01T17:03:07Z)
• Blind quantum computation for a user who only performs single-qubit gates [4.6079000547878755]
  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. One is that the client just needs the ability to prepare single qubits initiated by Broadbent, Fitzsimons, and Kashefi. The other is that the client only needs perform single-qubit measurements first given by Morimae.
  arXiv  Detail & Related papers  (2020-06-14T15:36:28Z)
• Genuine quantum networks: superposed tasks and addressing [68.8204255655161]
  We show how to make quantum networks, both standard and entanglement-based, genuine quantum. We provide them with the possibility of handling superposed tasks and superposed addressing.
  arXiv  Detail & Related papers  (2020-04-30T18:00:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.