A Provably Secure Framework for Noise-Aware Delegated Quantum Computation and Storage

• URL: http://arxiv.org/abs/2403.07596v2
• Date: Mon, 22 Sep 2025 06:22:50 GMT
• Title: A Provably Secure Framework for Noise-Aware Delegated Quantum Computation and Storage
• Authors: Sanidhya Gupta, Ankur Raina,
• Abstract summary: This paper presents a complete end-to-end framework for noise-aware distributed quantum computation.<n>We provide a security analysis to prove that our framework achieves completeness, blindness, and verifiability.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: As large-scale quantum computers become a reality, they will likely exist as centralized cloud resources accessible to a broad user base. Securely delegating private quantum computations to untrusted servers is therefore a foundational challenge. This requires rigorous, provable guarantees of privacy (blindness), cor- rectness (completeness), and integrity against malicious actions (verifiability). This paper presents a complete end-to-end framework for noise-aware distributed quantum computation. Our architecture is built on three technical pillars: (1) a distributed stabilizer code backbone to securely encode and store quantum states across multiple non-communicating server nodes; (2) a two-level error correction scheme, where each server node can locally correct errors based on its specific noise model; and (3) a trap-based verification protocol to detect any malicious deviation by the server. We formally provide a security analysis to prove that our framework achieves completeness, blindness, and verifiability. Our work thus provides a practical and provably secure blueprint for trustworthy distributed quantum computation framework, paving the way for secure quantum cloud services.

Related papers

• Noise-Robustness for Delegated Quantum Computation in the Circuit Model [0.6015898117103068]
  Cloud-based quantum computing brings to forefront the question of verifiability in delegated quantum computations.<n>In this work, we revisit the circuit-based framework for verifiable quantum computation introduced by Broadbent [Theory of Computing, 2018], and extend it to the setting of server-side noise.<n>Our contribution is an improved upper bound on the noise-tolerance threshold, achieved through a protocol that interleaves computation and test rounds in an indistinguishable manner.
  arXiv  Detail & Related papers  (2025-11-28T02:40:58Z)
• Plugging Leaks in Fault-Tolerant Quantum Computation and Verification [0.03499870393443268]
  We present the first fault-tolerant blind verification scheme for universal quantum computations able to handle secret-dependent noise on the verifier's quantum device.<n>Our main tools are two novel distillation protocols that turn secret-dependent noise into secret-independent noise.<n>We use these protocols to prepare states in the X-Y-plane whose noise is overwhelmingly secret-independent, which then allows us to verify with exponential confidence arbitrary fault-tolerant BQP computations.
  arXiv  Detail & Related papers  (2025-10-03T17:57:59Z)
• Distributed quantum computing with black-box subroutines [0.0]
  We propose a general protocol for distributed quantum computing that accommodates arbitrary unknown subroutines.<n>It can be applied to scale up quantum computing through multi-chip interconnection.<n>We demonstrate that this protocol can be physically implemented using currently available quantum computing platforms.
  arXiv  Detail & Related papers  (2025-05-20T15:44:54Z)
• Composably Secure Delegated Quantum Computation with Weak Coherent Pulses [0.0]
  Secure Delegated Quantum Computation protocols allow a client to delegate a quantum computation to a powerful remote server.<n>This paper shows how to alleviate the necessity for the client to have a single-photon source.<n>It proposes a protocol that ensures that among a sufficiently large block of transmitted weak coherent pulses, at least one of them was emitted as a single photon.
  arXiv  Detail & Related papers  (2025-03-11T15:47:52Z)
• Universal distributed blind quantum computing with solid-state qubits [0.0]
  Blind quantum computing is a promising application of distributed quantum systems. We experimentally demonstrate a universal quantum gate set consisting of single- and two-qubit blind gates over a distributed two-node network. We perform a distributed algorithm with blind operations across our two-node network, paving the way towards blind quantum computation with matter qubits in distributed, modular architectures.
  arXiv  Detail & Related papers  (2024-12-04T04:13:46Z)
• Sound certification of memory-bounded quantum computers [0.1874930567916036]
  We introduce an approach, which we call quantum system quizzing, for the certification of quantum gates in a practical server-user scenario.<n> Importantly, this approach does not require trusted state preparation and measurement and is thus inherently free from the associated systematic errors.<n>A major technical challenge that we are first to resolve in the memory-bounded single-device setup is recovering the tensor product structure of a multi-qubit system.
  arXiv  Detail & Related papers  (2024-11-06T19:23:45Z)
