REVIEW 18 cited by
Fermionic Linear Optics and Matchgates
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
read the original abstract
Fermionic linear optics is efficiently classically simulatable. Here it is shown that the set of states achievable with fermionic linear optics and particle measurements is the closure of a low dimensional Lie group. The weakness of fermionic linear optics and measurements can therefore be explained and contrasted with the strength of bosonic linear optics with particle measurements. An analysis of fermionic linear optics is used to show that the two-qubit matchgates and the simulatable matchcircuits introduced by Valiant generate a monoid of extended fermionic linear optics operators. A useful interpretation of efficient classical simulations such as this one is as a simulation of a model of non-deterministic quantum computation. Problem areas for future investigations are suggested.
Forward citations
Cited by 18 Pith papers
-
Enabling Lie-Algebraic Classical Simulation beyond Free Fermions
Symmetry-adapted Pauli-orbit and modified Gell-Mann bases make polynomial-dimensional dynamical Lie algebras practically simulable beyond free fermions.
-
Unitary Designs from Doped Matchgate Circuits
Doped matchgate circuits achieve approximate parity-preserving 2-designs in polylogarithmic depth using a sparse number of non-Gaussian gates, with the design formation mapped exactly to a birth-death Markov chain.
-
Fermionic non-Gaussianity via Bell sampling: monotones and efficient quantum algorithms
Defines bridge degree monotone for fermionic non-Gaussianity from Bell-sampling eigenvalues of Lambda, shows non-increase under Gaussian protocols for stronger no-go theorems, and gives polynomial-sample tests for Gau...
-
Practical Tests and Witnesses of Fermionic non-Gaussianity
Introduces practical witnesses of fermionic non-Gaussianity via antiflatness from covariance matrices, with two efficient measurement protocols, a purity-corrected version for mixed states, and experimental results on...
-
Fermionic mean-field dynamics for spin systems beyond free fermions
fTDHF is a mean-field dynamics method for spin systems that is formally exact for free fermions and reproduces qualitative features of exact evolution in benchmarks for adiabatic preparation, many-body localization, a...
-
Holographic Representation of One-Dimensional Many-Body Quantum States via Isometric Tensor Networks
Holographic isoTNS represent volume-law entangled states including arbitrary fermionic Gaussian states, Clifford states, and certain short-time evolved states using an extra network dimension with isometric constraints.
-
Disentangling strategies and entanglement transitions in unitary circuit games with matchgates
Introduces a minimal matchgate circuit representation for fermionic Gaussian states together with a Yang-Baxter update algorithm, then maps out entanglement transitions in unitary circuit games under braiding and gene...
-
Optimal Haar random fermionic linear optics circuits
The paper constructs optimal-depth, optimal-gate-count quantum circuits that sample Haar-random active and passive fermionic linear optics unitaries directly from angle distributions, plus an optimal Clifford FLO sampler.
-
Explicit Pfaffian Formula for Amplitudes of Fermionic Gaussian Pure States in Arbitrary Pauli Bases
Fermionic Gaussian pure state amplitudes in arbitrary local Pauli bases are given by an explicit Pfaffian formula plus a recursion for different qubit counts.
-
Free-Fermion Subsystem Codes
Constructs free-fermion subsystem codes with a 2D topological example, graph-based solvability algorithm, and gap analysis via skew energy and median eigenvalues.
-
Fermionic entropy: an efficiently measurable strong monotone for non-Gaussianity
Fermionic entropy is proven to be a strong, efficiently measurable monotone for fermionic non-Gaussianity, yielding a Theta(n) doping lower bound for matchgate-based approximate state designs.
-
Scalable Quantum Machine Learning: Trainability, Expressivity and Efficiency
A k-particle fermionic circuit with Rz-lifted RBS gates is claimed to be trainable (gradient variance Θ(k²/n⁵)), classically hard (2^{Ω(k)} under best-known algorithms), and trainable via a parallel parameter-shift ru...
-
Efficiently Simulable Pauli Correlation Encoding
Free-fermion and IQP instantiations of Pauli Correlation Encoding run entirely classically and still give high-quality solutions on MaxCut, MIS, knapsack, and Max3SAT benchmarks.
-
Scalable On-Hardware Training of Quantum Neural Networks and Application to Clinical Data Imputation
Framework using Butterfly circuits, layer-wise training and parallel parameter-shift reduces QNN training cost to O(log n) circuit evaluations, validated on MIMIC-III clinical data with hardware execution at 16 qubits...
-
Mitigating the barren plateau problem in linear optics
A dual-valued phase shifter in linear optics creates variational cost landscapes with fewer local minima and outperforms prior linear-optical variational algorithms by mitigating barren plateaus.
-
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.
-
Long-lasting Topological Entanglement in a Monitored Rashba Nanowire
In a monitored Rashba chain the disconnected entanglement entropy stays topological for a time linear in system size because monitoring switches between degenerate topological states while poisoning other quasiparticles.
-
Matrix Elements of Fermionic Gaussian Operators in Arbitrary Pauli Bases: A Pfaffian Formula
Every matrix element of a fermionic Gaussian operator between arbitrary Pauli product states is expressed as a single Pfaffian of a 2L by 2L kernel with explicitly tabulated sign matrices.
Discussion (0). Continue with ORCID to comment.