pith. sign in

arxiv: quant-ph/0603163 · v1 · submitted 2006-03-19 · 🪐 quant-ph

On the simulation of quantum circuits

classification 🪐 quant-ph
keywords qubitgatescircuitsquantumpolyclassicallydepthefficiently
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Cylindrical Matter: A beyond-quantum many-body system for efficient classical simulation of quantum pure-Ising like systems

    quant-ph 2026-04 unverdicted novelty 7.0

    Cylindrical matter is a new beyond-quantum model that faithfully reproduces measurement statistics of some quantum pure-Ising systems with interactions decaying faster than 1/r^{3D/2}, allowing classical simulation.

  2. Classically efficient regimes in measurement based quantum computation performed using diagonal two qubit gates and cluster measurements

    quant-ph 2023-07 unverdicted novelty 6.0

    Explicit computation of the classical simulation threshold λ for arbitrary diagonal two-qubit gates, identifying families of states with simulable phases on finite-degree graphs.

  3. Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms

    quant-ph 2025-09 conditional novelty 5.0

    Systematic numerical study of QAOA parameter transfer on heavy-hex Ising models with local cubic terms shows transferred angles from small instances yield improving expectation values up to 49 layers on instances up t...

  4. Quantum-inspired tensor networks in machine learning models

    cs.LG 2026-04 unverdicted novelty 2.0

    Tensor networks developed for quantum states are reviewed as tools for machine learning models, with assessment of their potential computational, explanatory, and privacy advantages alongside remaining challenges.