Phase Coordinate Uncomputation in Quantum Recursive Fourier Sampling
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866909742211792896 |
|---|---|
| author | Hindlycke, Christoffer Johansson, Niklas Larsson, Jan-Åke |
| author_facet | Hindlycke, Christoffer Johansson, Niklas Larsson, Jan-Åke |
| contents | Recursive Fourier Sampling (RFS) was one of the earliest problems to demonstrate a quantum advantage, and is known to lie outside the Merlin--Arthur complexity class. This work contains a new description of quantum algorithms in phase space terminology, demonstrating its use in RFS, and how and why this gives a better understanding of the quantum advantage in RFS. Most importantly, describing the computational process of quantum computation in phase space terminology gives a much better understanding of why uncomputation is necessary when solving RFS: the advantage is present only when phase coordinate garbage is uncomputed. This is the underlying reason for the limitations of the quantum advantage. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_15938 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Phase Coordinate Uncomputation in Quantum Recursive Fourier Sampling Hindlycke, Christoffer Johansson, Niklas Larsson, Jan-Åke Quantum Physics Recursive Fourier Sampling (RFS) was one of the earliest problems to demonstrate a quantum advantage, and is known to lie outside the Merlin--Arthur complexity class. This work contains a new description of quantum algorithms in phase space terminology, demonstrating its use in RFS, and how and why this gives a better understanding of the quantum advantage in RFS. Most importantly, describing the computational process of quantum computation in phase space terminology gives a much better understanding of why uncomputation is necessary when solving RFS: the advantage is present only when phase coordinate garbage is uncomputed. This is the underlying reason for the limitations of the quantum advantage. |
| title | Phase Coordinate Uncomputation in Quantum Recursive Fourier Sampling |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2408.15938 |