Quantum-inspired algorithms for multivariate analysis: from interpolation to partial differential equations
In this work we study the encoding of smooth, differentiable multivariate functions in quantum registers, using quantum computers or tensor-network representations. We show that a large family of distributions can be encoded as low-entanglement states of the quantum register. These states can be eff...
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
2021-04-01
|
Series: | Quantum |
Online Access: | https://quantum-journal.org/papers/q-2021-04-15-431/pdf/ |
id |
doaj-99f53db927c14b99a1b0377cdb6fb668 |
---|---|
record_format |
Article |
spelling |
doaj-99f53db927c14b99a1b0377cdb6fb6682021-04-15T16:47:38ZengVerein zur Förderung des Open Access Publizierens in den QuantenwissenschaftenQuantum2521-327X2021-04-01543110.22331/q-2021-04-15-43110.22331/q-2021-04-15-431Quantum-inspired algorithms for multivariate analysis: from interpolation to partial differential equationsJuan José García-RipollIn this work we study the encoding of smooth, differentiable multivariate functions in quantum registers, using quantum computers or tensor-network representations. We show that a large family of distributions can be encoded as low-entanglement states of the quantum register. These states can be efficiently created in a quantum computer, but they are also efficiently stored, manipulated and probed using Matrix-Product States techniques. Inspired by this idea, we present eight quantum-inspired numerical analysis algorithms, that include Fourier sampling, interpolation, differentiation and integration of partial derivative equations. These algorithms combine classical ideas – finite-differences, spectral methods – with the efficient encoding of quantum registers, and well known algorithms, such as the Quantum Fourier Transform. $\textit{When these heuristic methods work}$, they provide an exponential speed-up over other classical algorithms, such as Monte Carlo integration, finite-difference and fast Fourier transforms (FFT). But even when they don't, some of these algorithms can be translated back to a quantum computer to implement a similar task.https://quantum-journal.org/papers/q-2021-04-15-431/pdf/ |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Juan José García-Ripoll |
spellingShingle |
Juan José García-Ripoll Quantum-inspired algorithms for multivariate analysis: from interpolation to partial differential equations Quantum |
author_facet |
Juan José García-Ripoll |
author_sort |
Juan José García-Ripoll |
title |
Quantum-inspired algorithms for multivariate analysis: from interpolation to partial differential equations |
title_short |
Quantum-inspired algorithms for multivariate analysis: from interpolation to partial differential equations |
title_full |
Quantum-inspired algorithms for multivariate analysis: from interpolation to partial differential equations |
title_fullStr |
Quantum-inspired algorithms for multivariate analysis: from interpolation to partial differential equations |
title_full_unstemmed |
Quantum-inspired algorithms for multivariate analysis: from interpolation to partial differential equations |
title_sort |
quantum-inspired algorithms for multivariate analysis: from interpolation to partial differential equations |
publisher |
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften |
series |
Quantum |
issn |
2521-327X |
publishDate |
2021-04-01 |
description |
In this work we study the encoding of smooth, differentiable multivariate functions in quantum registers, using quantum computers or tensor-network representations. We show that a large family of distributions can be encoded as low-entanglement states of the quantum register. These states can be efficiently created in a quantum computer, but they are also efficiently stored, manipulated and probed using Matrix-Product States techniques. Inspired by this idea, we present eight quantum-inspired numerical analysis algorithms, that include Fourier sampling, interpolation, differentiation and integration of partial derivative equations. These algorithms combine classical ideas – finite-differences, spectral methods – with the efficient encoding of quantum registers, and well known algorithms, such as the Quantum Fourier Transform. $\textit{When these heuristic methods work}$, they provide an exponential speed-up over other classical algorithms, such as Monte Carlo integration, finite-difference and fast Fourier transforms (FFT). But even when they don't, some of these algorithms can be translated back to a quantum computer to implement a similar task. |
url |
https://quantum-journal.org/papers/q-2021-04-15-431/pdf/ |
work_keys_str_mv |
AT juanjosegarciaripoll quantuminspiredalgorithmsformultivariateanalysisfrominterpolationtopartialdifferentialequations |
_version_ |
1721526183531642880 |