



A fault-tolerant quantum computer could provide an exponential speedup over the best classical algorithms for certain applications. While proposals exist for specific instances, their adaptation to practical cases remains poorly defined. This is particularly true for solving Partial Differential Equations (PDEs), a major challenge in numerical computing, as well as for other applications requiring the preparation of initial states corresponding to discretized multivariate functions. Although such initializations can be achieved with a quadratic advantage using amplitude amplification methods, they raise the following question: Which distributions defined by multivariate functions can be efficiently implemented on exponentially large quantum states?
This theses explores approaches based on basis transformations, i.e., the search for transition matrices that can be efficiently decomposed into quantum gates and provide access to bases where the function's representation is sparse. The developed methods could also address the so-called "output or readout problem", where the expected result is naturally sparse in a function basis.

