Bereiche | Tage | Auswahl | Suche | Aktualisierungen | Downloads | Hilfe
Q: Fachverband Quantenoptik und Photonik
Q 63: Poster – Quantum Information (joint session QI/Q)
Q 63.30: Poster
Donnerstag, 13. März 2025, 17:00–19:00, Tent
Blind Grover Search for Gate-based Quantum Computers — •Alexander Sauer1, Alexander von Consbruch2, and Matthias Zimmermann1 — 1DLR e.V., Institute of Quantum Technologies, Ulm — 2University of Göttingen
While quantum computers might offer several computational benefits, their application within a quantum network is also of interest in regard to privacy, data protection and computational security. One promising application is blind quantum computing, where a client with limited quantum capacities utilizes the computational power of a quantum computer located at a quantum computing center without revealing any information about the computation or data involved. Several schemes for blind quantum computation have emerged, with the most advanced relying on measurement-based quantum computing [1]. However, many current quantum computer designs are based on gate-based state manipulation. While blind quantum computing is also possible in this scenario, it requires a permanent exchange of quantum information between client and server [2]. To reduce the communication overhead for the involved parties, we study a relaxed scenario of blind quantum computing, where the server gets some information about the algorithm. In particular, we propose a protocol to hide an n-qubit Grover search algorithm by utilizing additional qubits on a quantum server which are initialized by the clients.
[1] Fitzsimons, J. F. (2017), npj Quantum Information, 3(1), 23.
[2] A. Childs, A. (2005), Quantum Inform. Comput., 5, 456-466.
Keywords: blind quantum computation; grover search; quantum algorithm