Leveraging modular values in quantum algorithms: the Deutsch-Jozsa
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_ | 1866916282538917888 |
|---|---|
| author | Ferraz, Lorena Ballesteros Carletti, Timoteo Caudano, Yves |
| author_facet | Ferraz, Lorena Ballesteros Carletti, Timoteo Caudano, Yves |
| contents | We present a novel approach to quantum algorithms, by taking advantage of modular values, i.e., complex and unbounded quantities resulting from specific post-selected measurement scenarios. Our focus is on the problem of ascertaining whether a given function acting on a set of binary values is constant (uniformly yielding outputs of either all 0 or all 1), or balanced (a situation wherein half of the outputs are 0 and the other half are 1). Such problem can be solved by relying on the Deutsch-Jozsa algorithm. The proposed method, relying on the use of modular values, provides a high number of degrees of freedom for optimizing the new algorithm inspired from the Deutsch-Jozsa one. In particular, we explore meticulously the choices of the pre- and post-selected states. We eventually test the novel theoretical algorithm on a quantum computing platform. While the outcomes are currently not on par with the conventional approach, they nevertheless shed light on potential for future improvements, especially with less-optimized algorithms. We are thus confidend that the proposed proof of concept could prove its validity in bridging quantum algorithms and modular values research fields. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_06803 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Leveraging modular values in quantum algorithms: the Deutsch-Jozsa Ferraz, Lorena Ballesteros Carletti, Timoteo Caudano, Yves Quantum Physics We present a novel approach to quantum algorithms, by taking advantage of modular values, i.e., complex and unbounded quantities resulting from specific post-selected measurement scenarios. Our focus is on the problem of ascertaining whether a given function acting on a set of binary values is constant (uniformly yielding outputs of either all 0 or all 1), or balanced (a situation wherein half of the outputs are 0 and the other half are 1). Such problem can be solved by relying on the Deutsch-Jozsa algorithm. The proposed method, relying on the use of modular values, provides a high number of degrees of freedom for optimizing the new algorithm inspired from the Deutsch-Jozsa one. In particular, we explore meticulously the choices of the pre- and post-selected states. We eventually test the novel theoretical algorithm on a quantum computing platform. While the outcomes are currently not on par with the conventional approach, they nevertheless shed light on potential for future improvements, especially with less-optimized algorithms. We are thus confidend that the proposed proof of concept could prove its validity in bridging quantum algorithms and modular values research fields. |
| title | Leveraging modular values in quantum algorithms: the Deutsch-Jozsa |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2406.06803 |