• 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)
• Single-Round Proofs of Quantumness from Knowledge Assumptions [41.94295877935867]
  A proof of quantumness is an efficiently verifiable interactive test that an efficient quantum computer can pass. Existing single-round protocols require large quantum circuits, whereas multi-round ones use smaller circuits but require experimentally challenging mid-circuit measurements. We construct efficient single-round proofs of quantumness based on existing knowledge assumptions.
  arXiv  Detail & Related papers  (2024-05-24T17:33:10Z)
• 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)
• Service Differentiation and Fair Sharing in Distributed Quantum Computing [0.0]
  In the future, quantum computers will become widespread and a network of quantum repeaters will provide them with end-to-end entanglement of remote quantum bits. This paper investigates the issue of service differentiation in this new environment. We then define the problem of how to select which computation nodes should participate in each pool.
  arXiv  Detail & Related papers  (2023-01-10T14:16:42Z)
• QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional Networks [124.7972093110732]
  We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations. To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections. Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
  arXiv  Detail & Related papers  (2022-11-09T21:43:16Z)
• 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)
• Iterative Qubits Management for Quantum Index Searching in a Hybrid System [56.39703478198019]
  IQuCS aims at index searching and counting in a quantum-classical hybrid system. We implement IQuCS with Qiskit and conduct intensive experiments. Results demonstrate that it reduces qubits consumption by up to 66.2%.
  arXiv  Detail & Related papers  (2022-09-22T21:54:28Z)
• Quantum reservoir neural network implementation on coherently coupled quantum oscillators [1.7086737326992172]
  We propose an implementation for quantum reservoir that obtains a large number of densely connected neurons. We analyse a specific hardware implementation based on superconducting circuits. We obtain state-of-the-art accuracy of 99 % on benchmark tasks.
  arXiv  Detail & Related papers  (2022-09-07T15:24:51Z)
• Quantum Network Tomography with Multi-party State Distribution [10.52717496410392]
  characterization of quantum channels in a quantum network is of paramount importance. We introduce the problem of Quantum Network Tomography. We study this problem in detail for the case of arbitrary star quantum networks with quantum channels described by a single Pauli operator.
  arXiv  Detail & Related papers  (2022-06-06T21:47:09Z)
• Quantum Proofs of Deletion for Learning with Errors [91.3755431537592]
  We construct the first fully homomorphic encryption scheme with certified deletion. Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
  arXiv  Detail & Related papers  (2022-03-03T10:07:32Z)
• A Hybrid Quantum-Classical Algorithm for Robust Fitting [47.42391857319388]
  We propose a hybrid quantum-classical algorithm for robust fitting. Our core contribution is a novel robust fitting formulation that solves a sequence of integer programs. We present results obtained using an actual quantum computer.
  arXiv  Detail & Related papers  (2022-01-25T05:59:24Z)
• Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms [55.41644538483948]
  We provide the first complete characterization of sources of error in a neutral-atom quantum computer. We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace. Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
  arXiv  Detail & Related papers  (2021-05-27T23:29:53Z)
• 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)
• Efficient CNOT Synthesis for NISQ Devices [1.0152838128195467]
  In the era of noisy intermediate-scale quantum (NISQ), executing quantum algorithms on actual quantum devices faces unique challenges. We propose a CNOT synthesis method called the token reduction method to solve this problem. Our algorithm consistently outperforms the best publicly accessible algorithm for all of the tested quantum architectures.
  arXiv  Detail & Related papers  (2020-11-12T15:13:32Z)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)
• Security Limitations of Classical-Client Delegated Quantum Computing [54.28005879611532]
  A client remotely prepares a quantum state using a classical channel. Privacy loss incurred by employing $RSP_CC$ as a sub-module is unclear. We show that a specific $RSP_CC$ protocol can replace the quantum channel at least in some contexts.
  arXiv  Detail & Related papers  (2020-07-03T13:15:13Z)
• Realising and compressing quantum circuits with quantum reservoir computing [2.834895018689047]
  We show how a random network of quantum nodes can be used as a robust hardware for quantum computing. Our network architecture induces quantum operations by optimising only a single layer of quantum nodes. In the few-qubit regime, sequences of multiple quantum gates in quantum circuits can be compressed with a single operation.
  arXiv  Detail & Related papers  (2020-03-21T03:29:16Z)
• Quantum noise protects quantum classifiers against adversaries [120.08771960032033]
  Noise in quantum information processing is often viewed as a disruptive and difficult-to-avoid feature, especially in near-term quantum technologies. We show that by taking advantage of depolarisation noise in quantum circuits for classification, a robustness bound against adversaries can be derived. This is the first quantum protocol that can be used against the most general adversaries.
  arXiv  Detail & Related papers  (2020-03-20T17:56:14Z)

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.