Fetching the paper…
Reading the bibliography…
We present a classical algorithm for simulating universal quantum circuits composed of "free" nearest-neighbour matchgates or equivalently fermionic-linear-optical (FLO) gates, and "resourceful" non-Gaussian gates.
“Über das paulische äquivalenzverbot”
P. Jordan and E. Wigner · 1928
Earlier work this paper cites.
“On the theory of automorphic functions of a matrix variable i-geometrical basis”
Loo-Keng Hua · 1944
Earlier work this paper cites.
“A normal form for a matrix under the unitary congruence group”
D. C. Youla · 1960
Earlier work this paper cites.
“Differential geometry, lie groups, and symmetric spaces”
Sigurdur Helgason · 1978
Earlier work this paper cites.
“Quantum circuit complexity”
A. Chi-Chih Yao · 1993
Earlier work this paper cites.
“Universal quantum simulators”
Seth Lloyd · 1996
Earlier work this paper cites.
“Lie groups beyond an introduction”
Anthony W. Knapp · 1996
Earlier work this paper cites.
“A numerically stable, structure preserving method for computing the eigenvalues of real Hamiltonian or symplectic pencils”
Peter Benner, Volker Mehrmann, and Hongguo Xu · 1996
Earlier work this paper cites.
“The heisenberg representation of quantum computers” (1998)
Daniel Gottesman · 1998
Earlier work this paper cites.
“The theory of matrices”
F. R. Gantmacher · 2000
Earlier work this paper cites.
“Quantum computers that can be simulated classically in polynomial time”
Leslie G. Valiant · 2001
Earlier work this paper cites.
“Clifford algebras and universal sets of quantum gates”
Alexander Yu. Vlasov · 2001
Earlier work this paper cites.
“Classical simulation of noninteracting-fermion quantum circuits”
Barbara M. Terhal and David P. DiVincenzo · 2002
Earlier work this paper cites.
“Fermionic quantum computation”
Sergey Bravyi and Alexei Kitaev · 2002
Earlier work this paper cites.
“Improved simulation of stabilizer circuits”
Scott Aaronson and Daniel Gottesman · 2004
Earlier work this paper cites.
“Bcs-like modewise entanglement of fermion gaussian states”
Alonso Botero and Benni Reznik · 2004
Earlier work this paper cites.
“Lagrangian representation for fermionic linear optics”
Sergey Bravyi · 2005
Earlier work this paper cites.
“Classical capacity of fermionic product channels” (2005)
Sergey Bravyi · 2005
Earlier work this paper cites.
“The schur complement and its applications”
Fuzhen Zhang, editor · 2005
Earlier work this paper cites.
“Universal quantum computation with the ν = 5 / 2 \nu=5/2 fractional quantum Hall state”
Sergey Bravyi · 2006
Earlier work this paper cites.
“A simple promise BQP-complete matrix problem”
Dominik Janzing and Pawel Wocjan · 2007
Earlier work this paper cites.
“Matchgates and classical simulation of quantum circuits”
R. Jozsa and A. Miyake · 2008
Cited alongside, same era.
“Exact and approximate unitary 2-designs and their application to fidelity estimation”
Christoph Dankert, Richard Cleve, Joseph Emerson, and Etera Livine · 2009
Cited alongside, same era.
““classical” quantum states”
Marek Kuś and Ingemar Bengtsson · 2009
Cited alongside, same era.
“On detection of quasiclassical states”
Michał Oszmaniec and Marek Kuś · 2012
Cited alongside, same era.
“Matrix analysis”
Roger A. Horn and Charles R. Johnson · 2012
Cited alongside, same era.
“The power of noisy fermionic quantum computation”
Fernando de Melo, Piotr Ćwikliński, and Barbara M. Terhal · 2013
Cited alongside, same era.
“Predicting many properties of a quantum system from very few measurements”
Hsin-Yuan Huang, Richard Kueng, and John Preskill · 2020
Later among the works it cites.
“From estimation of quantum probabilities to simulation of quantum circuits”
Hakop Pashayan, Stephen D. Bartlett, and David Gross · 2020
Later among the works it cites.
“Quantum simulators: Architectures and opportunities”
Ehud Altman, Kenneth R Brown, Giuseppe Carleo, Lincoln D Carr, Eugene Demler, Cheng Chin, Brian DeMarco, Sophia E Economou, Mark A Eriksson, Kai-Mei C Fu, et al · 2021
Later among the works it cites.
“Fermionic partial tomography via classical shadows”
Andrew Zhao, Nicholas C. Rubin, and Akimasa Miyake · 2021
Later among the works it cites.
“Efficient classical simulation and benchmarking of quantum processes in the Weyl basis”
Daniel Stilck França, Sergii Strelchuk, and Michał Studziński · 2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
“Classical simulation of fermionic linear optics augmented with noisy ancillas”
Michał Oszmaniec, Jan Gutt, and Marek Kuś · 2014
Cited alongside, same era.
“Lie groups, lie algebras, and representations”
Brian C. Hall · 2015
Cited alongside, same era.
“Improved classical simulation of quantum circuits dominated by Clifford gates”
Sergey Bravyi and David Gosset · 2016
Cited alongside, same era.
“Trading classical and quantum computational resources”
Sergey Bravyi, Graeme Smith, and John A. Smolin · 2016
Cited alongside, same era.
“Sub-Gaussian mean estimators”
Luc Devroye, Matthieu Lerasle, Gabor Lugosi, and Roberto I. Oliveira · 2016
Cited alongside, same era.
“Complexity of quantum impurity problems”
Sergey Bravyi and David Gosset · 2017
Cited alongside, same era.
James R. Seddon, Bartosz Regula, Hakop Pashayan, Yingkai Ouyang, and Earl T. Campbell · 2021
Later among the works it cites.
“Hybrid Schrödinger-Feynman simulation of quantum circuits with decision diagrams”
Lukas Burgholzer, Hartwig Bauer, and Robert Wille · 2021
Later among the works it cites.
“Constructing a virtual two-qubit gate by sampling single-qubit operations”
Kosuke Mitarai and Keisuke Fujii · 2021
Later among the works it cites.
“Hadamard-free circuits expose the structure of the Clifford group”
Sergey Bravyi and Dmitri Maslov · 2021
Later among the works it cites.
“Matchgate benchmarking: Scalable benchmarking of a continuous family of many-qubit gates”
Jonas Helsen, Sepehr Nezami, Matthew Reagor, and Michael Walter · 2022
Later among the works it cites.
“Fermion sampling: A robust quantum computational advantage scheme using fermionic linear optics and magic input states”
Michał Oszmaniec, Ninnat Dangniam, Mauro E.S. Morales, and Zoltán Zimborás · 2022
Later among the works it cites.
“Fast estimation of outcome probabilities for quantum circuits”
Hakop Pashayan, Oliver Reardon-Smith, Kamil Korzekwa, and Stephen D. Bartlett · 2022
Later among the works it cites.
“Quantifying fermionic nonlinearity of quantum circuits”
Shigeo Hakkaku, Yuichiro Tashima, Kosuke Mitarai, Wataru Mizukami, and Keisuke Fujii · 2022
Later among the works it cites.
“Observing ground-state properties of the Fermi-Hubbard model using a scalable algorithm on a quantum computer”
Stasja Stanisic, Jan Lukas Bosse, Filippo Maria Gambetta, Raul A. Santos, Wojciech Mruczkiewicz, Thomas E. O’Brien, Eric Ostby, and Ashley Montanaro · 2022
Later among the works it cites.
“Unbiasing fermionic quantum Monte Carlo with a quantum computer”
William J. Huggins, Bryan A. O’Gorman, Nicholas C. Rubin, David R. Reichman, Ryan Babbush, and Joonho Lee · 2022
Later among the works it cites.
“How to simulate quantum measurement without computing marginals”
Sergey Bravyi, David Gosset, and Yinchen Liu · 2022
Later among the works it cites.
“Matchgate shadows for fermionic quantum simulation”
Kianna Wan, William J. Huggins, Joonho Lee, and Ryan Babbush · 2023
Closest in time.
“Extending matchgate simulation methods to universal quantum circuits” (2023)
Avinash Mocherla, Lingling Lao, and Dan E. Browne · 2023
Closest in time.
“Flo-simulator”
Oliver Reardon-Smith · 2024
Closest in time.
“The fermionic linear optical extent is multiplicative for 4 qubit parity eigenstates” (2024)
Oliver Reardon-Smith · 2024
Closest in time.