Related papers: Composite Quantum Simulations
The Trotter-Suzuki approximation leads to an efficient algorithm for solving the time-dependent Schr\"odinger equation. Using existing highly optimized CPU and GPU kernels, we developed a distributed version of the algorithm that runs…
One of the core research questions in the theory of quantum computing is to find out to what precise extent the classical simulation of a noisy quantum circuits is possible and where potential quantum advantages can set in. In this work, we…
As physical implementations of quantum architectures emerge, it is increasingly important to consider the cost of algorithms for practical connectivities between qubits. We show that by using an arrangement of gates that we term the…
Quantum circuit simulations are critical for evaluating quantum algorithms and machines. However, the number of state amplitudes required for full simulation increases exponentially with the number of qubits. In this study, we leverage data…
A primary objective of quantum computation is to efficiently simulate quantum physics. Scientifically and technologically important quantum Hamiltonians include those with spin-$s$, vibrational, photonic, and other bosonic degrees of…
Simulation of quantum systems is notoriously challenging for classical computers, while quantum hardware is naturally well-suited for this task. However, the imperfections of contemporary quantum systems poses a considerable challenge in…
Quantum simulation is one of the central discipline to demonstrate the power of quantum computing. In recent years, the theoretical framework of quantum superchannels has been developed and applied widely as the extension of quantum…
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…
The potential of employing higher orders of the Trotter-Suzuki decomposition of the evolution operator for more effective simulations of quantum systems on a noisy quantum computer is explored. By examining the transverse-field Ising model…
Quantum simulation is of great importance in quantum information science. Here, we report an experimental quantum channel simulator imbued with an algorithm for imitating the behavior of a general class of quantum systems. The reported…
Quantum simulation has begun to penetrate the field of quantum chemistry in hopes of efficiently calculating ground state energies and approximating real-time evolution. With modern research highlighting nonadiabatic dynamics, tunably…
Simulating vibrational dynamics is essential for understanding molecular structure, unlocking useful applications such as vibrational spectroscopy for high-fidelity chemical detection. Quantum algorithms for vibrational dynamics are…
Simulating quantum circuits is a computationally intensive task that relies heavily on tensor products and matrix multiplications, which can be inefficient. Recent advancements, eliminate the need for tensor products and matrix…
Solving the electronic structure problem via unitary evolution of the electronic Hamiltonian is one of the promising applications of digital quantum computers. One of the practical strategies to implement the unitary evolution is via…
The product formula, commonly known as Trotter decomposition, is a central tool for digital quantum simulation, whose performance depends critically on how the Hamiltonian is partitioned into tractable blocks. Standard decompositions…
We study a variation of the Trotter-Suzuki decomposition, in which a Hamiltonian exponential is approximated by an ordered product of two-qubit operator exponentials such that the Trotter step size is enhanced for a small number of terms.…
Simulating large-scale coupled-oscillator systems presents substantial computational challenges for classical algorithms, particularly when pursuing first-principles analyses in the thermodynamic limit. Motivated by the quantum algorithm…
We introduce a novel method for strong classical simulation of quantum circuits based on optimally k-partitioning ZX-diagrams, reducing each part individually, and then efficiently cross-referencing their results to conclude the overall…
Simulating physical systems on quantum devices is one of the most promising applications of quantum technology. Current quantum approaches to simulating open quantum systems are still practically challenging on NISQ-era devices, because…
Most quantum compilers assume programs are reversible unitary circuits. This fits closed-system algorithms, but not open-system simulation, where the natural program objects are quantum channels describing non-unitary dynamics. We present a…