BROWSE
Detail
Journal Article
Secure Delegated Quantum Approximate Optimization Algorithm With Quantum One-Time Pad for MAX-CUT Problem
Cited - time in 
Share 
Share
- Authors
- Juyoung Kim, Doyoung Chung
- Issue Date
- 2026-09
- Citation
- IEEE Transactions on Emerging Topics in Computing, v.14, no.3, pp.982-992
- ISSN
- 2168-6750
- Publisher
- IEEE
- Language
- English
- Type
- Journal Article
- Abstract
- In this article, we propose a secure framework that integrates the Quantum Approximate Optimization Algorithm (QAOA) with the Quantum One-Time Pad (QOTP) to solve optimization problems—specifically the MAX-CUT problem—within a delegated (cloud-based) quantum computing environment while protecting sensitive data. In the proposed approach, the client prepares the initial quantum state and configures the connectivity of the problem's graph using Hadamard and CNOT gates, subsequently encrypting the state with QOTP using a randomly generated key. The encrypted state is then transmitted to the server, which performs the necessary operations (such as R gate operations) without accessing sensitive information. After the operations, the client decrypts the returned state using the client's secret key and measures the outcome to obtain an approximate solution. This method leverages the advantages of quantum parallelism and optimization while ensuring data confidentiality, offering a novel approach to secure delegated quantum optimization.
- Keyword
- Delegated quantum computing, quantum approximate optimization algorithm (QAOA), quantum one-time pad (QOTP)
- KSP Keywords
- Approximate optimization, Approximate solution, Computing Environment, Delegated quantum computing, Gate operation, Max-Cut, Novel approach, Optimization Algorithm, Quantum one-time pad, Quantum states, Secure Framework