As we approach the realization of scalable quantum computers, it is increasingly important to ensure that clients with limited quantum resources have secure access to such devices, particularly in fields like drug discovery, motivating the use of blind quantum computing (BQC). BQC offers a way for a client with limited quantum capabilities to delegate quantum computations to a powerful but untrusted server, with the guarantee that the server learns nothing about the client's input, algorithm, or output. Our work applies the recently proposed hybrid light-matter BQC architecture [Science 388, 509-513 (2025), arXiv:2505.21621] to quantum chemistry to develop circuit design strategies for Hamiltonian simulation algorithms, with the aim of minimizing the photonic overhead associated with blind gates by leveraging relatively inexpensive local gates. We demonstrate a secure protocol for molecular simulation by integrating BQC with the $O(n^4)$ first-order Pauli Trotterization algorithm and the more scalable $O(n^2)$ Low-Rank Factorization algorithm, successfully hiding the molecular Hamiltonian. We analyze the trade-off between molecular property confidentiality and the required blind resource overhead, and derive resource and runtime estimates for the BQC protocol under two client capability assumptions—with and without quantum memory—providing a practical reference for assessing the feasibility of blind quantum algorithms.

Pizza and drinks will be served after the seminar in ATL 2117.