Hamiltonian Simulation and Linear Combination of Unitary Decomposition of Structured Matrices

Abstract

To treat a problem with a Quantum Processing Unit (QPU), it must be transformed into a sequence of quantum operations, or gates: this is the quantum description of the problem. These operations are either packed into a query (i.e. quantum algorithm primitive) that encodes the problem, or used to construct the cost function for Variationnal Quantum Algorithm (VQA). Typical queries are the problem Hamiltonian Simulation (HS) and the problem Block-Encoding (BE). To construct the circuits associated with the quantum description, the problem must be mapped as a Linear Combination of Hermitian (LCH) or a Linear Combination of Unitary (LCU) matrices. All the summed Hamiltonian matrices or unitary matrices must have a known decomposition in basic gates. The complexity of this query should be incorporated into the quantum algorithm's query complexity, thereby limiting the processing possibilities of QPU for many problems. Qubitization constructs a specific query that respects single-qubit behavior when expressed in the appropriate basis. In this work, we extend the notion of qubitization to Hamiltonian matrices used to map the problem of interest. These methods concern almost all the problems implemented on QPUs: from second-quantization chemistry operators to graphs associated with Partial Differential Equations (PDE), or sparse matrices. This work underlines interesting properties associated with the qubitized Hamiltonian basic gate decomposition. It includes the ability to switch from LCH to LCU, to map non-Hermitian problems, and to construct the different quantum circuit primitives (queries) needed for the quantum description of the problem. We also provide a list of qubitized Hamiltonians that are used for the matrix decomposition of many structured matrices. These structured matrices are associated with graph adjacency matrices that can be combined to implement structured matrices.