High-rate CSS codes compile nonlocal Clifford and non-Clifford logical circuits into onsite phases and classical permutations, so MPS bond dimension stays fixed by the encoder while logical entanglement, magic, and non-Gaussianity grow.
Extending Matchgate Simulation Methods to Universal Quantum Circuits
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
abstract
Matchgates are a family of parity-preserving two-qubit gates, nearest-neighbour circuits of which are known to be classically simulable in polynomial time. In this work, we present a simulation method to classically simulate an $\boldsymbol{n}$-qubit circuit containing $\boldsymbol{N}$ gates, $\boldsymbol{m}$ of which are universality-enabling gates and $\boldsymbol{N-m}$ of which are matchgates, in the setting of single-qubit Pauli measurements and product state inputs. The universality-enabling gates we consider include the SWAP, CZ, and CPhase gates. For fixed $\boldsymbol{m}$ as $\boldsymbol{n} \rightarrow \boldsymbol{\infty}$, the resource cost, $\boldsymbol{T}$, scales as $\boldsymbol{\mathcal{O}\left(\left(\frac{en}{m+1}\right)^{2m+2}\right)}$. For $\boldsymbol{m}$ scaling as a linear function of $\boldsymbol{n}$, however, $\boldsymbol{T}$ scale as $\boldsymbol{\mathcal{O}\left(2^{2nH\left(\frac{m+1}{n}\right)}\right)}$, where $\boldsymbol{H}(\lambda)$ is the binary entropy function.
fields
quant-ph 3years
2026 3representative citing papers
An algorithm is presented for estimating distribution complexity of electronic structure Hamiltonians, with O(N^3) entanglement estimation per fragment and quadratic/exponential reductions in distribution cost for quantum and classical interconnects.
citing papers explorer
-
Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks
High-rate CSS codes compile nonlocal Clifford and non-Clifford logical circuits into onsite phases and classical permutations, so MPS bond dimension stays fixed by the encoder while logical entanglement, magic, and non-Gaussianity grow.
-
Distribution Complexity of Electronic Structure Simulations on Quantum Supercomputers
An algorithm is presented for estimating distribution complexity of electronic structure Hamiltonians, with O(N^3) entanglement estimation per fragment and quadratic/exponential reductions in distribution cost for quantum and classical interconnects.
- Computable fermionic non-Gaussianity from the covariance matrix