Related papers: Efficient classical simulation of the approximate …
Classical simulations of noisy quantum circuits are instrumental to our understanding of the behavior of real-world quantum systems and the identification of regimes where one expects quantum advantage. In this work, we present a highly…
We present quantum algorithms for the simulation of quantum systems in one spatial dimension, which result in quantum speedups that range from superpolynomial to polynomial. We first describe a method to simulate the evolution of the…
With the current rate of progress in quantum computing technologies, systems with more than 50 qubits will soon become reality. Computing ideal quantum state amplitudes for circuits of such and larger sizes is a fundamental step to assess…
We present a comprehensive study of quantum simulation methods and quantum simulators for classical computers. We first study an exhaustive set of 150+ simulators and quantum libraries. Then, we short-list the simulators that are actively…
We construct reversible Boolean circuits efficiently simulating reversible Turing machines. Both the circuits and the simulation proof are rather simple. Then we give a fairly straightforward generalization of the circuits and the…
The treewidth of a graph is a useful combinatorial measure of how close the graph is to a tree. We prove that a quantum circuit with $T$ gates whose underlying graph has treewidth $d$ can be simulated deterministically in…
We demonstrate that a tensor product structure could be obtained by introducing pseudorandom phase sequences into classical fields with two orthogonal modes. Using classical fields modulated with pseudorandom phase sequences, we discuss…
Classical simulators play a major role in the development and benchmark of quantum algorithms and practically any software framework for quantum computation provides the option of running the algorithms on simulators. However, the…
While quantum computing can accomplish tasks that are classically intractable, the presence of noise may destroy this advantage in the absence of fault tolerance. In this work, we present a classical algorithm that runs in…
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…
Classical simulations of quantum circuits are limited in both space and time when the qubit count is above 50, the realm where quantum supremacy reigns. However, recently, for the low depth circuit with more than 50 qubits, there are…
An $n$-qubit quantum circuit is said to be peaked if it has an output probability that is at least inverse-polynomially large as a function of $n$. We describe a classical algorithm with quasipolynomial runtime $n^{O(\log{n})}$ that…
We present an efficient family of quantum circuits for a fundamental primitive in quantum information theory, the Schur transform. The Schur transform on n d-dimensional quantum systems is a transform between a standard computational basis…
Recent developments in classical simulation of quantum circuits make use of clever decompositions of chunks of magic states into sums of efficiently simulable stabiliser states. We show here how, by considering certain non-stabiliser…
Dynamic quantum simulation is a leading application for achieving quantum advantage. However, high circuit depths remain a limiting factor on near-term quantum hardware. We present a compilation algorithm based on Matrix Product Operators…
With the rapid progress in quantum hardware and software, the need for verification of quantum systems becomes increasingly crucial. While model checking is a dominant and very successful technique for verifying classical systems, its…
Simulating noisy quantum circuits is vital in designing and verifying quantum algorithms in the current NISQ (Noisy Intermediate-Scale Quantum) era, where quantum noise is unavoidable. However, it is much more inefficient than the classical…
We provide here the technical details of the recently proposed tensor-network protocol for classical simulation of the Gisin-Massar quantum cloner by the authors [Phys. Rev. A, 85, 052323 (2012)]. The protocol essentially instructs how to…
Simulating strongly correlated fermionic systems is notoriously hard on classical computers. An alternative approach, as proposed by Feynman, is to use a quantum computer. Here, we discuss quantum simulation of strongly correlated fermionic…
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…