Partial blind quantum computation: a framework for selective circuit protection
From MaRDI portal
Cites work
- A polynomial quantum algorithm for approximating the Jones polynomial
- BLIND QUANTUM COMPUTATION
- Classical homomorphic encryption for quantum circuits
- Classical verification of quantum computations
- Fully homomorphic encryption using ideal lattices
- Multi-agent blind quantum computation without universal cluster states
- Practical multi-party quantum homomorphic encryption
- Qfactory: classically-instructed remote secret qubits preparation
- Secure assisted quantum computation
- Two-round quantum homomorphic encryption scheme based on matrix decomposition
- Universal Blind Quantum Computation
- Verification of quantum computation: an overview of existing approaches
This page was built for publication: Partial blind quantum computation: a framework for selective circuit protection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6928663)