Demonstration of Hardware Efficient Photonic Variational Quantum Algorithm
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_ | 1866918265787252736 |
|---|---|
| author | Agresti, Iris Paul, Koushik Schiansky, Peter Steiner, Simon Yin, Zhenghao Pentangelo, Ciro Piacentini, Simone Crespi, Andrea Ban, Yue Ceccarelli, Francesco Osellame, Roberto Chen, Xi Walther, Philip |
| author_facet | Agresti, Iris Paul, Koushik Schiansky, Peter Steiner, Simon Yin, Zhenghao Pentangelo, Ciro Piacentini, Simone Crespi, Andrea Ban, Yue Ceccarelli, Francesco Osellame, Roberto Chen, Xi Walther, Philip |
| contents | Quantum computing has brought a paradigm change in computer science, where non-classical technologies have promised to outperform their classical counterpart. Such an advantage was only demonstrated for tasks without practical applications, still out of reach for the state-of-art quantum technologies. In this context, a promising strategy to find practical use of quantum computers is to exploit hybrid quantum-classical models, where a quantum device estimates a hard-to-compute quantity, while a classical optimizer trains the parameters of the model. In this work, we demonstrate that single photons and linear optical networks are sufficient for implementing Variational Quantum Algorithms, when the problem specification, or ansatz, is tailored to this specific platform. We show this by a proof-of-principle demonstration of a variational approach to tackle an instance of a factorization task, whose solution is encoded in the ground state of a suitable Hamiltonian. This work which combines Variational Quantum Algorithms with hardware efficient ansatzes for linear-optics networks showcases a promising pathway towards practical applications for photonic quantum platforms. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_10339 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Demonstration of Hardware Efficient Photonic Variational Quantum Algorithm Agresti, Iris Paul, Koushik Schiansky, Peter Steiner, Simon Yin, Zhenghao Pentangelo, Ciro Piacentini, Simone Crespi, Andrea Ban, Yue Ceccarelli, Francesco Osellame, Roberto Chen, Xi Walther, Philip Quantum Physics Quantum computing has brought a paradigm change in computer science, where non-classical technologies have promised to outperform their classical counterpart. Such an advantage was only demonstrated for tasks without practical applications, still out of reach for the state-of-art quantum technologies. In this context, a promising strategy to find practical use of quantum computers is to exploit hybrid quantum-classical models, where a quantum device estimates a hard-to-compute quantity, while a classical optimizer trains the parameters of the model. In this work, we demonstrate that single photons and linear optical networks are sufficient for implementing Variational Quantum Algorithms, when the problem specification, or ansatz, is tailored to this specific platform. We show this by a proof-of-principle demonstration of a variational approach to tackle an instance of a factorization task, whose solution is encoded in the ground state of a suitable Hamiltonian. This work which combines Variational Quantum Algorithms with hardware efficient ansatzes for linear-optics networks showcases a promising pathway towards practical applications for photonic quantum platforms. |
| title | Demonstration of Hardware Efficient Photonic Variational Quantum Algorithm |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2408.10339 |