Verified delegated quantum computation requires techniques beyond cut-and-choose

• URL: http://arxiv.org/abs/2603.09368v1
• Date: Tue, 10 Mar 2026 08:45:23 GMT
• Title: Verified delegated quantum computation requires techniques beyond cut-and-choose
• Abstract summary: Delegated quantum computation enables a client with limited quantum capabilities to outsource computations to a more powerful quantum server.<n>A common verification method is the quantum cut-and-choose technique.<n>We investigate whether cut-and-choose can yield efficient and secure verifiable quantum computation without additional costly techniques.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Delegated quantum computation enables a client with limited quantum capabilities to outsource computations to a more powerful quantum server while preserving correctness and privacy. Verification is crucial in this setting to ensure that the untrusted quantum server performs the computation honestly and returns correct results. A common verification method is the quantum cut-and-choose technique. Inspired by classical verification methods for two-party computation, the client uses the majority of the delegated rounds to test the server's honesty, while keeping the remaining ones for the actual computation. Combining this technique with other methods, such as quantum error correction, could help achieve negligible cheating probabilities for the server; however, such methods can impose significant overheads making implementations unfeasible for the near-term future. In this work, we investigate whether cut-and-choose can yield efficient and secure verifiable quantum computation without additional costly techniques. We find that verifiable delegated quantum computation protocols relying solely on cut-and-choose techniques cannot be secure and efficient at the same time.

Related papers

• Reinforcement Learning Control of Quantum Error Correction [108.70420561323692]
  Quantum computer learns to self-improve directly from its errors and never stops computing.<n>This work enables a new paradigm: a quantum computer that learns to self-improve directly from its errors and never stops computing.
  arXiv  Detail & Related papers  (2025-11-11T17:32:25Z)
• Verifiable End-to-End Delegated Variational Quantum Algorithms [0.0]
  Variational quantum algorithms (VQAs) have emerged as promising candidates for solving complex optimization and machine learning tasks on near-term quantum hardware.<n> executing quantum operations remains challenging for small-scale users because of several hardware constraints.<n>We introduce a framework for delegated variational quantum algorithms, where a client with limited quantum capabilities delegates the execution of a VQA to a more powerful quantum server.
  arXiv  Detail & Related papers  (2025-04-21T19:36:42Z)
• On-Chip Verified Quantum Computation with an Ion-Trap Quantum Processing Unit [0.5497663232622965]
  We present and experimentally demonstrate a novel approach to verification and benchmarking of quantum computing.<n>Unlike previous information-theoretically secure verification protocols, our approach is implemented entirely on-chip.<n>Our results pave the way for more accessible and efficient verification and benchmarking strategies in near-term quantum devices.
  arXiv  Detail & Related papers  (2024-10-31T16:54:41Z)
• The curse of random quantum data [62.24825255497622]
  We quantify the performances of quantum machine learning in the landscape of quantum data. We find that the training efficiency and generalization capabilities in quantum machine learning will be exponentially suppressed with the increase in qubits. Our findings apply to both the quantum kernel method and the large-width limit of quantum neural networks.
  arXiv  Detail & Related papers  (2024-08-19T12:18:07Z)
• Experimental verifiable multi-client blind quantum computing on a Qline architecture [0.5018974919510384]
  We provide the first experimental implementation of a two-client verifiable blind quantum computing protocol in a distributed architecture. Results represent novel perspectives for the verification of multi-tenant distributed quantum computation in large-scale networks.
  arXiv  Detail & Related papers  (2024-07-12T14:48:58Z)
• Verification of Quantum Computations without Trusted Preparations or Measurements [0.6249768559720122]
  We present a modular, composable, and efficient way to turn known verification schemes into protocols that rely only on trusted gates. Our first contribution is an extremely lightweight reduction of the problem of quantum verification for BQP to the trusted application of single-qubit rotations around the Z axis and bit flips. The second construction shows that it is generally possible to information-theoretically verify arbitrary quantum computations with quantum output without trusted preparations or measurements.
  arXiv  Detail & Related papers  (2024-03-15T16:54:28Z)
• 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)
• 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)
• Oblivious Quantum Computation and Delegated Multiparty Quantum Computation [61.12008553173672]
  We propose a new concept, oblivious computation quantum computation, where secrecy of the input qubits and the program to identify the quantum gates are required. Exploiting quantum teleportation, we propose a two-server protocol for this task. Also, we discuss delegated multiparty quantum computation, in which, several users ask multiparty quantum computation to server(s) only using classical communications.
  arXiv  Detail & Related papers  (2022-11-02T09:01:33Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Delegating Multi-Party Quantum Computations vs. Dishonest Majority in Two Quantum Rounds [0.0]
  Multi-Party Quantum Computation (MPQC) has attracted a lot of attention as a potential killer-app for quantum networks. We present a composable protocol achieving blindness and verifiability even in the case of a single honest client.
  arXiv  Detail & Related papers  (2021-02-25T15:58:09Z)

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.