Fermionic Linear Optics and Matchgates

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.

13 pages

References in corpus (1)

• A Theory of Fault-Tolerant Quantum Computation

Cited by in corpus (34)

• Classical simulation of noninteracting-fermion quantum circuits
• Qulacs: a fast and versatile quantum circuit simulator for research purpose
• Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code
• Fermionic partial tomography via classical shadows
• Generalised Hong-Ou-Mandel Experiments with Bosons and Fermions
• Symmetry Principles in Quantum Systems Theory
• Efficient classical simulation of matchgate circuits with generalized inputs and measurements
• Qubits as Parafermions
• Fidelity witnesses for fermionic quantum simulations
• Totally Destructive Many-Particle Interference
• Matchgate benchmarking: Scalable benchmarking of a continuous family of many-qubit gates
• Irreversible quantum evolution with quadratic generator: Review
• Fermion Sampling: a robust quantum computational advantage scheme using fermionic linear optics and magic input states
• Fermionic Linear Optics Revisited
• Matchgate and space-bounded quantum computations are equivalent
• Guaranteed recovery of quantum processes from few measurements
• Solving search problems by strongly simulating quantum circuits
• Power of one non-clean qubit
• Error mitigation by training with fermionic linear optics
• The Computational Complexity of Linear Optics
• Quantifying fermionic nonlinearity of quantum circuits
• The computational power of normalizer circuits over black-box groups
• Embedding classical into quantum computation
• The computational power of matchgates and the XY interaction on arbitrary graphs
• Normalizer Circuits and Quantum Computation
• Quantum Circuits and Spin(3n) Groups
• Permanents, Bosons and Linear Optics
• Classical simulation of dissipative fermionic linear optics
• Quantum Information Processing with Single Photons
• Characterizing maximally many-body entangled fermionic states by using $M$-body density matrix
• Monitored quantum transport: full counting statistics of a quantum Hall interferometer
• Mutual information in interacting spin systems
• The Computational Power of Non-interacting Particles
• Clifford Gates in the Holant Framework