Quantum Approximate Walk Algorithm
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912701046849536 |
|---|---|
| author | Guo, Ziqing Balewski, Jan Hu, Wenshuo Khan, Alex Pan, Ziwen |
| author_facet | Guo, Ziqing Balewski, Jan Hu, Wenshuo Khan, Alex Pan, Ziwen |
| contents | The encoding of classical to quantum data mapping through trigonometric functions within arithmetic-based quantum computation algorithms leads to the exploitation of multivariate distributions. The studied variational quantum gate learning mechanism, which relies on agnostic gradient optimization, does not offer algorithmic guarantees for the correlation of results beyond the measured bitstring outputs. Consequently, existing methodologies are inapplicable to this problem. In this study, we present a classical data-traceable quantum oracle characterized by a circuit depth that increases linearly with the number of qubits. This configuration facilitates the learning of approximate result patterns through a shallow quantum circuit (SQC) layout. Moreover, our approach demonstrates that the classical preprocessing of mid-quantum measurement data enhances the interpretability of quantum approximate optimization algorithm (QAOA) outputs without requiring full quantum state tomography. By establishing an inferable mapping between the classical input and quantum circuit outcomes, we obtained experimental results on the state-of-the-art IBM Pittsburgh hardware, which yielded polynomial-time verification of the solution quality. This hybrid framework bridges the gap between near-term quantum capabilities and practical optimization requirements, offering a pathway toward reliable quantum-classical algorithms for industrial applications. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_07676 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Quantum Approximate Walk Algorithm Guo, Ziqing Balewski, Jan Hu, Wenshuo Khan, Alex Pan, Ziwen Quantum Physics The encoding of classical to quantum data mapping through trigonometric functions within arithmetic-based quantum computation algorithms leads to the exploitation of multivariate distributions. The studied variational quantum gate learning mechanism, which relies on agnostic gradient optimization, does not offer algorithmic guarantees for the correlation of results beyond the measured bitstring outputs. Consequently, existing methodologies are inapplicable to this problem. In this study, we present a classical data-traceable quantum oracle characterized by a circuit depth that increases linearly with the number of qubits. This configuration facilitates the learning of approximate result patterns through a shallow quantum circuit (SQC) layout. Moreover, our approach demonstrates that the classical preprocessing of mid-quantum measurement data enhances the interpretability of quantum approximate optimization algorithm (QAOA) outputs without requiring full quantum state tomography. By establishing an inferable mapping between the classical input and quantum circuit outcomes, we obtained experimental results on the state-of-the-art IBM Pittsburgh hardware, which yielded polynomial-time verification of the solution quality. This hybrid framework bridges the gap between near-term quantum capabilities and practical optimization requirements, offering a pathway toward reliable quantum-classical algorithms for industrial applications. |
| title | Quantum Approximate Walk Algorithm |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2511.07676 |