Noise Inference by Recycling Test Rounds in Verification Protocols

• URL: http://arxiv.org/abs/2603.30015v1
• Date: Tue, 31 Mar 2026 17:15:20 GMT
• Title: Noise Inference by Recycling Test Rounds in Verification Protocols
• Abstract summary: Interactive verification protocols for quantum computations allow to build trust between a client and a service provider.<n>We show that the repetition overhead of protocols with quantum communication can be further mitigated if one examines the task of operating a quantum machine from the service provider's point of view.
• Score: 0.3826963271075334
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Interactive verification protocols for quantum computations allow to build trust between a client and a service provider, ensuring the former that the instructed computation was carried out faithfully. They come in two variants, one without quantum communication that requires large overhead on the server side to coherently implement quantum-resistant cryptographic primitives, and one with quantum communication but with repetition as the only overhead on the service provider's side. Given the limited number of available qubits on current machines, only quantum communication-based protocols have yielded proof of concepts. In this work, we show that the repetition overhead of protocols with quantum communication can be further mitigated if one examines the task of operating a quantum machine from the service provider's point of view. Indeed, we show that the test rounds data, whose collection is necessary to provide security, can indeed be recycled to perform continuous monitoring of noise model parameters for the service provider. This exemplifies the versatility of these protocols, whose template can serve multiple purposes and increases the interest in considering their early integration into development roadmaps of quantum machines.

Related papers

• Partially-Blind Single-Qubit Classification over a Prototype Hybrid Quantum Network [33.72751145910978]
  Single-qubit classifiers (SQCs) are small-scale hybrid quantum-classical machines capable of performing a basic machine learning task: classifying data.<n>Blind quantum computation (BQC) enables a client may run delegated quantum computations on an untrusted server with information-theoretic security.<n>We propose a prototype experiment for a SQC where it is known to the server that a classification is being performed, but the data and outcome stay hidden.<n>This can be integrated into a quantum network to deliver quantum-secured classifications to remote clients.
  arXiv  Detail & Related papers  (2026-07-02T10:32:34Z)
• Verifier-initiated quantum message-authentication via quantum zero-knowledge proofs [38.81686642226027]
  We introduce a new method where the verifier can request authentication only when needed, improving efficiency for quantum networks and blockchain applications.<n>Our approach adapts the concept of zero-knowledge widely used in classical cryptography to quantum settings, ensuring that verification reveals nothing about secret keys.<n>This work delivers the first general verifier-initiated quantum signature scheme with formal security, paving the way for scalable, secure authentication in future quantum infrastructures and decentralized systems.
  arXiv  Detail & Related papers  (2025-12-05T04:40:34Z)
• Sequential Entanglement-Swapping assisted by Quantum Protocol over Ethernet Networks [33.41459442049189]
  We show the potential of combining classical and quantum technologies for efficient, scalable quantum networking.<n>Some novel protocols enable reliable end-to-end quantum entanglement over Ethernet.
  arXiv  Detail & Related papers  (2025-02-26T10:01:28Z)
• 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)
• 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)
• 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)
• 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)
• Resource analysis for quantum-aided Byzantine agreement with the four-qubit singlet state [1.2094859111770522]
  In distributed computing, a Byzantine fault is a condition where a component behaves inconsistently, showing different symptoms to different components of the system. Our work highlights important engineering aspects of the future deployment of quantum communication protocols with multi-qubit entangled states.
  arXiv  Detail & Related papers  (2022-07-11T15:17:58Z)
• Conference key agreement in a quantum network [67.410870290301]
  Quantum conference key agreement (QCKA) allows multiple users to establish a secure key from a shared multi-partite entangled state. In a quantum network, this protocol can be efficiently implemented using a single copy of a N-qubit Greenberger-Horne-Zeilinger (GHZ) state to distil a secure N-user conference key bit.
  arXiv  Detail & Related papers  (2022-07-04T18:00:07Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Benchmarking of Quantum Protocols [0.9176056742068812]
  We consider several quantum protocols that enable promising functionalities and services in near-future quantum networks. We use NetSquid simulation platform to evaluate the effect of various sources of noise on the performance of these protocols.
  arXiv  Detail & Related papers  (2021-11-03T21:17:04Z)
• 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.