Kvantu simulatoru veiktspējas salīdzinājums
Loading...
Date
Authors
Advisor
Journal Title
Journal ISSN
Volume Title
Publisher
Latvijas Universitāte
Language
lav
Abstract
Lai kvantu skaitļošanu padarītu pieejamāku plašākai publikai, attīstītu nozari, tai skaitā veiktu algoritmu optimizācijas un testētu rezultātus netrokšņainās vidēs, tiek izmantoti kvantu simulatori. Bakalaura darba 1. daļā noteikts kvantu simulatoru pielietojums, darbības principi, salīdzināšanas metrikas, kā arī apskatīti dažādu izstrādātāju simulatori. Otrajā nodaļā eksperimentāli pārbaudīta 6 izstrādātāju 12 dažādu simulatoru ātrdarbība un atmiņas izmantojums, simulējot Grovera meklēšanas algoritmu, Kvantu Furjē transformāciju un “Pieskaitīt 1” algoritmu, kā arī apskatīta veiktspējas optimizācijas iespēja – ķēdes transpilēšana.
Quantum simulators are used to make quantum computing more accessible to a wider audience and to advance the field, including algorithm optimization and testing results in noise-free environments. In Part 1 of this bachelor’s thesis, the applications of quantum simulators, their operating principles, comparison metrics, and various developer simulators were defined and examined. In Part 2, the performance (runtime and memory usage) of 12 different simulators from six developers was experimentally evaluated by simulating Grover’s search algorithm, the Quantum Fourier Transform, and the “Add one” algorithm. Additionally, a performance-optimization technique—circuit transpilation—was investigated.
Quantum simulators are used to make quantum computing more accessible to a wider audience and to advance the field, including algorithm optimization and testing results in noise-free environments. In Part 1 of this bachelor’s thesis, the applications of quantum simulators, their operating principles, comparison metrics, and various developer simulators were defined and examined. In Part 2, the performance (runtime and memory usage) of 12 different simulators from six developers was experimentally evaluated by simulating Grover’s search algorithm, the Quantum Fourier Transform, and the “Add one” algorithm. Additionally, a performance-optimization technique—circuit transpilation—was investigated.