Blindly Factorizing 21 Quantumly
arXiv:2207.09267 · doi:10.1103/PhysRevA.106.012421
Abstract
We develop a classically verifiable scheme for blindly factorizing the semiprime 21 quantumly for a classical client who does not trust the remote quantum servers. Our scheme advances state of the art, which achieves blind factorization of 15 quantumly, by increasing the problem to factorizing the next semiprime, choosing a harder base, executing a non-Clifford gate, and showing that the security check for 15 also works for 21. Our algorithmic approach to incorporating non-Clifford operations sets the stage for scaling blind quantum factorization, whereas our five-EPR-pair scheme motivates a photonic experiment that supplants current demonstrations of blind factorization.
arXiv comment8 pages, 5 figures, four appendices
References in corpus (24)
- Quantum Computing in the NISQ era and beyond
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Elementary gates for quantum computation
- On the Measurement of Qubits
- Quantum Teleportation is a Universal Computational Primitive
- Improved Simulation of Stabilizer Circuits
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Quantum Error Correction and Orthogonal Geometry
- From Classical to Quantum Shannon Theory
- Experimental Demonstration of Blind Quantum Computing
- Quantum computers can search arbitrarily large databases by a single query
- Experimental realisation of Shor's quantum factoring algorithm using qubit recycling
- Experimental demonstration of Shor's algorithm with quantum entanglement
- Unconditionally verifiable blind computation
- Efficient Networks for Quantum Factoring
- Verification of quantum computation: An overview of existing approaches
- Performing Quantum Computing Experiments in the Cloud
- Pretending to factor large numbers on a quantum computer
- Experimental Blind Quantum Computing for a Classical Client
- Quantum homomorphic encryption from quantum codes
- Experimental Demonstration of Quantum Fully Homomorphic Encryption with Application in a Two-Party Secure Protocol
- On the possibility of classical client blind quantum computing
- Un-Weyl-ing the Clifford Hierarchy
- Homomorphic encryption of linear optics quantum computation on almost arbitrary states of light with asymptotically perfect security