Conditions for a quadratic quantum speedup in nonlinear transforms with applications to energy contract pricing
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , , , , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2023
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866912691886489600 |
|---|---|
| author | Agliardi, Gabriele O'Meara, Corey Yogaraj, Kavitha Ghosh, Kumar Sabino, Piergiacomo Fernández-Campoamor, Marina Cortiana, Giorgio Bernabé-Moreno, Juan Tacchino, Francesco Mezzacapo, Antonio Shehab, Omar |
| author_facet | Agliardi, Gabriele O'Meara, Corey Yogaraj, Kavitha Ghosh, Kumar Sabino, Piergiacomo Fernández-Campoamor, Marina Cortiana, Giorgio Bernabé-Moreno, Juan Tacchino, Francesco Mezzacapo, Antonio Shehab, Omar |
| contents | Computing nonlinear functions over multilinear forms is a general problem with applications in risk analysis. For instance in the domain of energy economics, accurate and timely risk management demands for efficient simulation of millions of scenarios, largely benefiting from computational speedups. We develop a novel hybrid quantum-classical algorithm based on polynomial approximation of nonlinear functions, computed through Quantum Hadamard Products, and we rigorously assess the conditions for its end-to-end speedup for different implementation variants against classical algorithms. In our setting, a quadratic quantum speedup, up to polylogarithmic factors, can be proven only when forms are bilinear and approximating polynomials have second degree, if efficient loading unitaries are available for the input data sets. We also enhance the bidirectional encoding, that allows tuning the balance between circuit depth and width, proposing an improved version that can be exploited for the calculation of inner products. Lastly, we exploit the dynamic circuit capabilities, recently introduced on IBM Quantum devices, to reduce the average depth of the Quantum Hadamard Product circuit. A proof of principle is implemented and validated on IBM Quantum systems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2304_10385 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Conditions for a quadratic quantum speedup in nonlinear transforms with applications to energy contract pricing Agliardi, Gabriele O'Meara, Corey Yogaraj, Kavitha Ghosh, Kumar Sabino, Piergiacomo Fernández-Campoamor, Marina Cortiana, Giorgio Bernabé-Moreno, Juan Tacchino, Francesco Mezzacapo, Antonio Shehab, Omar Quantum Physics Emerging Technologies F.1.3 Computing nonlinear functions over multilinear forms is a general problem with applications in risk analysis. For instance in the domain of energy economics, accurate and timely risk management demands for efficient simulation of millions of scenarios, largely benefiting from computational speedups. We develop a novel hybrid quantum-classical algorithm based on polynomial approximation of nonlinear functions, computed through Quantum Hadamard Products, and we rigorously assess the conditions for its end-to-end speedup for different implementation variants against classical algorithms. In our setting, a quadratic quantum speedup, up to polylogarithmic factors, can be proven only when forms are bilinear and approximating polynomials have second degree, if efficient loading unitaries are available for the input data sets. We also enhance the bidirectional encoding, that allows tuning the balance between circuit depth and width, proposing an improved version that can be exploited for the calculation of inner products. Lastly, we exploit the dynamic circuit capabilities, recently introduced on IBM Quantum devices, to reduce the average depth of the Quantum Hadamard Product circuit. A proof of principle is implemented and validated on IBM Quantum systems. |
| title | Conditions for a quadratic quantum speedup in nonlinear transforms with applications to energy contract pricing |
| topic | Quantum Physics Emerging Technologies F.1.3 |
| url | https://arxiv.org/abs/2304.10385 |