Related papers: Hamiltonian sparsification and gap-simulations
The simulation of quantum systems has been a key aim of quantum technologies for decades, and the generalisation to open systems is necessary to include physically realistic systems. We introduce an approach for quantum simulations of open…
Determining properties of ground states of spin Hamiltonians remains a topic of central relevance connecting disciplines of mathematical, theoretical and applied physics. In the last few decades, ground state properties of physical systems…
High-dimensional simulation optimization is notoriously challenging. We propose a new sampling algorithm that converges to a global optimal solution and suffers minimally from the curse of dimensionality. The algorithm consists of two…
The physics of a quantum system with many degrees of freedom is often approximated by downfolding: most of the degrees of freedom are "folded into" a much smaller number of degrees of freedom, resulting in an effective Hamiltonian that…
Quantum Hamiltonian simulation, which simulates the evolution of quantum systems and probes quantum phenomena, is one of the most promising applications of quantum computing. Recent experimental results suggest that Hamiltonian-oriented…
Analog quantum simulation offers a hardware-specific approach to studying quantum dynamics, but mapping a model Hamiltonian onto the available device parameters requires matching the hardware dynamics. We introduce a paradigm for quantum…
Although a universal quantum computer is still far from reach, the tremendous advances in controllable quantum devices, in particular with solid-state systems, make it possible to physically implement "quantum simulators". 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 develop a framework and give an example for situations where two distinct Hamiltonians living in the same Hilbert space can be used to simulate the same physics. As an example of an analog simulation, we first discuss how one can…
We present a quantum algorithm for simulating the dynamics of Hamiltonians that are not necessarily sparse. Our algorithm is based on the input model where the entries of the Hamiltonian are stored in a data structure in a quantum random…
To date, all proposed quantum algorithms for simulating quantum field theory (QFT) simulate (continuous-time) Hamiltonian lattice QFT as a stepping stone. Two overlooked issues are how large we can take the timestep in these simulations…
We develop randomized quantum algorithms to simulate quantum collision models, also known as repeated interaction schemes, which provide a rich framework to model various open-system dynamics. The underlying technique involves composing…
It is crucial to reduce the resources required to run quantum algorithms and simulate physical systems on quantum computers due to coherence time limitations. With regards to Hamiltonian simulation, a significant effort has focused on…
With a view toward addressing the explosive growth in the computational demands of nuclear structure and reactions modeling, we develop a novel quantum algorithm for neutron-nucleus simulations with general potentials, which provides…
The practical application of quantum technologies to chemical problems faces significant challenges, particularly in the treatment of realistic basis sets and the accurate inclusion of electron correlation effects. A direct approach to…
Quantum simulation of non-Abelian gauge theories requires careful handling of gauge redundancy. We address this challenge by presenting universal principles for treating gauge symmetry that apply to any quantum simulation approach,…
We propose dynamical control schemes for Hamiltonian simulation in many-body quantum systems that avoid instantaneous control operations and rely solely on realistic bounded-strength control Hamiltonians. Each simulation protocol consists…
The Hamiltonian constraint remains an elusive object in loop quantum gravity because its action on spinnetworks leads to changes in their corresponding graphs. As a result, calculations in loop quantum gravity are often considered…
In this work, we present a new algorithm for generating quantum circuits that efficiently implement continuous time quantum walks on arbitrary simple sparse graphs. The algorithm, called matching decomposition, works by decomposing a…
In this work, using a NISQ framework, we obtain the gap of a BCS Hamiltonian. This could lead to interesting implications for superconductivity research. For such task, we choose to use the Variational Quantum Deflation and analyze the…