Related papers: Verifiable blind observable estimation: A composably secure protocol for near-term quantum advantage tasks

Verifiable blind observable estimation: A composably secure protocol for near-term quantum advantage tasks

URL: http://arxiv.org/abs/2510.08548v1
Date: Thu, 09 Oct 2025 17:56:15 GMT
Title: Verifiable blind observable estimation: A composably secure protocol for near-term quantum advantage tasks
Authors: Bo Yang, Elham Kashefi, Harold Ollivier,
Abstract summary: 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.
Score: 5.1287945894217355
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: The rapid advance of quantum hardware is spotlighting pre-fault-tolerant tasks that may no longer be efficiently validated by classical means and are likely to run on potentially untrusted remote quantum servers. This motivates problem-independent verification protocols with rigorous guarantees. The Verifiable Blind Quantum Computation (VBQC) protocol provides delegated computation where the composable security spans the confidentiality and integrity of the computation. However, the success of these cryptographic protocols, especially their low space overhead, is unfortunately confined to problems that admit an algorithm whose output can be amplified through majority voting toward the correct solution. This leaves various notable near-term applications relying on observable estimation without efficient verification protocols. To address these needs, we introduce a protocol implementing Secure Delegated Observable Estimation (SDOE), which efficiently verifies observable estimation performed on an untrusted quantum machine. More precisely, it guarantees that the computed estimate is within some $\epsilon>0$ of the true expectation value or else it aborts. The required overhead is limited to adding test rounds that are not more complex than the unprotected computation that needs to be performed to implement the desired measurement on a given fiducial state; and in addition, the security error is negligible in the total number of rounds of the protocol.

Related papers

Cryptographic Fragility of Standard Quantum Repeater Protocols [1.5469452301122173]
We show that the proposed quantum Internet relies on repeater protocols designed under the assumption of characterizable noise.<n>We propose a Cryptographic Network Stack centered on a trapdoor verification protocol to address these vulnerabilities.
arXiv Detail & Related papers (2026-02-26T14:30:03Z)
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)
A Fully Device-Independent Ternary Quantum Key Distribution Protocol Based on the Impossible Colouring Game [0.59374762912328]
We propose a quantum key distribution protocol based on the two-party Impossible Colouring pseudo-telepathy game.<n>The protocol harnesses Bell inequality violations that arise from contextuality in the Kochen-Specker theorem.<n>It operates within an adequate security framework and demonstrates an improved key generation rate compared to standard quantum key distribution schemes.
arXiv Detail & Related papers (2025-05-21T14:52:31Z)
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)
Optimizing quantum error correction protocols with erasure qubits [42.00287729190062]
Erasure qubits offer a promising avenue toward reducing the overhead of quantum error correction protocols. We focus on the performance of the surface code as a quantum memory. Our results indicate that QEC protocols with erasure qubits can outperform the ones with state-of-the-art transmons.
arXiv Detail & Related papers (2024-08-01T18:00:01Z)
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)
Correcting for finite statistics effects in a quantum steering experiment [33.013102271622614]
We introduce a one-sided device-independent protocol that corrects for apparent signaling effects in experimental probability distributions.<n>Our results show a significantly higher probability of violation than existing state-of-the-art inequalities.<n>This work demonstrates the power of semidefinite programming for entanglement verification and brings quantum networks closer to practical applications.
arXiv Detail & Related papers (2023-05-23T14:39:08Z)
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)
Single-photon-memory measurement-device-independent quantum secure direct communication [63.75763893884079]
Quantum secure direct communication (QSDC) uses the quantum channel to transmit information reliably and securely. In order to eliminate the security loopholes resulting from practical detectors, the measurement-device-independent (MDI) QSDC protocol has been proposed. We propose a single-photon-memory MDI QSDC protocol (SPMQC) for dispensing with high-performance quantum memory.
arXiv Detail & Related papers (2022-12-12T02:23:57Z)
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)
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)
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.