On the simulation of quantum circuits

TL;DR

This paper provides simplified proofs for the classical simulation of certain quantum circuits, showing that circuits with limited qubit interactions can be efficiently simulated classically.

Contribution

It extends known results by establishing that poly-sized circuits with bounded interaction depth are efficiently simulable using tensor network methods.

Findings

Efficient classical simulation for circuits with D=O(log n) interactions.

Generalization of simulation techniques to broader classes of circuits.

Simplified proofs for existing simulation bounds.

Abstract

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.