Quantum Complexity vs Classical Complexity: A Survey
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2023
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866929497516802048 |
|---|---|
| author | Vaezi, Arash Movaghar, Ali Ghodsi, Mohammad Kazemi, Seyed Mohammad Hussein Noghrehy, Negin Bagheri Kazemi, Seyed Mohsen |
| author_facet | Vaezi, Arash Movaghar, Ali Ghodsi, Mohammad Kazemi, Seyed Mohammad Hussein Noghrehy, Negin Bagheri Kazemi, Seyed Mohsen |
| contents | Scientists have demonstrated that quantum computing has presented novel approaches to address computational challenges, each varying in complexity. Adapting problem-solving strategies is crucial to harness the full potential of quantum computing. Nonetheless, there are defined boundaries to the capabilities of quantum computing. This paper concentrates on aggregating prior research efforts dedicated to solving intricate classical computational problems through quantum computing. The objective is to systematically compile an exhaustive inventory of these solutions and categorize a collection of demanding open problems that await further exploration. Through statistical analysis, we help the researchers with their further investigations. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2312_14075 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Quantum Complexity vs Classical Complexity: A Survey Vaezi, Arash Movaghar, Ali Ghodsi, Mohammad Kazemi, Seyed Mohammad Hussein Noghrehy, Negin Bagheri Kazemi, Seyed Mohsen Computational Complexity Quantum Physics Scientists have demonstrated that quantum computing has presented novel approaches to address computational challenges, each varying in complexity. Adapting problem-solving strategies is crucial to harness the full potential of quantum computing. Nonetheless, there are defined boundaries to the capabilities of quantum computing. This paper concentrates on aggregating prior research efforts dedicated to solving intricate classical computational problems through quantum computing. The objective is to systematically compile an exhaustive inventory of these solutions and categorize a collection of demanding open problems that await further exploration. Through statistical analysis, we help the researchers with their further investigations. |
| title | Quantum Complexity vs Classical Complexity: A Survey |
| topic | Computational Complexity Quantum Physics |
| url | https://arxiv.org/abs/2312.14075 |