Quantum mechanics provides powerful security guarantees: you cannot clone an unknown state, and measuring a system fundamentally alters it. However, these exact properties introduce a paradox for verification. If a client delegates a quantum task to an untrusted server, or if a group of participants shares a distributed quantum secret, how can they verify that the states have not been tampered with? Because reading a state can destroy it, traditional verification fails.
To solve this, a powerful paradigm has emerged around verifiable quantum protocols. By combining classical cryptographic primitives, interactive proofs, and clever state encodings, we can certify quantum states and computations without needing full quantum trust or destroying the underlying information.
Overcoming the Limits of Quantum Secret Sharing
In classical secret sharing, a secret is split among $n$ parties such that any $t$ of them can reconstruct it. Bringing this to the quantum world introduces strict adversarial limits. Early theoretical work suggested that Verifiable Quantum Secret Sharing (VQSS) was impossible if more than $n/4$ participants were corrupted.
However, Claude Crépeau et al. shattered this limit in Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes. They demonstrated that by relaxing the requirement from perfect reconstruction to approximate reconstruction, the adversarial threshold can be doubled. This allows protocols to tolerate up to $(n-1)/2$ corrupted parties—nearly half the participants—by accepting a negligible, bounded error in the state's fidelity.
To achieve this verification practically without relying on a trusted third party, protocols embed "traps" or check values directly into the quantum states. For instance, Changbin Lu et al. developed a threshold scheme using $d$-level quantum systems (qudits) in Verifiable threshold quantum secret sharing with sequential communication, where an auxiliary qudit acts as a built-in verification mechanism to catch cheaters during sequential communication.
Similarly, Changbin Lu et al. extended this to an entanglement-free framework in A verifiable framework of entanglement-free quantum secret sharing with information-theoretical security by encoding an auxiliary verification value alongside the secret. By combining polynomial interpolation with single-particle operations, as explored by Yifei Wang 0003 et al. in A (t, n) threshold protocol of semi-quantum secret sharing based on single particles, participants can securely reconstruct secrets even if they only possess limited, single-basis quantum capabilities.
Classical Verification of Quantum Computation
A major bottleneck in quantum computing is delegation: how can a completely classical user verify that a powerful, untrusted quantum cloud server actually executed a quantum algorithm correctly?
The breakthrough mechanism driving this is Verifiable Remote State Preparation (RSPV). As shown by Jiayu Zhang in Classical Verification of Quantum Computations in Linear Time, a classical entity can direct a remote quantum server to generate specific quantum states through purely classical communication. This relies on cryptographic assumptions like noisy trapdoor claw-free functions (TCFs).
Claw-free functions work because they force the quantum server to commit to a state before knowing which measurement the classical verifier will request. As Grzegorz Gluch et al. explain in Breaking a Classical Barrier for Classifying Arbitrary Test Examples in the Quantum Model, these interactive protocols allow a classical entity to certify quantum samples by forcing the system into a mathematical corner where it cannot cheat without resolving a claw-free collision—an intractable classical task.
This concept underpins blind quantum computation (BQC), where a client runs a secret algorithm on a server. Jiayu Zhang demonstrated in Succinct Blind Quantum Computation Using a Random Oracle that a specialized quantum test can act as a "proof-of-unpredictability," confirming the server has not learned the secret keys. To make this practical, Elham Kashefi proposed a double-server protocol in Ground state blind quantum computation on AKLT state that allows an entirely classical client to delegate tasks securely. Furthermore, Wenjie Liu et al. showed in Public verifiable measurement-only blind quantum computation based on entanglement witnesses that public verifiability can be achieved by decoupling state storage from verification, allowing any independent third party to arbitrate disputes.
Certifying Unclonable Tokens and Pseudorandom States
Beyond computation and secret sharing, verification is essential for quantum tokens, such as quantum money or single-use software licenses.
Consider a quantum token meant to be spent exactly once. In Quantum One-Time Protection of any Randomized Algorithm, Ramis Movassagh et al. designed a scheme where a small quantum state serves as an authentication token. When the user inputs data, they perform a measurement that generates a valid execution tag. Crucially, the act of verification consumes the state, preventing unauthorized re-runs or piracy without requiring a constant connection to a central server.
For cloud-based systems, Siyuan Jin et al. introduced Cloud-based Semi-Quantum Money, where classical users verify quantum tokens by applying a secret-key-dependent shift to a state and delegating the measurement to a server. The resulting classical output is checked against the secret shift, removing the need for the user to own quantum hardware.
When dealing with more complex primitives like pseudorandom quantum states (PRS), Prabhanjan Vijendra Ananth et al. showed in Cryptography from Pseudorandom Quantum States that a semi-black-box verification algorithm can validate whether a state matches a specific input. In Pseudorandom (Function-Like) Quantum State Generators: New Definitions and Applications, the authors demonstrated that verifiable state tomography allows receivers to confirm classical descriptions of quantum states using only classical communication. This multi-copy verification logic is extended in Revocable Encryption, Programs, and More: The Case of Multi-Copy Security, where the authors use generalized permutation tests to verify that sub-leased copies of quantum software are returned without being tampered with or cloned.
Hardware-Constrained and Automated Certification
In real-world deployments, verification must adapt to physical constraints. For instance, full state characterization is often impossible. Adetunmise C. Dada et al. demonstrated in Near-Maximal Two-Photon Entanglement for Optical Quantum Communication at 2.1 μm how a weak form of self-testing can certify quantum state properties and observable incompatibilities without trusting the measurement devices themselves.
When certifying entire quantum channels under strict hardware limits, Nicolas Flammarion et al. proved in Quantum Channel Certification with Incoherent Measurements that measuring each channel output individually (without quantum memory) achieves optimal sample complexity. For authentication without a central database, Soham Ghosh et al. leveraged entangled Bell states and random von Neumann measurements in Existential Unforgeability in Quantum Authentication From Quantum Physical Unclonable Functions Based on Random von Neumann Measurement to validate responses dynamically.
Finally, as these protocols grow in complexity, manual security proofs become error-prone. To address this, Francesco Belardinelli et al. introduced automated verification in Automated Verification of Quantum Protocols using MCMAS, mapping quantum states onto a classical multi-agent logic framework to formally track an agent's knowledge and measurement results over time.
Key Foundational Work
Secure multi-party quantum computation (2002) — contributed 3 concept elements to this direction.
Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes (2005) — contributed 2 concept elements to this direction.