REVIEW 6 cited by
Extending Matchgate Simulation Methods to Universal Quantum Circuits
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
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.
Forward citations
Cited by 6 Pith papers
-
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 no...
-
Computable fermionic non-Gaussianity from the covariance matrix
Two covariance-matrix-derived entropy families are proven to be fermionic non-Gaussianity monotones, yielding SWAP-gate lower bounds and classical-simulation upper bounds.
-
Classical simulation of parity-preserving quantum circuits
A classical simulation method decomposes non-Matchgate parity-preserving gates into a Gaussian fermionic tensor plus a universal quartic correction, enabling precomputed parameter sweeps and truncated approximations.
-
Efficiently learning fermionic unitaries with few non-Gaussian gates
An efficient learning algorithm reconstructs fermionic circuits built from Gaussian unitaries plus a constant number of parity-preserving non-Gaussian gates, up to small diamond-norm error.
-
ExtraFerm: An Extended Matchgate Simulator
An open-source simulator computes Born-rule probabilities for matchgate-plus-controlled-phase chemistry circuits and uses them to improve sample-based quantum diagonalization.
-
Emergence of Generic Entanglement Structure in Doped Matchgate Circuits
Non-Gaussian doping of matchgate circuits restores generic entanglement growth in unitary evolution and, at extensive per-time injection rates, stabilizes a volume-law phase under measurements.
Discussion (0). Continue with ORCID to comment.