Related papers: Simulation of IBM's kicked Ising experiment with P…
Quantum computers have the potential to efficiently simulate the dynamics of many interacting quantum particles, a classically intractable task of central importance to fields ranging from chemistry to high-energy physics. However,…
We propose an efficient algorithm for simulating quantum many-body systems in two spatial dimensions using projected entangled pair states. This is done by approximating the environment, arising in the context of updating tensors in the…
Recent developments in analog quantum simulators based on cold atoms and trapped ions call for cross-validating the accuracy of quantum-simulation experiments with use of quantitative numerical methods; however, it is particularly…
We present two classical algorithms for the simulation of universal quantum circuits on $n$ qubits constructed from $c$ instances of Clifford gates and $t$ arbitrary-angle $Z$-rotation gates such as $T$ gates. Our algorithms complement each…
A typical quantum state obeying the area law for entanglement on an infinite 2D lattice can be represented by a tensor network ansatz -- known as an infinite projected entangled pair state (iPEPS) -- with a finite bond dimension $D$. Its…
Quantum chemistry and materials science are among the most promising areas for demonstrating algorithmic quantum advantage and quantum utility due to their inherent quantum mechanical nature. Still, large-scale simulations of quantum…
We develop and benchmark a technique for simulating excitation spectra of generic two-dimensional quantum lattice systems using the framework of projected entangled-pair states (PEPS). The technique relies on a variational ansatz for…
Projected Entangled Pair States (PEPS) are a class of quantum many-body states that generalize Matrix Product States for one-dimensional systems to higher dimensions. In recent years, PEPS have advanced understanding of strongly correlated…
An infinite projected entangled pair state (iPEPS) is a tensor network ansatz to represent a quantum state on an infinite 2D lattice whose accuracy is controlled by the bond dimension $D$. Its real, Lindbladian or imaginary time evolution…
Imaginary-time evolution, an important technique in tensor network and quantum Monte Carlo algorithms on classical computers, has recently been adapted to quantum computing. In this study, we focus on probabilistic imaginary-time evolution…
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…
We develop and analyze a method for simulating quantum circuits on classical computers by representing quantum states as rooted tree tensor networks. Our algorithm first determines a suitable, fixed tree structure adapted to the expected…
Quantum circuits are considered more powerful than classical circuits and require exponential resources to simulate classically. Clifford circuits are a special class of quantum circuits that can be simulated in polynomial time but still…
We present a low-cost protocol for benchmarking applications on generic quantum hardware in the circuit model. Using families of Clifford circuits which mimic the application circuit structure, we are able to predict how measured…
The recent advancements in out-of-time-ordered correlator (OTOC) measurements have provided a promising pathway to explore quantum chaos and information scrambling. However, despite recent advancements, their experimental realization…
Operations on a pair of entangled qubits are conventionally presented as the application of the tensor product of operations. The tensor product is linearly extended to act synchronously across the entire entangled system. When simulating…
With the advent of quantum processors exceeding $100$ qubits and the high engineering complexities involved, there is a need for holistically benchmarking the processor to have quality assurance. Linear cross-entropy benchmarking (XEB) has…
Algorithms to simulate the ring-exchange models using the projected entangled pair states (PEPS) are developed. We generalize the imaginary time evolution (ITE) method to optimize PEPS wave functions for the models with ring-exchange…
Quantum dynamics simulation via Hamilton simulation algorithms is one of the most crucial applications in the quantum computing field. While this task has been relatively considered the target in the fault-tolerance era, the experiment for…
The notion of compressed quantum computation is employed to simulate the Ising interaction of a 1D--chain consisting out of $n$ qubits using the universal IBM cloud quantum computer running on $\log(n)$ qubits. The external field parameter…