Related papers: Beyond Trotterization: Variational Product Formula…
A fundamental challenge in digital quantum simulation (DQS) is the control of inherent errors. These appear when discretizing the time evolution generated by the Hamiltonian of a quantum many-body system as a sequence of quantum gates,…
A higher-order Suzuki-Trotter decomposition or Trotterization can be exploited to mitigate the Trotter error in digital quantum simulation. This work revisits the second-order symmetric Trotterization in terms of the Trotter error, where…
Although the simulation of quantum chemistry is one of the most anticipated applications of quantum computing, the scaling of known upper bounds on the complexity of these algorithms is daunting. Prior work has bounded errors due to…
Quantum algorithms for Hamiltonian simulation and linear differential equations more generally have provided promising exponential speed-ups over classical computers on a set of problems with high real-world interest. However, extending…
Computer-aided engineering techniques are indispensable in modern engineering developments. In particular, partial differential equations are commonly used to simulate the dynamics of physical phenomena, but very large systems are often…
We present a hybrid classical-quantum computing paradigm where the quantum part strictly runs within the coherence time of a quantum annealer, a method we call variational coherent quantum annealing (VCQA). It involves optimizing the…
Hamiltonian simulation is a promising application for quantum computers to achieve a quantum advantage. We present classical algorithms based on tensor network methods to optimize quantum circuits for this task. We show that, compared to…
We propose a new method for simulating certain type of time-dependent Hamiltonian $H(t) = \sum_{i=1}^m \gamma_i(t) H_i$ where $\gamma_i(t)$ (and its higher order derivatives) is bounded, computable function of time $t$, and each $H_i$ is…
Simulation of quantum chemistry is expected to be a principal application of quantum computing. In quantum simulation, a complicated Hamiltonian describing the dynamics of a quantum system is decomposed into its constituent terms, where the…
Quantum simulation has wide applications in quantum chemistry and physics. Recently, scientists have begun exploring the use of randomized methods for accelerating quantum simulation. Among them, a simple and powerful technique, called…
Toward scalable quantum computing, the control of quantum systems needs to be robust against both coherent errors induced by parametric uncertainties and incoherent errors induced by environmental decoherence. This poses significant…
Conventional approaches to fault-tolerant quantum computing realize logical circuits gate-by-gate, synthesizing each gate independently on one or more code blocks. This incurs excess overhead and doesn't leverage common structures in…
Combinatorial optimization is a promising application for near-term quantum computers, however, identifying performant algorithms suited to noisy quantum hardware remains as an important goal to potentially realizing quantum computational…
Variational quantum algorithms offer a promising new paradigm for solving partial differential equations on near-term quantum computers. Here, we propose a variational quantum algorithm for solving a general evolution equation through…
Product formulas for Trotter Suzuki simulation remain a practical route to Hamiltonian evolution on noisy intermediate scale quantum (NISQ) hardware, yet their accuracy hinges on three coupled choices: term grouping, product formula order,…
We introduce an optimisation method for variational quantum algorithms and experimentally demonstrate a 100-fold improvement in efficiency compared to naive implementations. The effectiveness of our approach is shown by obtaining…
Vibronic interactions between nuclear motion and electronic states are critical for the accurate modeling of photochemistry. However, accurate simulations of fully quantum non-adiabatic dynamics are often prohibitively expensive for…
The paper presents a variational quantum algorithm to solve initial-boundary value problems described by second-order partial differential equations. The approach uses hybrid classical/quantum hardware that is well suited for quantum…
We consider Hamiltonian simulation using the first order Lie-Trotter product formula under the assumption that the initial state has a high overlap with an energy eigenstate, or a collection of eigenstates in a narrow energy band. This…
We significantly enhance the simulation accuracy of initial Trotter circuits for Hamiltonian simulation of quantum systems by integrating first-order Riemannian optimization with tensor network methods. Unlike previous approaches, our…