Related papers: Qudit-native simulation of the Potts model
In this work, we investigate the effect of decomposition basis on primitive qudit gates on superconducting radio-frequency cavity-based quantum computers with applications to lattice gauge theory. Three approaches are tested: SNAP &…
Quantum simulation has become a promising avenue of research that allows one to simulate and gain insight into the models of High Energy Physics whose experimental realizations are either complicated or inaccessible with current technology.…
We develop a numerical method based on matrix product states for simulating quantum many-body systems at finite temperatures without importance sampling and evaluate its performance in spin 1/2 systems. Our method is an extension of the…
Recent work has deployed linear combinations of unitaries techniques to reduce the cost of fault-tolerant quantum simulations of correlated electron models. Here, we show that one can sometimes improve upon those results with optimized…
As quantum processors grow in scale and reliability, the need for efficient quantum gate decomposition of circuits to a set of specific available gates, becomes ever more critical. The decomposition of a particular algorithm into a sequence…
Suzuki-Trotter decompositions of exponential operators like $\exp(Ht)$ are required in almost every branch of numerical physics. Often the exponent under consideration has to be split into more than two operators, for instance as local…
The Potts model is a generalization of the Ising model with $Q>2$ components. In the fully connected ferromagnetic Potts model, a first-order phase transition is induced by varying thermal fluctuations. Therefore, the computational time…
The dynamics of a quantum system can be simulated using a quantum computer by breaking down the unitary into a quantum circuit of one and two qubit gates. The most established methods are the Trotter-Suzuki decompositions, for which…
Qudits hold great promise for efficient quantum computation and the simulation of high-dimensional quantum systems. Utilizing a local Hilbert space of dimension d > 2 is known to speed up certain quantum algorithms relative to their qubit…
Hybrid qubit-qumode quantum computing platforms provide a natural setting for simulating interacting bosonic quantum field theories. However, existing continuous-variable gate constructions rely predominantly on polynomial functions of…
We experimentally demonstrate a virtual two-qubit gate and characterize it using quantum process tomography~(QPT). The virtual two-qubit gate decomposes an actual two-qubit gate into single-qubit unitary gates and projection gates in…
Hamiltonian formulations of lattice field theories provide access to real-time dynamics, but their simulation is difficult to implement efficiently. Trotter-Suzuki decompositions are at the center of time evolution computation, either on…
A key requirement to perform simulations of large quantum systems on near-term quantum hardware is the design of quantum algorithms with short circuit depth that finish within the available coherence time. A way to stay within the limits of…
We provide a new approach for compiling quantum simulation circuits that appear in Trotter, qDRIFT and multi-product formulas to Clifford and non-Clifford operations that can reduce the number of non-Clifford operations by a factor of up to…
We present several improvements to the standard Trotter-Suzuki based algorithms used in the simulation of quantum chemistry on a quantum computer. First, we modify how Jordan-Wigner transformations are implemented to reduce their cost from…
Dissipation is ubiquitous in nature and plays a crucial role in quantum systems such as causing decoherence of quantum states. Recently, much attention has been paid to an intriguing possibility of dissipation as an efficient tool for…
Penning traps have been used for performing quantum simulations and sensing with hundreds of ions and provide a promising route toward scaling up trapped ion quantum platforms because of the ability to trap and control up to thousands of…
The decomposition of complex quantum operations into experimentally feasible gate sets has been a central challenge since the early development of quantum computing. The multi-controlled Toffoli (MCT) gate is a key example, with…
Gate-set tomography (GST) characterizes the process matrix of quantum logic gates, along with measurement and state preparation errors in quantum processors. GST typically requires extensive data collection and significant computational…
The utility of near-term quantum computers and simulators is likely to rely upon software-hardware co-design, with error-aware algorithms and protocols optimized for the platforms they are run on. Here, we show how knowledge of noise in a…