Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2512.22434 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914221877362688 |
|---|---|
| author | Kuroiwa, Taihei Yamazaki, Daiki Takahashi, Keita Shiba, Kodai Chen, Chih-Chieh Sogabe, Tomah |
| author_facet | Kuroiwa, Taihei Yamazaki, Daiki Takahashi, Keita Shiba, Kodai Chen, Chih-Chieh Sogabe, Tomah |
| contents | Two-stage stochastic programming often discretizes uncertainty into scenarios, but scenario enumeration makes expected recourse evaluation scale at least linearly in the scenario count. We propose qGAN-QAOA, a unified quantum-circuit workflow in which a pre-trained quantum generative adversarial network encodes the scenario distribution and QAOA optimizes first-stage decisions by minimizing the full two-stage objective, including expected recourse cost. With the qGAN parameters fixed after training, we evaluate the objective as the expectation value of a problem Hamiltonian and optimize only the QAOA variational parameters. We interpret non-anticipativity as a condition on measurement outcome statistics and prove that the first-stage measurement marginal is independent of the scenario. For uniformly discretized uncertainty, the diagonal operator encoding the uncertainty admits a sparse Pauli-Z expansion via the Walsh--Hadamard transform, yielding polylogarithmic scaling of gate count and circuit depth with the number of scenarios. Numerical experiments on the stochastic unit commitment problem (UCP) with photovoltaic (PV) uncertainty compare the expected cost of the proposed method with classical expected-value and two-stage stochastic programming baselines, demonstrating the effectiveness of qGAN-QAOA as a two-stage decision model. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_22434 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Quantum-Circuit Framework for Two-Stage Stochastic Programming via QAOA Integrated with a Quantum Generative Neural Network Kuroiwa, Taihei Yamazaki, Daiki Takahashi, Keita Shiba, Kodai Chen, Chih-Chieh Sogabe, Tomah Quantum Physics Two-stage stochastic programming often discretizes uncertainty into scenarios, but scenario enumeration makes expected recourse evaluation scale at least linearly in the scenario count. We propose qGAN-QAOA, a unified quantum-circuit workflow in which a pre-trained quantum generative adversarial network encodes the scenario distribution and QAOA optimizes first-stage decisions by minimizing the full two-stage objective, including expected recourse cost. With the qGAN parameters fixed after training, we evaluate the objective as the expectation value of a problem Hamiltonian and optimize only the QAOA variational parameters. We interpret non-anticipativity as a condition on measurement outcome statistics and prove that the first-stage measurement marginal is independent of the scenario. For uniformly discretized uncertainty, the diagonal operator encoding the uncertainty admits a sparse Pauli-Z expansion via the Walsh--Hadamard transform, yielding polylogarithmic scaling of gate count and circuit depth with the number of scenarios. Numerical experiments on the stochastic unit commitment problem (UCP) with photovoltaic (PV) uncertainty compare the expected cost of the proposed method with classical expected-value and two-stage stochastic programming baselines, demonstrating the effectiveness of qGAN-QAOA as a two-stage decision model. |
| title | Quantum-Circuit Framework for Two-Stage Stochastic Programming via QAOA Integrated with a Quantum Generative Neural Network |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2512.22434 |