Towards Optimizing the Expected Performance of Sampling-Based Quantum-Inspired Algorithms
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866908694564831232 |
|---|---|
| author | Cha, Hyunho Lee, Jungwoo |
| author_facet | Cha, Hyunho Lee, Jungwoo |
| contents | Quantum-inspired classical algorithms has received much attention due to its exponential speedup compared to existing algorithms, under certain data storage assumptions. The improvements are noticeable in fundamental linear algebra tasks. In this work, we analyze two major subroutines in sampling-based quantum-inspired algorithms, specifically, inner product estimation and sampling from a linear combination of vectors, and discuss their possible improvements by generalizing the data structure. The idea is to consider the average behavior of the subroutines under certain assumptions regarding the data elements. This allows us to determine the optimal data structure, and the high-dimensional nature of data makes our assumptions reasonable. Experimental results from recommendation systems also highlight a consistent preference for our proposed data structure. Motivated by this observation, we tighten the upper bound on the number of required measurements for direct fidelity estimation. We expect our findings to suggest optimal implementations for various quantum and quantum-inspired machine learning algorithms that involve extremely high-dimensional operations, which has potential for many applications. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_05184 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Towards Optimizing the Expected Performance of Sampling-Based Quantum-Inspired Algorithms Cha, Hyunho Lee, Jungwoo Quantum Physics Quantum-inspired classical algorithms has received much attention due to its exponential speedup compared to existing algorithms, under certain data storage assumptions. The improvements are noticeable in fundamental linear algebra tasks. In this work, we analyze two major subroutines in sampling-based quantum-inspired algorithms, specifically, inner product estimation and sampling from a linear combination of vectors, and discuss their possible improvements by generalizing the data structure. The idea is to consider the average behavior of the subroutines under certain assumptions regarding the data elements. This allows us to determine the optimal data structure, and the high-dimensional nature of data makes our assumptions reasonable. Experimental results from recommendation systems also highlight a consistent preference for our proposed data structure. Motivated by this observation, we tighten the upper bound on the number of required measurements for direct fidelity estimation. We expect our findings to suggest optimal implementations for various quantum and quantum-inspired machine learning algorithms that involve extremely high-dimensional operations, which has potential for many applications. |
| title | Towards Optimizing the Expected Performance of Sampling-Based Quantum-Inspired Algorithms |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2501.05184 |