Effective low-energy theories represent powerful theoretical tools to reduce the complexity in modeling interacting quantum many-particle systems. However, common theoretical methods rely on perturbation theory, which limits their applicability to weak interactions. Here we introduce the Variational Adiabatic Gauge Transformation (VAGT), a nonperturbative hybrid quantum algorithm that can use nowadays quantum computers to learn the variational parameters of the unitary circuit that brings the Hamiltonian to either its block-diagonal or full-diagonal form. If a Hamiltonian can be diagonalized via a shallow quantum circuit, then VAGT can learn the optimal parameters using a polynomial number of runs. The accuracy of VAGT is tested through numerical simulations, as well as simulations on Rigetti and IonQ quantum computers.
Block encoding is a successful technique used in several powerful quantum algorithms. In this work we provide an explicit quantum circuit for block encoding a sparse matrix with a periodic diagonal structure. The proposed methodology is based on the linear combination of unitaries (LCU) framework and on an efficient unitary operator used to project the complex exponential at a frequency
ω multiplied by the computational basis into its real and imaginary components. We demonstrate a distinct computational advantage with a
O(poly(n)) gate complexity, where
n is the number of qubits, in the worst-case scenario used for banded matrices, and
O(n) when dealing with a simple diagonal matrix, compared to the exponential scaling of general-purpose methods for dense matrices. Various applications for the presented methodology are discussed in the context of solving differential problems such as the advection-diffusion-reaction (ADR) dynamics, using quantum algorithms with optimal scaling, e.g., quantum singular value transformation (QSVT). Numerical results are used to validate the analytical formulation.
Diagonal unitary operators are commonly found in many quantum algorithms. They find application as analytical potential operators for quantum simulation, as well as for complex oracles used in quantum searches. However, in order to implement a quantum algorithm on a given quantum device, each operator must be decomposed into a sequence of fault-tolerant, device-level instructions. In general, to implement an
n-qubit diagonal unitary {\\em exactly} on a quantum computer generally requires
2n+1−3 one- and two-qubit gates. However, for most practical implementations of diagonal unitaries, some degree of approximation will be necessary if the circuit is to be efficient. In this thesis we develop two complementary methods for the approximate synthesis of quantum circuits for diagonal unitaries. We show how to apply these techniques to real-space quantum simulation and show how efficient high fidelity quantum simulations can be implemented with low-depth quantum circuits.