On the simulation of quantum circuits
| dc.creator | Jozsa, Richard | |
| dc.date | 2006-03-19 | |
| dc.date.accessioned | 2026-07-07T07:08:03Z | |
| dc.date.available | 2026-07-07T07:08:03Z | |
| dc.description | 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. | |
| dc.description | 12 pages, latex | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0603163 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0603163 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/110615 | |
| dc.subject | Quantum Physics | |
| dc.title | On the simulation of quantum circuits | |
| dc.type | text |