Related papers: Long-time simulations with high fidelity on quantu…
Near term quantum computers with a high quantity (around 50) and quality (around 0.995 fidelity for two-qubit gates) of qubits will approximately sample from certain probability distributions beyond the capabilities of known classical…
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…
It is imperative that useful quantum computers be very difficult to simulate classically; otherwise classical computers could be used for the applications envisioned for the quantum ones. Perfect quantum computers are unarguably…
Compiling a given quantum algorithm into a target hardware architecture is a challenging optimization problem. The compiler must take into consideration the coupling graph of physical qubits and the gate operation dependencies. The existing…
Fidelity is a fundamental measure for the closeness of two quantum states, which is important both from a theoretical and a practical point of view. Yet, in general, it is difficult to give good estimates of fidelity, especially when one…
In a recent milestone experiment, Google's processor Sycamore heralded the era of "quantum supremacy" by sampling from the output of (pseudo-)random circuits. We show that such random circuits provide tailor-made building blocks for…
We study a quantum computer with fixed and permanent interaction of diagonal type between qubits. It is controlled only by one-qubit quick transformations. It is shown how to implement Quantum Fourier Transform and to solve Shroedinger…
Quantum computers have the potential to simulate chemical systems beyond the capability of classical computers. Recent developments in hybrid quantum-classical approaches enable the determinations of the ground or low energy states of…
Large-scale digital quantum simulations require thousands of fundamental entangling gates to construct the simulated dynamics. Despite success in a variety of small-scale simulations, quantum information processing platforms have hitherto…
Despite the continuous advancements in size and robustness of real quantum devices, reliable large-scale quantum computers are not yet available. Hence, classical simulation of quantum algorithms remains crucial for testing new methods and…
Simulating Clifford and near-Clifford circuits using the extended stabilizer formalism has become increasingly popular, particularly in quantum error correction. Compared to the state-vector approach, the extended stabilizer formalism can…
Nonequilibrium time evolution of large quantum systems is a strong candidate for quantum advantage. Variational quantum algorithms have been put forward for this task, but their quantum optimization routines suffer from trainability and…
Simulation of the time-dynamics of fermionic many-body systems has long been predicted to be one of the key applications of quantum computers. Such simulations -- for which classical methods are often inaccurate -- are critical to advancing…
In dynamic quantum circuits, classical information from mid-circuit measurements is fed forward during circuit execution. This emerging capability of quantum computers confers numerous advantages that can enable more efficient and powerful…
Simulating quantum dynamics beyond the reach of classical computers is one of the main envisioned applications of quantum computers. The most promising quantum algorithms to this end in the near-term are the simplest, which use the Trotter…
In a circuit-based quantum computer, the computing is performed via the discrete-time evolution driven by quantum gates. Accurate simulation of continuoustime evolution requires a large number of quantum gates and therefore suffers from…
We propose using variational quantum algorithms (VQAs) to simulate established quantum algorithms under realistic noise conditions, aiming to surpass the fidelity of theoretical circuits in noisy environments. Focusing on the Quantum…
Non-abelian gauge theories underlie our understanding of fundamental forces in nature, and developing tailored quantum hardware and algorithms to simulate them is an outstanding challenge in the rapidly evolving field of quantum simulation.…
We consider simulating quantum systems on digital quantum computers. We show that the performance of quantum simulation can be improved by simultaneously exploiting commutativity of the target Hamiltonian, sparsity of interactions, and…
Efficient simulation of interacting fermionic systems is a key application of near-term quantum computers, but is hindered by the overhead required to encode fermionic operators on qubit hardware. Here, we consider models with $N$ fermionic…