A verification scheme for universal quantum computers

DOI10.1007/S11128-026-05193-2MaRDI QIDQ7286255zbMATH OpenFDO

Authors Anirudh Reddy, Alain Giresse Tene, Thomas Konrad

Publication date 23 June 2026

Published in Quantum Information Processing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S11128-026-05193-2

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Quantum cryptography (quantum-theoretic aspects) (81P94)

Cites work

• A quantum linearity test for robustly verifying entanglement
• How to Verify a Quantum Computation
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• Rigidity of quantum steering and one-sided device-independent verifiable quantum computation
• The computational complexity of linear optics
• The random matrix theory of the classical compact groups
• Verification of quantum computation: an overview of existing approaches

This page was built for publication: A verification scheme for universal quantum computers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7286255)