Verifiable blind probabilistic error cancellation

• URL: http://arxiv.org/abs/2607.25704v1
• Date: Tue, 28 Jul 2026 13:27:08 GMT
• Title: Verifiable blind probabilistic error cancellation
• Abstract summary: Quantum error mitigation (QEM) is an essential tool for mitigating hardware noise without incurring space overhead.<n>We introduce verifiable blind probabilistic error cancellation (VBPEC), the first secure verification protocol against a fully malicious adversary.<n>VBPEC performs PEC with perfect blindness and an exponentially small security error.
• Score: 5.1287945894217355
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum error mitigation (QEM) is an essential tool for mitigating hardware noise without incurring space overhead. Yet, its reliability depends on modeling, calibration, and implementation, leaving end-to-end security on untrusted quantum hardware unresolved. We address this problem by introducing verifiable blind probabilistic error cancellation (VBPEC), the first secure verification protocol against a fully malicious adversary that integrates QEM. VBPEC brings probabilistic error cancellation (PEC), a widely studied QEM technique, within the scope of composable security by formalizing delegated mitigation as a cryptographic resource in the abstract cryptography framework. The protocol performs PEC with perfect blindness and an exponentially small security error. VBPEC retains the absence of quantum-space overhead from recent statistically-secure verified quantum computation protocols and from PEC. The only overhead takes the form of additional repetitions due to the QEM procedure. To achieve this, we extend trap-based verification from deterministic pass/fail checks to statistical tests that benefit from QEM and develop a new proof technique that integrates the corresponding additional deviation sources. Rather than merely tolerating honest noise below a fixed threshold, VBPEC actively cancels it, enabling correctly mitigated estimates to be accepted with high probability without compromising security. Our framework thus establishes an essential route towards secure, reliable, and practical delegated quantum computation on near-future quantum hardware: VBPEC fundamentally improves the practicality of verification.

Related papers

• Quaternary-Squeeze Quantum Identity Authentication: Direction-Scaling Security via Single-Mode Squeezed Light [4.87244033582479]
  Quantum identity authentication (QIA) has emerged as a crucial technology for secure communication systems.<n>This paper proposes a novel QIA protocol based on non-classical characteristics of squeezed light fields.
  arXiv  Detail & Related papers  (2026-07-10T07:31:27Z)
• Robust Covert Quantum Communication under Bounded Channel Uncertainty [37.58598417573807]
  We study covert quantum communication over compound quantum optical channels with bounded uncertainty in both transmissivity and thermal noise.<n>We develop a robust framework for certifying both covertness and reliability under uncertainty.
  arXiv  Detail & Related papers  (2026-04-13T08:40:14Z)
• A Posteriori Certification Framework for Generalized Quantum Arimoto-Blahut Algorithms [41.15017547767954]
  We introduce an a posteriori certification viewpoint for the generalized quantum Arimoto-Blahut (QAB) algorithm.<n>We prove a global convergence theorem showing that, under convexity and a substantially weaker numerically verifiable condition, the QAB iteration converges to the global minimizer.<n>As an application, we develop a certified iterative scheme for computing the quantum relative entropy of channels.
  arXiv  Detail & Related papers  (2026-01-14T09:10:41Z)
• Composable Verification in the Circuit-Model via Magic-Blindness [0.0]
  We introduce a family of noise robust, composable and efficient verification protocols for Clifford + MSI circuits.<n>Our technique is based on a refined notion of blindness, called magic-blindness, which hides only the injected magic states.<n>As a result, circuit-based quantum verification attains the same level of security and robustness previously known only in MBQC.
  arXiv  Detail & Related papers  (2026-01-12T00:30:24Z)
• 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)
• Verifiable blind observable estimation: A composably secure protocol for near-term quantum advantage tasks [5.1287945894217355]
  We introduce a protocol that efficiently verifies observable estimation performed on an untrusted quantum machine.<n>More precisely, it guarantees that the computed estimate is within some $epsilon>0$ of the true expectation value or else it aborts.
  arXiv  Detail & Related papers  (2025-10-09T17:56:15Z)
• 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)
• Unsupervised Conformal Inference: Bootstrapping and Alignment to Control LLM Uncertainty [49.19257648205146]
  We propose an unsupervised conformal inference framework for generation.<n>Our gates achieve close-to-nominal coverage and provide tighter, more stable thresholds than split UCP.<n>The result is a label-free, API-compatible gate for test-time filtering.
  arXiv  Detail & Related papers  (2025-09-26T23:40:47Z)
• COIN: Uncertainty-Guarding Selective Question Answering for Foundation Models with Provable Risk Guarantees [51.5976496056012]
  COIN is an uncertainty-guarding selection framework that calibrates statistically valid thresholds to filter a single generated answer per question.<n>COIN estimates the empirical error rate on a calibration set and applies confidence interval methods to establish a high-probability upper bound on the true error rate.<n>We demonstrate COIN's robustness in risk control, strong test-time power in retaining admissible answers, and predictive efficiency under limited calibration data.
  arXiv  Detail & Related papers  (2025-06-25T07:04:49Z)
• Quantum Key Distribution with Basis-Dependent Detection Probability [0.0]
  A common assumption in security proofs is that the detection probability at the receiver, for a given input state, is independent of the measurement basis.<n>This paper presents a security proof for QKD protocols that does not rely on the above assumption.<n>We demonstrate, through simulations, that our proof can extract positive key rates for setups vulnerable to large detection probability mismatches.
  arXiv  Detail & Related papers  (2024-11-29T17:35:27Z)
• 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 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)

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.