Classical simulation of non-Gaussian fermionic circuits

• Published in: arXiv.org
• Main Authors: Dias, Beatriz, Koenig, Robert
• Format: Paper Journal Article
• Language: English
• Published: Ithaca Cornell University Library, arXiv.org 06.05.2024
• Subjects: Algorithms; Circuits; Covariance matrix; Fermions; Mathematical analysis; Physics - Quantum Physics; Polynomials; Simulation; Tensors
• ISSN: 2331-8422
• DOI: 10.48550/arxiv.2307.12912

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.