Fragmentation is Efficiently Learnable by Quantum Neural Networks
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_ | 1866910195014172672 |
|---|---|
| author | Mints, Mikhail Anschuetz, Eric R. |
| author_facet | Mints, Mikhail Anschuetz, Eric R. |
| contents | In certain classes of physical quantum systems, the exponentially large state space "fragments" into many low-dimensional, dynamically disconnected subspaces. We introduce a learning problem known as fragment classification, where given a quantum state input, one is interested in classifying to which subspace the state belongs. We prove that solving this learning problem is efficient on a quantum computer when the fragmentation phenomenon satisfies certain conditions. Furthermore, we give evidence supporting the classical hardness of this task by demonstrating that known dequantization techniques fail for the fragment classification problem. Consequently, this work provides a rare example of a physically motivated quantum machine learning task that is both efficient for quantum computers to perform and admits no known classical dequantization. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_00751 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Fragmentation is Efficiently Learnable by Quantum Neural Networks Mints, Mikhail Anschuetz, Eric R. Quantum Physics Machine Learning In certain classes of physical quantum systems, the exponentially large state space "fragments" into many low-dimensional, dynamically disconnected subspaces. We introduce a learning problem known as fragment classification, where given a quantum state input, one is interested in classifying to which subspace the state belongs. We prove that solving this learning problem is efficient on a quantum computer when the fragmentation phenomenon satisfies certain conditions. Furthermore, we give evidence supporting the classical hardness of this task by demonstrating that known dequantization techniques fail for the fragment classification problem. Consequently, this work provides a rare example of a physically motivated quantum machine learning task that is both efficient for quantum computers to perform and admits no known classical dequantization. |
| title | Fragmentation is Efficiently Learnable by Quantum Neural Networks |
| topic | Quantum Physics Machine Learning |
| url | https://arxiv.org/abs/2512.00751 |