Related papers: Variational Hamiltonian Diagonalization for Dynami…
This work investigates variational compilation methods for simulating quantum systems with internal SU(2) symmetry. The central component of the research is the application of the Dynamic Mode Decomposition (DMD) method to extrapolate…
Variational hybrid quantum-classical algorithms are some of the most promising workloads for near-term quantum computers without error correction. The aim of these variational algorithms is to guide the quantum system to a target state that…
Quantum computing promises transformative impacts in simulating Hamiltonian dynamics, essential for studying physical systems inaccessible by classical computing. However, existing compilation techniques for Hamiltonian simulation, in…
Bosonic quantum devices, which utilize harmonic oscillator modes to encode information, are emerging as a promising alternative to conventional qubit-based quantum devices, especially for the simulation of vibrational dynamics and…
We present a novel approach to solve the advection-diffusion equation under arbitrary transporting fields using a quantum-inspired 'Schrodingerisation' technique for Hamiltonian simulation. Although numerous methods exist for solving…
Imaginary time evolution is a powerful tool for studying quantum systems. While it is possible to simulate with a classical computer, the time and memory requirements generally scale exponentially with the system size. Conversely, quantum…
We develop circuit implementations for digital-level quantum Hamiltonian dynamics simulation algorithms suitable for implementation on a reconfigurable quantum computer, such as trapped ions. Our focus is on the co-design of a problem, its…
Understanding the dynamics of quantum systems is crucial in many areas of physics, but simulating many-body systems presents significant challenges due to the large Hilbert space to navigate and the exponential growth of computational…
Non-autonomous dynamical systems appear in a very wide range of interesting applications, both in classical and quantum dynamics, where in the latter case it corresponds to having a time-dependent Hamiltonian. However, the quantum…
The efficient simulation of quantum dynamics and ground states is a central challenge in physics and a key frontier for quantum advantage. While short-time evolution in one-dimensional systems can often be simulated classically, extending…
Simulating the dynamic evolutions of physical and molecular systems in a quantum computer is of fundamental interest in many applications. Its implementation requires efficient quantum simulation algorithms. The Lie-Trotter-Suzuki…
Trotterization is the most common and convenient approximation method for Hamiltonian simulations on digital quantum computers, but estimating its error accurately is computationally difficult for large quantum systems. Here, we develop a…
The estimation of low energies of many-body systems is a cornerstone of computational quantum sciences. Variational quantum algorithms can be used to prepare ground states on pre-fault-tolerant quantum processors, but their lack of…
Quantum algorithms for selecting a subspace of Hamiltonians to diagonalize have emerged as a promising alternative to variational algorithms in the NISQ era. So far, such algorithms, which include the quantum selected configuration…
Quantum computation of vibrational properties of molecules is a promising platform to obtain computational advantages for computational chemistry. However, fault-tolerant quantum computations of vibrational properties remain a relatively…
Quantum computing has the potential to revolutionize quantum chemistry and material science by offering solutions to complex problems unattainable with classical computers. However, the development of efficient quantum algorithms that are…
This paper proposes a novel approach to Hamiltonian simulation using Decision Diagrams (DDs), which are an exact representation based on exploiting redundancies in representations of quantum states and operations. While the simulation of…
In this work we propose an approach for implementing time-evolution of a quantum system using product formulas. The quantum algorithms we develop have provably better scaling (in terms of gate complexity and circuit depth) than a naive…
Quantum computers are expected to help us to achieve accurate simulation of the dynamics of many-body quantum systems. However, the limitations of current NISQ devices prevents us from realising this goal today. Recently an algorithm for…
Quantum signal processing provides an optimal procedure for simulating Hamiltonian evolution on a quantum computer using calls to a block encoding of the Hamiltonian. In many situations it is possible to control between forward and reverse…