Assessing the feasibility of quantum learning algorithms for noisy linear problems
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910714936950784 |
|---|---|
| author | Kim, Minkyu Kim, Panjin |
| author_facet | Kim, Minkyu Kim, Panjin |
| contents | Quantum algorithms for solving noisy linear problems are reexamined, under the same assumptions taken from the existing literature. The findings of this work include on the one hand extended applicability of the quantum Fourier transform to the ring learning with errors problem which has been left open by Grilo et al., who first devised a polynomial-time quantum algorithm for solving noisy linear problems with quantum samples. On the other hand, this paper also shows there exist efficient classical algorithms for short integer solution and size-reduced learning with errors problems if the quantum samples used by the previous studies are given. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_03932 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Assessing the feasibility of quantum learning algorithms for noisy linear problems Kim, Minkyu Kim, Panjin Quantum Physics Cryptography and Security Quantum algorithms for solving noisy linear problems are reexamined, under the same assumptions taken from the existing literature. The findings of this work include on the one hand extended applicability of the quantum Fourier transform to the ring learning with errors problem which has been left open by Grilo et al., who first devised a polynomial-time quantum algorithm for solving noisy linear problems with quantum samples. On the other hand, this paper also shows there exist efficient classical algorithms for short integer solution and size-reduced learning with errors problems if the quantum samples used by the previous studies are given. |
| title | Assessing the feasibility of quantum learning algorithms for noisy linear problems |
| topic | Quantum Physics Cryptography and Security |
| url | https://arxiv.org/abs/2404.03932 |