Multi-agent blind quantum computation without universal cluster states

DOI10.1088/1367-2630/ACFAB6MaRDI QIDQ6559788zbMATH OpenFDO

Authors Shuxiang Cao

Publication date 21 June 2024

Published in New Journal of Physics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1088/1367-2630/ACFAB6

zbMATH Keywords

blind quantum computingmeasurement-based quantum computingZX-calculus

Mathematics Subject Classification ID

Quantum theory (81-XX) Statistical mechanics, structure of matter (82-XX) Relativity and gravitational theory (83-XX)

Cites work

• A fault-tolerant one-way quantum computer
• A graphical approach to measurement-based quantum computing
• Classical verification of quantum computations
• Cluster-state quantum computation
• Completely positive linear maps on complex matrices
• Completeness of the ZX-calculus
• Flow-preserving ZX-calculus Rewrite Rules for Optimisation and Obfuscation
• How to Verify a Quantum Computation
• Interactive proofs for \(\mathsf{BQP}\) via self-tested graph states
• Qfactory: classically-instructed remote secret qubits preparation
• Quantum FHE (almost) as secure as classical
• Rewriting measurement-based quantum computations with generalised flow
• Robustness and device independence of verifiable blind quantum computing
• The ZX-calculus is complete for stabilizer quantum mechanics
• The ZX-calculus is incomplete for quantum mechanics
• Universal Blind Quantum Computation
• Verification of quantum computation: an overview of existing approaches

Cited in

(2)

• Emerging applications of measurement-based quantum computing
• Partial blind quantum computation: a framework for selective circuit protection

This page was built for publication: Multi-agent blind quantum computation without universal cluster states

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