Resilience of quantum optimization algorithms

dc.contributor.advisorPolian, Ilia (Prof. Dr.)
dc.contributor.authorJi, Yanjun
dc.date.accessioned2024-12-20T09:45:05Z
dc.date.available2024-12-20T09:45:05Z
dc.date.issued2024de
dc.description.abstractQuantum optimization algorithms (QOAs) show promise in surpassing classical methods for solving complex problems. However, their practical application is limited by the sensitivity of quantum systems to noise. This study addresses this challenge by investigating the resilience of QOAs and developing strategies to enhance their performance and robustness on noisy quantum computers. We begin by establishing an evaluation framework to assess the performance of QOAs under various conditions, including simulated noise-free and error-modeled environments, as well as real noisy hardware, providing a foundation for guiding the development of enhancement strategies. We then propose innovative techniques to improve the performance of algorithms on near-term quantum devices characterized by limited qubit connectivity and noisy operations. Our study introduces an effective compilation process that maximizes the utilization of classical and quantum resources. To overcome the restricted connectivity of hardware, we develop an algorithm-oriented qubit mapping approach that bridges the gap between heuristic and exact methods, providing scalable and optimal solutions. Additionally, we demonstrate, for the first time, selective optimization of quantum circuits on real hardware by optimizing only gates implemented with low-quality native gates, providing significant insights for large-scale quantum computing. We also investigate error mitigation strategies and their dependence on hardware features and algorithm implementation details, emphasizing the synergistic effects of error mitigation and circuit design. While error mitigation can suppress the effects of noise, hardware quality and circuit design are ultimately more critical for achieving high performance. Building upon these insights, we explore the cooptimization of algorithm design and hardware implementation to achieve optimal performance and resilience. By optimizing gate sequences and parameters at the algorithmic level and minimizing error-prone two-qubit gates during compilation, we demonstrate significant improvements in QOA performance. Finally, we explore the practical application of QOAs in real-world problems, emphasizing the importance of optimizing parameters in problem instances to identify optimal solutions. With extensive experiments conducted on real devices, this dissertation makes a substantial contribution to the field of quantum optimization, providing both theoretical foundations and practical strategies for addressing the challenges posed by near-term quantum hardware. Our findings pave the way for the realization of practical quantum computing applications and unlock the full potential of QOAs.en
dc.identifier.other1913123308
dc.identifier.urihttp://nbn-resolving.de/urn:nbn:de:bsz:93-opus-ds-154769de
dc.identifier.urihttp://elib.uni-stuttgart.de/handle/11682/15476
dc.identifier.urihttp://dx.doi.org/10.18419/opus-15457
dc.language.isoende
dc.rightsinfo:eu-repo/semantics/openAccessde
dc.subject.ddc004de
dc.subject.ddc500de
dc.subject.ddc530de
dc.subject.ddc600de
dc.titleResilience of quantum optimization algorithmsen
dc.typedoctoralThesisde
ubs.dateAccepted2024-11-07
ubs.fakultaetInformatik, Elektrotechnik und Informationstechnikde
ubs.institutInstitut für Technische Informatikde
ubs.publikation.seitenxix, 215de
ubs.publikation.typDissertationde
ubs.thesis.grantorInformatik, Elektrotechnik und Informationstechnikde

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
Dissertation_Yanjun_Ji.pdf
Size:
12.38 MB
Format:
Adobe Portable Document Format
Description:

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
3.3 KB
Format:
Item-specific license agreed upon to submission
Description: