تقرير
Generating Target Graph Couplings for QAOA from Native Quantum Hardware Couplings
| العنوان: | Generating Target Graph Couplings for QAOA from Native Quantum Hardware Couplings |
|---|---|
| المؤلفون: | Rajakumar, Joel, Moondra, Jai, Gard, Bryan, Gupta, Swati, Herold, Creston D. |
| المصدر: | Phys. Rev. A 106, 022606 (2022) |
| سنة النشر: | 2020 |
| المجموعة: | Computer Science Mathematics Physics (Other) Quantum Physics |
| مصطلحات موضوعية: | Quantum Physics, Computer Science - Computational Complexity, Mathematics - Optimization and Control, Physics - Atomic Physics |
| الوصف: | We present methods for constructing any target coupling graph using limited global controls in an Ising-like quantum spin system. Our approach is motivated by implementing the quantum approximate optimization algorithm (QAOA) on trapped ion quantum hardware to find approximate solutions to Max-Cut. We present a mathematical description of the problem and provide approximately optimal algorithmic constructions that generate arbitrary unweighted coupling graphs with $n$ nodes in $O(n)$ global entangling operations and weighted graphs with $m$ edges in $O(m)$ operations. These upper bounds are not tight in general, and we formulate a mixed-integer program to solve the graph coupling problem to optimality. We perform numeric experiments on small graphs with $n\le8$ and show that optimal sequences, which use fewer operations, can be found using mixed-integer programs. Noisy simulations of Max-Cut QAOA show that our implementation is less susceptible to noise than the standard gate-based compilation. |
| نوع الوثيقة: | Working Paper |
| DOI: | 10.1103/PhysRevA.106.022606 |
| URL الوصول: | http://arxiv.org/abs/2011.08165 |
| رقم الأكسشن: | edsarx.2011.08165 |
| قاعدة البيانات: | arXiv |
| DOI: | 10.1103/PhysRevA.106.022606 |
|---|