Related papers: Variationally Compressing Quantum Circuits to Appr…
We describe tensor network algorithms to optimize quantum circuits for adiabatic quantum computing. To suppress diabatic transitions, we include counterdiabatic driving in the optimization and utilize variational matrix product operators to…
The time evolution of quantum many-body systems is one of the most promising applications for near-term quantum computers. However, the utility of current quantum devices is strongly hampered by the proliferation of hardware errors. The…
One of the key applications for quantum computers will be the simulation of other quantum systems that arise in chemistry, materials science, etc, in order to accelerate the process of discovery. It is important to ask: Can this be achieved…
The study of out-of-equilibrium quantum many-body dynamics remains one of the most exciting research frontiers of physics, standing at the crossroads of our understanding of complex quantum phenomena and the realization of quantum…
One of the key applications for the emerging quantum simulators is to emulate the ground state of many-body systems, as it is of great interest in various fields from condensed matter physics to material science. Traditionally, in an analog…
Utilizing counterdiabatic (CD) driving - aiming at suppression of diabatic transition - in digitized adiabatic evolution have garnered immense interest in quantum protocols and algorithms. However, improving the approximate CD terms with a…
A complex but important challenge in understanding quantum mechanical phenomena is the simulation of quantum many-body dynamics. Although quantum computers offer significant potential to accelerate these simulations, their practical…
Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. This approach typically relies on deep circuits and is therefore hampered by the substantial…
Quantum algorithms are prominent in the pursuit of achieving quantum advantage in various computational tasks. However, addressing challenges, such as limited qubit coherence and high error rate in near-term devices, requires extensive…
The advent of near-term digital quantum computers could offer us an exciting opportunity to investigate quantum many-body phenomena beyond that of classical computing. To make the best use of the hardware available, it is paramount that we…
Quantum computation is an attractive front for many problems that are intractable for computers today. One such problem is nonadiabatic quantum molecular dynamics, where quantized internal states coupling to parameterized modes result in a…
In adiabatic quantum computing the aim is to track an eigenstate as the Hamiltonian changes. In the usual setup this is achieved using the natural time-dependent Hamiltonian evolution of the system and the main technical tool is the…
We propose a variational alternative to the Trotter-Suzuki decomposition that provides greater control over errors while preserving the unitary structure of time evolution. The variational parameters in our ansatz are derived from a global…
Simulations of quantum dynamics are a key application of near term quantum computing, but are hindered by the twin challenges of noise and small device scale, which limit the executable circuit depths and the number of qubits the algorithm…
We propose a hybrid approach to simulate quantum many body dynamics by combining Trotter based quantum algorithm with classical dynamic mode decomposition. The interest often lies in estimating observables rather than explicitly obtaining…
Understanding the impact of gate errors on quantum circuits is crucial to determining the potential applications of quantum computers, especially in the absence of large-scale error-corrected hardware. We put forward analytical arguments,…
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…
Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware. Synthesizing the corresponding quantum circuit is typically done by breaking the evolution into small time steps, also known as…
The simulation of quantum dynamics calls for quantum algorithms working in first quantized grid encodings. Here, we propose a variational quantum algorithm for performing quantum dynamics in first quantization. In addition to the usual…
The adaptive variational quantum dynamics simulation (AVQDS) method performs real-time evolution of quantum states using automatically generated parameterized quantum circuits that often contain substantially fewer gates than Trotter…