Universal blind quantum computation with recursive rotation gates

DOI10.1007/S11128-026-05188-ZMaRDI QIDQ7286246zbMATH OpenFDO

Authors Mohit Joshi, Manoj Kumar Mishra, Selvaraj Karthikeyan

Publication date 23 June 2026

Published in Quantum Information Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11128-026-05188-Z

Mathematics Subject Classification ID

Factorization (11Y05) Searching and sorting (68P10) Quantum computation (81P68) Quantum cryptography (quantum-theoretic aspects) (81P94)

Cites work

• A hybrid universal blind quantum computation
• Blind quantum machine learning based on quantum circuit model
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• Leveraging Grover's algorithm for quantum searchable encryption in cloud infrastructure and its application in AES resource estimation
• Measurement-based universal blind quantum computation with minor resources
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum fully homomorphic encryption scheme based on universal quantum circuit
• Quantum internet: A vision for the road ahead
• Single-server blind quantum computation with quantum circuit model
• Universal Blind Quantum Computation
• Universal blind quantum computing assisted by quantum teleportation

This page was built for publication: Universal blind quantum computation with recursive rotation gates

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