Related papers: Quantum algorithm for simulating real time evoluti…
Simulating Hamiltonian dynamics is one of the most fundamental and significant tasks for characterising quantum materials. Recently, a series of quantum algorithms employing block-encoding of Hamiltonians have succeeded in providing…
A recent work considered quantum simulation of Quantum Electrodynamics on a lattice in the Coulomb gauge with gauge degrees of freedom represented in the occupation basis in momentum space. Here we consider the more efficient representation…
Estimating the eigenstate properties of quantum systems is a long-standing, challenging problem for both classical and quantum computing. Existing universal quantum algorithms typically rely on ideal and efficient query models (e.g. time…
We show in this paper that a strong and easy connection exists between quantum error correction and Lattice Gauge Theories (LGT) by using the Gauge symmetry to construct an efficient error-correcting code for Abelian LGTs. We identify the…
In this thesis, I investigate aspects of local Hamiltonians in quantum computing. First, I focus on the Adiabatic Quantum Computing model, based on evolution with a time dependent Hamiltonian. I show that to succeed using AQC, the…
Hamiltonian simulation is one of the most important problems in the field of quantum computing. There have been extended efforts on designing algorithms for faster simulation, and the evolution time $T$ for the simulation turns out to…
In this article, we compare the methods implementing the real-time evolution operator generated by a unitary diagonal matrix where its entries obey a known underlying real function. When the size of the unitary diagonal matrix is small, a…
Hamiltonian simulation is one of the most important problems in quantum computation, and quantum singular value transformation (QSVT) is an efficient way to simulate a general class of Hamiltonians. However, the QSVT circuit typically…
We propose an efficient quantum algorithm for simulating the dynamics of general Hamiltonian systems. Our technique is based on a power series expansion of the time-evolution operator in its off-diagonal terms. The expansion decouples the…
A potential approach for demonstrating quantum advantage is using quantum computers to simulate fermionic systems. Quantum algorithms for fermionic system simulation usually involve the Hamiltonian evolution and measurements. However, in…
The physics of high-energy colliders relies on the knowledge of different non-perturbative parton correlators, such as parton distribution functions, that encode the information on universal hadron structure and are thus the main building…
Evolutions of local Hamiltonians in short times are expected to remain local and thus limited. In this paper, we validate this intuition by proving some limitations on short-time evolutions of local time-dependent Hamiltonians. We show that…
We describe methods to construct digital quantum simulation algorithms for quantum spin systems on a regular lattice with local interactions. In addition to tools such as the Trotter-Suzuki expansion and graph coloring, we also discuss the…
Quantum simulation uses a well-known quantum system to predict the behavior of another quantum system. Certain limitations in this technique arise, however, when applied to specific problems, as we demonstrate with a theoretical and…
We develop a fourth-order Magnus expansion based quantum algorithm for the simulation of many-body problems involving two-level quantum systems with time-dependent Hamiltonians, $\mathcal{H}(t)$. A major hurdle in the utilization of the…
Compared with time independent Hamiltonians, the dynamics of generic quantum Hamiltonians $H(t)$ are complicated by the presence of time ordering in the evolution operator. In the context of digital quantum simulation, this difficulty…
The Gottesman-Knill theorem asserts that a quantum circuit composed of Clifford gates can be efficiently simulated on a classical computer. Here we revisit this theorem and extend it to quantum circuits composed of Clifford and T gates,…
The time evolution operator plays a crucial role in the precise computation of chemical experiments on quantum computers and holds immense promise for advancing the fields of physical and computer sciences, with applications spanning…
Lattice gauge theories in varying dimensions, lattice volumes, and truncations offer a rich family of targets for Hamiltonian simulation on quantum devices. In return, formulating quantum simulations can provide new ways of thinking about…
A quantum unitary gate is realized in this paper by perturbing a free charged particle in a one-dimensional box with a time- and position-varying electric field. The perturbed Hamiltonian is composed of a free particle Hamiltonian plus a…