We consider recent works on the simulation of quantum circuits using the formalism of matrix product states and the formalism of contracting tensor networks. We provide simplified direct proofs of many of these results, extending an explicit class of efficiently simulable circuits (log depth circuits with 2-qubit gates of limited range) to the following: let C be any poly sized quantum circuit (generally of poly depth too) on n qubits comprising 1- and 2- qubit gates and 1-qubit measurements (with 2-qubit gates acting on arbitrary pairs of qubit lines). For each qubit line j let D_j be the number of 2-qubit gates that touch or cross the line j i.e. the number of 2-qubit gates that are applied to qubits i,k with i \leq j \leq k. Let D=max_j D_j. Then the quantum process can be classically simulated in time n poly(2^D). Thus if D=O(log n) then C may be efficiently classically simulated.
The study of quantum circuit simulation using classical computers is a key research topic that helps define the boundary of verifiable quantum advantage, solve quantum many-body problems, and inform development of quantum hardware and software. Tensor networks have become forefront mathematical tools for these tasks. Here we introduce a method to approximately simulate quantum circuits using sparsely-populated tensors. We describe a sparse tensor data structure that can represent quantum states with no underlying symmetry, and outline algorithms to efficiently contract and truncate these tensors. We show that the data structure and contraction algorithm are efficient, leading to expected runtime scalings versus qubit number and circuit depth. Our results motivate future research in optimization of sparse tensor networks for quantum simulation.
In this note we describe a simple and intriguing observation: the quantum Fourier transform (QFT) over
Zq, which is considered the most ``quantum'' part of Shor's algorithm, can in fact be simulated efficiently by classical computers. More precisely, we observe that the QFT can be performed by a circuit of poly-logarithmic path-width, if the circuit is allowed to apply not only unitary gates but also general linear gates. Recalling the results of Markov and Shi [MaSh] and Jozsa [Jo] which provided classical simulations of such circuits in time exponential in the tree-width, this implies the result stated in the title. Classical simulations of the FFT are of course meaningless when applied to classical input strings on which their result is already known; Our observation might be interesting only in the context in which the QFT is used as a subroutine and applied to more interesting superpositions. We discuss the reasons why this idea seems to fail to provide an efficient classical simulation of the entire factoring algorithm. In the course of proving our observation, we provide two alternative proofs of the results of [MaSh,Jo] which we use. One proof is very similar in spirit to that of [MaSh] but is more visual, and is based on a graph parameter which we call the ``bubble width'', tightly related to the path- and tree-width. The other proof is based on connections to the Jones polynomial; It is very short, if one is willing to rely on several known results.
We provide numerical evidence that the quantum Fourier transform can be efficiently represented in a matrix product operator with a size growing relatively slowly with the number of qubits. Additionally, we numerically show that the tensors in the operator converge to a common tensor as the number of qubits in the transform increases. Together these results imply that the application of the quantum Fourier transform to a matrix product state with n qubits of maximum Schmidt rank χ can be simulated in O(n (log(n))2 χ 2 ) time. We perform such simulations and quantify the error involved in representing the transform as a matrix product operator and simulating the quantum Fourier transform of periodic states.
We study the classical simulability of a polynomial-size quantum circuit
Cn on
n qubits followed by sparse classical post-processing (SCP) on
m bits, where
m≤n≤poly(m). The SCP is described by a non-zero Boolean function
fm that is classically computable in polynomial time and is sparse, i.e., has a peaked Fourier spectrum. First, we provide a necessary and sufficient condition on
Cn such that, for any SCP
fm,
Cn followed by
fm is classically simulable. This characterization extends the result of Van den Nest and implies that various quantum circuits followed by SCP are classically simulable. Examples include IQP circuits, Clifford Magic circuits, and the quantum part of Simon's algorithm, even though these circuits alone are hard to simulate classically. Then, we consider the case where
Cn has constant depth
d. While it is unlikely that, for any SCP
fm,
Cn followed by
fm is classically simulable, we show that it is simulable by a polynomial-time probabilistic algorithm with access to commuting quantum circuits on
n+1 qubits. Each such circuit consists of at most deg(
fm) commuting gates and each commuting gate acts on at most
2d+1 qubits, where deg(
fm) is the Fourier degree of
fm. This provides a better understanding of the hardness of simulating constant-depth quantum circuits followed by SCP.
We derive a rigorous upper bound on the classical computation time of finite-ranged tensor network contractions in d≥2 dimensions. Consequently, we show that quantum circuits of single-qubit and finite-ranged two-qubit gates can be classically simulated in subexponential time in the number of gates. Moreover, we present and implement an algorithm guaranteed to meet our bound and which finds contraction orders with vastly lower computational times in practice. In practically relevant cases this beats standard simulation schemes and, for certain quantum circuits, also a state-of-the-art method. Specifically, our algorithm leads to speedups of several orders of magnitude over naive contraction schemes for two-dimensional quantum circuits on as little as an 8×8 lattice. We obtain similarly efficient contraction schemes for Google's Sycamore-type quantum circuits, instantaneous quantum polynomial-time circuits, and nonhomogeneous (2+1)-dimensional random quantum circuits.