The fermionic linear optical extent is multiplicative for 4 qubit parity eigenstates

P. Jordan and E. Wigner, Über das paulische äquivalenzverbot, Zeitschrift für Physik 47

1928

Earlier work this paper cites.

L. G. Valiant, Quantum computers that can be simulated classically in polynomial time, in Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing , STOC ’01 (Association for Computing Machinery, New York, NY, USA, 2001) p. 114–123

2001

Earlier work this paper cites.

B. M. Terhal and D. P. DiVincenzo, Classical simulation of noninteracting-fermion quantum circuits, Phys. Rev. A 65

2002

Earlier work this paper cites.

R. Jozsa and N. Linden, On the role of entanglement in quantum-computational speed-up, Proc. R. Soc. Lond. A 459

2003

Earlier work this paper cites.

A. Botero and B. Reznik, Bcs-like modewise entanglement of fermion gaussian states, Phys. Lett. A 331

2004

Earlier work this paper cites.

S. Bravyi, Universal quantum computation with the ν = 5 / 2 \nu=5/2 fractional quantum Hall state, Phys. Rev. A 73

2006

Earlier work this paper cites.

R. Jozsa, B. Kraus, A. Miyake, and J. Watrous, Matchgate and space-bounded quantum computations are equivalent, Proc. R. Soc. Lond. A 466

2010

Earlier work this paper cites.

M. Oszmaniec, J. Gutt, and M. Kuś, Classical simulation of fermionic linear optics augmented with noisy ancillas, Phys. Rev. A 90

2014

Earlier work this paper cites.

D. J. Brod, Efficient classical simulation of matchgate circuits with generalized inputs and measurements, Phys. Rev. A 93

2016

Earlier work this paper cites.

S. Bravyi and D. Gosset, Improved classical simulation of quantum circuits dominated by Clifford gates, Phys. Rev. Lett. 116

2016

Earlier work this paper cites.

M. Oszmaniec and Z. Zimborás, Universal extensions of restricted classes of quantum operations, Phys. Rev. Lett. 119

2017

Earlier work this paper cites.

B. Regula, Convex geometry of quantum resource quantification, J. Phys. A 51

2017

Cited alongside, same era.

I. D. Kivlichan, J. McClean, N. Wiebe, C. Gidney, A. Aspuru-Guzik, G. K.-L. Chan, and R. Babbush, Quantum simulation of electronic structure with linear depth and connectivity, Phys. Rev. Lett. 120

2018

Cited alongside, same era.

Z. Jiang, K. J. Sung, K. Kechedzhi, V. N. Smelyanskiy, and S. Boixo, Quantum algorithms to simulate many-body physics of correlated fermions, Phys. Rev. Appl. 9

2018

Cited alongside, same era.

S. Bravyi, D. Browne, P. Calpin, E. Campbell, D. Gosset, and M. Howard, Simulation of quantum circuits by low-rank stabilizer decompositions, Quantum 3

2019

Cited alongside, same era.

P.-L. Dallaire-Demers, J. Romero, L. Veis, S. Sim, and A. Aspuru-Guzik, Low-depth circuit ansatz for preparing correlated fermionic states on a quantum computer, Quantum Sci. Technol. 4

W. J. Huggins, B. A. O’Gorman, N. C. Rubin, D. R. Reichman, R. Babbush, and J. Lee, Unbiasing fermionic quantum Monte Carlo with a quantum computer, Nature 603

2022

Later among the works it cites.

K. Wan, W. J. Huggins, J. Lee, and R. Babbush, Matchgate shadows for fermionic quantum simulation, Communications in Mathematical Physics 404

2023

Later among the works it cites.

E. K. Dax and B. Wu, Error-mitigated fermionic classical shadows on noisy quantum devices., npj Quantum Inf 10

2024

Closest in time.

D. McNulty, S. Calegari, and M. Oszmaniec, Optimal fermionic joint measurements for estimating non-commuting majorana observables (2024), 2402.19349 [quant-ph]

Original

2024

Closest in time.

J. Majsak, D. McNulty, and M. Oszmaniec, A simple and efficient joint measurement strategy for estimating fermionic observables and hamiltonians (2024), 2402.19230 [quant-ph]