Related papers: Quantum circuits for solving local fermion-to-qubi…
Compact representations of fermionic Hamiltonians are necessary to perform calculations on quantum computers that lack error-correction. A fermionic system is typically defined within a subspace of fixed particle number and spin while…
It is not possible, using standard lattice techniques in Euclidean space, to calculate the complete fermionic spectrum of a quantum field theory. Algorithms running on quantum computers have the potential to access the theory with real-time…
This work focuses on optimizing the gates of a quantum circuit with a given topology to approximate the unitary time evolution governed by a Hamiltonian. Recognizing that unitary matrices form a mathematical manifold, we employ Riemannian…
Solving partial differential equations for extremely large-scale systems within a feasible computation time serves in accelerating engineering developments. Quantum computing algorithms, particularly the Hamiltonian simulations, present a…
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…
A broad spectrum of physical systems in condensed-matter and high-energy physics, vibrational spectroscopy, and circuit and cavity QED necessitates the incorporation of bosonic degrees of freedom, such as phonons, photons, and gluons, into…
We argue that all locality-preserving mappings between fermionic observables and Pauli matrices on a two-dimensional lattice can be generated from the exact bosonization in Ref. [1], whose gauge constraints project onto the subspace of the…
The time evolution of a closed quantum system is connected to its Hamiltonian through Schroedinger's equation. The ability to estimate the Hamiltonian is critical to our understanding of quantum systems, and allows optimization of control.…
Parameterized quantum circuits are a promising technology for achieving a quantum advantage. An important application is the variational simulation of time evolution of quantum systems. To make the most of quantum hardware, variational…
This work introduces a quantum circuit synthesis framework for simulating the unitary time evolution under a subclass of symmetric Toeplitz Hamiltonians by decomposing them into specific diagonal matrices $M_k$. These matrices are then…
The general problem of finding the ground state energy of lattice Hamiltonians is known to be very hard, even for a quantum computer. We show here that this is the case even for translationally invariant systems. We also show that a quantum…
Electronic structure simulation is an anticipated application for quantum computers. Due to high-dimensional quantum entanglement in strongly correlated systems, the quantum resources required to perform such simulations are far beyond the…
We apply a hybrid evolutionary algorithm to minimize the depth of circuits in quantum computing. More specifically, we evaluate two different variants of the algorithm. In the first approach, we combine the evolutionary algorithm with an…
Various Hamiltonian simulation algorithms have been proposed to efficiently study the dynamics of quantum systems on a quantum computer. The existing algorithms generally approximate the time evolution operators, which may need a deep…
How much does local and time-periodic dynamics resemble a random unitary? In the present work we address this question by using the Clifford formalism from quantum computation. We analyse a Floquet model with disorder, characterised by a…
We present a classical simulation method for fermionic quantum systems which, without loss of generality, can be represented by parity-preserving circuits made of two-qubit gates in a brick-wall structure. We map such circuits to a…
Given a quantum Hamiltonian and its evolution time, the corresponding unitary evolution operator can be constructed in many different ways, corresponding to different trajectories between the desired end-points and different series…
It is shown that discrete-time quantum walks can be used to digitize, i.e., to time discretize fermionic models of continuous-time lattice gauge theory. The resulting discrete-time dynamics is thus not only manifestly unitary, but also…
We propose an iterative variational quantum algorithm to simulate the time evolution of arbitrary initial states within a given subspace. The algorithm compresses the Trotter circuit into a shorter-depth parameterized circuit, which is…
Quantum simulators have the exciting prospect of giving access to real-time dynamics of lattice gauge theories, in particular in regimes that are difficult to compute on classical computers. Future progress towards scalable quantum…