Related papers: Qudit-native simulation of the Potts model
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…
The main objective of quantum simulation is an in-depth understanding of many-body physics. It is important for fundamental issues (quantum phase transitions, transport, . . . ) and for the development of innovative materials. Analytic…
Decomposing unitary operations into native gates is an essential step for implementing quantum algorithms. For qubit-based devices, where native gates are typically single- and two-qubit operations, a range of decomposition techniques have…
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…
The Sachdev--Ye--Kitaev (SYK) model is a prominent model of strongly interacting fermions that serves as a toy model of quantum gravity and black hole physics. In this work, we study the Trotter error and gate complexity of the quantum…
Quantum simulation represents the most promising quantum application to demonstrate quantum advantage on near-term noisy intermediate-scale quantum (NISQ) computers, yet available quantum simulation algorithms are prone to errors and thus…
Within the framework of imaginary-time evolution for matrix product states, we introduce a cluster version of the infinite time-evolving block decimation algorithm for simulating quantum many-body systems, addressing the computational…
Qutrit offers the potential for enhanced quantum computation by exploiting an enlarged Hilbert space. However, the synthesis of high-fidelity and fast qutrit gates, particularly for single qutrit, remains an ongoing challenge, as it…
Quantum dynamics can be simulated on a quantum computer by exponentiating elementary terms from the Hamiltonian in a sequential manner. However, such an implementation of Trotter steps has gate complexity depending on the total Hamiltonian…
The Potts model describes interacting spins with $Q$ different components, which is a direct generalization of the Ising model ($Q=2$). Compared to the existing exact solutions in 2D, the phase transitions and critical phenomena in the 3D…
Tensor network algorithms can efficiently simulate complex quantum many-body systems by utilizing knowledge of their structure and entanglement. These methodologies have been adapted recently for solving the Navier-Stokes equations, which…
While universal quantum computers remain under development, analog quantum simulators offer a powerful alternative for understanding complex systems in condensed matter, chemistry, and high-energy physics. One compelling application is the…
We propose an iterative algorithm to simulate the dynamics generated by any $n$-qubit Hamiltonian. The simulation entails decomposing the unitary time evolution operator $U$ (unitary) into a product of different time-step unitaries. The…
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,…
Non-equilibrium quantum many-body systems, which are difficult to study via classical computation, have attracted wide interest. Quantum simulation can provide insights into these problems. Here, using a programmable quantum simulator with…
Quantum Process Tomography (QPT) methods aim at identifying, i.e. estimating, a quantum process. QPT is a major quantum information processing tool, since it especially allows one to experimentally characterize the actual behavior of…
Strongly correlated quantum systems give rise to many exotic physical phenomena, including high-temperature superconductivity. Simulating these systems on quantum computers may avoid the prohibitively high computational cost incurred in…
Simulating quantum dynamics is one of the central applications of quantum computing. For Hamiltonians written as a sum of many terms, deterministic Trotter--Suzuki product formulas can require applying a large number of term-wise evolutions…
Quantum simulation of many-body systems offers a powerful approach to exploring collective quantum dynamics beyond classical computational reach. Although spin and fermionic models have been extensively simulated on digital quantum…
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…