Efficient quantum amplitude encoding of polynomial functions
Loading functions into quantum computers represents an essential step in several quantum
algorithms, such as quantum partial differential equation solvers. Therefore, the inefficiency …
algorithms, such as quantum partial differential equation solvers. Therefore, the inefficiency …
[HTML][HTML] Random density matrices: Closed form expressions for the variance of squared Hilbert-Schmidt distance
One of the fundamental aspects of quantum information theory is the study of distance
measures between quantum states. Hilbert-Schmidt distance serves as a convenient choice …
measures between quantum states. Hilbert-Schmidt distance serves as a convenient choice …
Quantum Dynamic Programming
We introduce a quantum extension of dynamic programming, a fundamental computational
method for efficiently solving recursive problems using memory. Our innovation lies in …
method for efficiently solving recursive problems using memory. Our innovation lies in …
Efficient quantum amplitude encoding of polynomial functions
J González, TW Watts, P Rodriguez-Grasa, M Sanz - 2024 - bird.bcamath.org
Loading functions into quantum computers represents an essential step in several quantum
algorithms, such as quantum partial differential equation solvers. Therefore, the inefficiency …
algorithms, such as quantum partial differential equation solvers. Therefore, the inefficiency …