Blindness and verification of quantum computation with one pure qubit

DOI10.4230/LIPICS.TQC.2014.176zbMATH Open1359.68089arXiv1403.1438MaRDI QIDQ2969059FDOQ2969059

Authors: Theodoros Kapourniotis, Elham Kashefi, Animesh Datta 

Publication date: 13 March 2017

Full work available at URL: https://arxiv.org/abs/1403.1438

Recommendations

• Robustness and device independence of verifiable blind quantum computing
• Optimised resource construction for verifiable quantum computation
• How to Verify a Quantum Computation
• Verifier-on-a-leash: new schemes for verifiable delegated quantum computation, with quasilinear resources
• A hybrid universal blind quantum computation

zbMATH Keywords

verificationdelegated computingmeasurement-based model

Mathematics Subject Classification ID

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

Cited In (10)

• Optimised resource construction for verifiable quantum computation
• The brickwork state with fewer qubits in blind quantum computation
• Finite-data-size study on practical universal blind quantum computation
• One-bit sensing, discrepancy and Stolarsky's principle
• Verification of quantum computation: an overview of existing approaches
• Quantum bootstrapping via compressed quantum Hamiltonian learning
• Benchmarking quantum processors with a single qubit
• Rigidity of quantum steering and one-sided device-independent verifiable quantum computation
• Verification of quantum computation and the price of trust
• Robustness and device independence of verifiable blind quantum computing

This page was built for publication: Blindness and verification of quantum computation with one pure qubit

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