Skip to content
aiqbench takeQuantum Computing

aiqbench analysis

This research presents QOTPH, a client-side compilation framework that enables secure, information-theoretically protected quantum computation on gate-based hardware. By retaining encryption keys locally while transforming operations for remote execution, the system ensures that quantum servers cannot access raw data or perform key updates during outsourced tasks. The work validates this approach through formal verification and practical implementation on IBM Quantum processors, addressing a critical bottleneck in cloud-based quantum security.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Quantum Homomorphic Encryption: Towards Practical QOTP-Encrypted Computation on Gate-Based Hardware

arXiv3 min read

arXiv:2604.19256v2 Announce Type: replace Abstract: As quantum computing moves toward remote and cloud-based access, protecting quantum data during outsourced execution becomes important. Quantum one-time pad (QOTP) encryption provides information-theoretic hiding of quantum state, but evaluating gates on Pauli-encrypted data is nontrivial: Clifford operations allow classical Pauli-frame updates, whereas non-Clifford operations require key-dependent corrections. We introduce QOTPH, a client-side key-tracked compilation framework for encrypted quantum computation. The client retains the QOTP keys and transforms each operation into a corrected gate or decomposition. The resulting circuit is executed non-adaptively by the quantum server, which neither receives the keys nor performs key updates. We develop a unified Pauli frame compilation layer spanning Clifford operations, one- and two-qubit Pauli-generated rotations, explicit key-dependent parametrized controlled rotations, and recursively composed gates, and establish a global correctness result for circuits composed of the formally verified primitive rules. We also characterize the evaluator's view under a hidden logical circuit model, in which the QOTP frame, the uncompiled logical circuit, and the logical-to-physical instruction mapping remain client-side; the security of this model against various algorithms is also analyzed. The implementation is evaluated in Qiskit using noiseless simulation and IBM Quantum hardware, including in-circuit and local-decryption workflows. This work bridges the gap between algebraic QOTP key tracking and practical encrypted quantum computation by providing a unified, hardware-validated compilation framework for current gate-based quantum processors.

Abstract:As quantum computing moves toward remote and cloud-based access, protecting quantum data during outsourced execution becomes important. Quantum one-time pad (QOTP) encryption provides information-theoretic hiding of quantum state, but evaluating gates on Pauli-encrypted data is nontrivial: Clifford operations allow classical Pauli-frame updates, whereas non-Clifford operations require key-dependent corrections. We introduce QOTPH, a client-side key-tracked compilation framework for encrypted quantum computation. The client retains the QOTP keys and transforms each operation into a corrected gate or decomposition. The resulting circuit is executed non-adaptively by the quantum server, which neither receives the keys nor performs key updates. We develop a unified Pauli frame compilation layer spanning Clifford operations, one- and two-qubit Pauli-generated rotations, explicit key-dependent parametrized controlled rotations, and recursively composed gates, and establish a global correctness result for circuits composed of the formally verified primitive rules. We also characterize the evaluator's view under a hidden logical circuit model, in which the QOTP frame, the uncompiled logical circuit, and the logical-to-physical instruction mapping remain client-side; the security of this model against various algorithms is also analyzed. The implementation is evaluated in Qiskit using noiseless simulation and IBM Quantum hardware, including in-circuit and local-decryption workflows. This work bridges the gap between algebraic QOTP key tracking and practical encrypted quantum computation by providing a unified, hardware-validated compilation framework for current gate-based quantum processors.

arXiv:2604.19256 [quant-ph]

(or arXiv:2604.19256v2 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2604.19256 Focus to learn more arXiv-issued DOI via DataCite

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 308 words

Related coverage