Classical simulation of non-Gaussian fermionic circuits

Abstract

We propose efficient algorithms for classically simulating fermionic linear optics operations applied to non-Gaussian initial states. By gadget constructions, this provides algorithms for fermionic linear optics with non-Gaussian operations. We argue that this problem is analogous to that of simulating Clifford circuits with non-stabilizer initial states: Algorithms for the latter problem immediately translate to the fermionic setting. Our construction is based on an extension of the covariance matrix formalism which permits to efficiently track relative phases in superpositions of Gaussian states. It yields simulation algorithms with polynomial complexity in the number of fermions, the desired accuracy, and certain quantities capturing the degree of non-Gaussianity of the initial state. We study one such quantity, the fermionic Gaussian extent, and show that it is multiplicative on tensor products when the so-called fermionic Gaussian fidelity is. We establish this property for the tensor product of two arbitrary pure states of four fermions with positive parity.

68 pages and 15 figures; updated to match published version

References in corpus (42)

• Topological quantum memory
• Improved Simulation of Stabilizer Circuits
• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• The Convex Geometry of Linear Inverse Problems
• Positive Wigner functions render classical simulation of quantum computation efficient
• Efficient Classical Simulation of Continuous Variable Quantum Information Processes
• Application of a resource theory for magic states to fault-tolerant quantum computing
• Negative Quasi-Probability as a Resource for Quantum Computation
• Classical simulation of noninteracting-fermion quantum circuits
• Improved classical simulation of quantum circuits dominated by Clifford gates
• Trading classical and quantum computational resources
• Simulation of quantum circuits by low-rank stabilizer decompositions
• Universal Quantum Computation with the nu=5/2 Fractional Quantum Hall State
• Matchgates and classical simulation of quantum circuits
• Estimating outcome probabilities of quantum circuits using quasiprobabilities
• Contextuality as a resource for models of quantum computation on qubits
• Correcting coherent errors with surface codes
• Tailoring surface codes for highly biased noise
• Quantifying quantum speedups: improved classical simulation from tighter magic monotones
• Contextuality and Wigner function negativity in qubit quantum computation
• Robustness of Magic and Symmetries of the Stabiliser Polytope
• Circuit knitting with classical communication
• Tensor-Network Simulations of the Surface Code under Realistic Noise
• Complexity of quantum impurity problems
• Phase space simulation method for quantum computation with magic states on qubits
• Efficient Classical Simulation of Optical Quantum Circuits
• BCS-like Modewise Entanglement of Fermion Gaussian States
• Contextuality as a resource for measurement-based quantum computation beyond qubits
• Disorder-assisted error correction in Majorana chains
• All pure fermionic non-Gaussian states are magic states for matchgate computations
• The Power of Noisy Fermionic Quantum Computation
• Efficient solvability of Hamiltonians and limits on the power of some quantum computational models
• Stabilizer extent is not multiplicative
• Fast estimation of outcome probabilities for quantum circuits
• Spectral properties of reduced fermionic density operators and parity superselection rule
• Classical simulation of fermionic linear optics augmented with noisy ancillas
• Joint Extension of States of Subsystems for a CAR System
• Optimal error correction in topological subsystem codes
• `Classical' quantum states
• On detection of quasiclassical states
• Quantifying fermionic nonlinearity of quantum circuits
• Complete criterion for convex-Gaussian state detection

Cited by in corpus (15)

• Does provable absence of barren plateaus imply classical simulability?
• Lie-algebraic classical simulations for quantum computing
• Handbook for Quantifying Robustness of Magic
• Efficient learning of quantum states prepared with few fermionic non-Gaussian gates
• Classical simulation of non-Gaussian bosonic circuits
• Stability and Loop Models from Decohering Non-Abelian Topological Order
• The non-stabilizerness of fermionic Gaussian states
• Fermionic Magic Resources of Quantum Many-Body Systems
• Classical simulation and quantum resource theory of non-Gaussian optics
• Matchgate circuits deeply thermalize
• Simulation of quantum computation with magic states via Jordan-Wigner transformations
• Characterization of non-adaptive Clifford channels
• Classifying fermionic states via many-body correlation measures
• Complexity of Quantum Trajectories
• Classical simulation of noisy quantum circuits via locally entanglement-optimal unravelings