Finite-data-size study on practical universal blind quantum computation
From MaRDI portal
Publication:1993796
DOI10.1007/s11128-018-1934-6zbMath1448.81265OpenAlexW2806641119MaRDI QIDQ1993796
Publication date: 5 November 2018
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11128-018-1934-6
decoy statepreparation efficiencyremote blindef qubit state preparationuniversal blind quantum computationweak coherent pulses
Quantum computation (81P68) LOCC, teleportation, dense coding, remote state operations, distillation (81P48)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum One-Time Programs
- Composable Security of Delegated Quantum Computation
- Demonstration of Blind Quantum Computing
- BLIND QUANTUM COMPUTATION
- Rapid solution of problems by quantum computation
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Universal Blind Quantum Computation
This page was built for publication: Finite-data-size study on practical universal blind quantum computation