Algorithms & Applications#

Utilizing block-encodings as programming abstraction – in principle – enables the realization of a vast array of fundamental tasks in quantum computation [Martyn2021]. Through (Generalized) Quantum Signal Processing (QSP) [Motlagh2024] and its derivatives Quantum Eigenvalue Transform (QET) and Quantum Singular Value Transformation (QSVT) [Gilyén2019], [Sünderhauf2023], diverse algorithms – ranging from Hamiltonian simulation to linear systems solvers – can be expressed as polynomial transformations of a block-encoded matrix.

While it serves as a powerful toolbox for designing algorithms with rigorous performance bounds, its practical viability depends heavily on the specific application and the underlying hardware constraints. In many scenarios, established alternatives remain highly competitive: for example, Trotter-Suzuki decompositions are often more straightforward for near-term Hamiltonian simulation, variational methods may be better suited for noisy hardware, and traditional Quantum Phase Estimation (QPE) remains a standard for Shor’s algorithm. Ultimately, block-encodings should be viewed as a modular and expressive language that complements, rather than replaces, the existing suite of quantum algorithmic strategies.

Key applications of block-encodings are:

  • Matrix Inversion: Solves the Quantum Linear Systems Problem (QLSP) by applying a polynomial transformation approximating \(1/x\) to the eigenvalues of an encoded matrix [Childs2017].

  • Ground State Preparation: Efficiently prepares eigenstates using eigenstate filtering – applying a polynomial that acts as a band-pass filter on the spectrum of the Hamiltonian.

  • Hamiltonian Simulation: Implements time-evolution \(e^{-iHt}\) by approximating the exponential function with a low-degree polynomial [Low2019].

inv()

Returns a BlockEncoding approximating the matrix inversion of the operator.

poly()

Returns a BlockEncoding representing a polynomial transformation of the operator.

sim()

Returns a BlockEncoding approximating Hamiltonian simulation of the operator.

References

To understand the theoretical framework underpinning these algorithms, refer to the following seminal works: