Fetching the paper…
Reading the bibliography…
We propose efficient algorithms for classically simulating fermionic linear optics operations applied to non-Gaussian initial states.
Quantum theory of many-particle systems. i. physical interpretations by means of density matrices, natural spin-orbitals, and convergence problems in the method of configurational interaction
Per-Olov Löwdin · 1955
Earlier work this paper cites.
Computation of plain unitary rotations transforming a general matrix to triangular form
Wallace Givens · 1958
Earlier work this paper cites.
A system of quadrics describing the orbit of the highest weight vector
Woody Lichtenstein · 1982
Earlier work this paper cites.
Matrix Computations (3rd Ed.)
Gene H. Golub and Charles F. Van Loan · 1996
Earlier work this paper cites.
Stabilizer Codes and Quantum Error Correction
Daniel Gottesman · 1997
Earlier work this paper cites.
Quantum computers that can be simulated classically in polynomial time
Leslie G. Valiant · 2001
Earlier work this paper cites.
Fermionic linear optics and matchgates
Emanuel Knill · 2001
Earlier work this paper cites.
Atomic decomposition by basis pursuit
Scott Shaobing Chen, David L. Donoho, and Michael A. Saunders · 2001
Earlier work this paper cites.
Topological quantum memory
Eric Dennis, Alexei Kitaev, Andrew Landahl, and John Preskill · 2002
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.
Efficient classical simulation of optical quantum information circuits
Stephen D. Bartlett and Barry C. Sanders · 2002
Earlier work this paper cites.
Efficient classical simulation of continuous variable quantum information processes
Stephen D. Bartlett, Barry C. Sanders, Samuel L. Braunstein, and Kae Nemoto · 2002
Earlier work this paper cites.
Second-order cone programming
Farid Alizadeh and Donald Goldfarb · 2003
Earlier work this paper cites.
Joint extension of states of subsystems for a CAR system
Huzihiro Araki and Hajime Moriya · 2003
Earlier work this paper cites.
Improved simulation of stabilizer circuits
Scott Aaronson and Daniel Gottesman · 2004
Earlier work this paper cites.
Greed is good: algorithmic results for sparse approximation
Joel A. Tropp · 2004
Earlier work this paper cites.
On sparse representations in arbitrary redundant bases
Jean-Jacques Fuchs · 2004
Earlier work this paper cites.
Convex optimization
Stephen P. Boyd and Lieven Vandenberghe · 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.
Universal quantum computation with ideal Clifford gates and noisy ancillas
Sergey Bravyi and Alexei Kitaev · 2005
Earlier work this paper cites.
Recovery of short, complex linear combinations via /spl lscr//sub 1/ minimization
Joel A. Tropp · 2005
Earlier work this paper cites.
Lagrangian representation for fermionic linear optics
Sergey Bravyi · 2005
Cited alongside, same era.
A large-deviation inequality for vector-valued martingales, 2005
Thomas P Hayes · 2005
Cited alongside, same era.
Universal quantum computation with the ν = 5 / 2 \nu=5/2 fractional quantum Hall state
Sergey Bravyi · 2006
Cited alongside, same era.
Efficient solvability of Hamiltonians and limits on the power of some quantum computational models
Rolando Somma, Howard Barnum, Gerardo Ortiz, and Emanuel Knill · 2006
Cited alongside, same era.
Matchgates and classical simulation of quantum circuits
Richard Jozsa and Akimasa Miyake · 2008
Cited alongside, same era.
“Classical” quantum states
Marek Kuś and Ingemar Bengtsson · 2009
Cited alongside, same era.
Application of a resource theory for magic states to fault-tolerant quantum computing
Mark Howard and Earl Campbell · 2017
Later among the works it cites.
Contextuality and wigner-function negativity in qubit quantum computation
Robert Raussendorf, Dan E. Browne, Nicolas Delfosse, Cihan Okay, and Juan Bermejo-Vega · 2017
Later among the works it cites.
Contextuality as a resource for models of quantum computation with qubits
Juan Bermejo-Vega, Nicolas Delfosse, Dan E. Browne, Cihan Okay, and Robert Raussendorf · 2017
Later among the works it cites.
Complexity of quantum impurity problems
Sergey Bravyi and David Gosset · 2017
Later among the works it cites.
Correcting coherent errors with surface codes
Sergey Bravyi, Matthias Englbrecht, Robert König, and Nolan Peard · 2018
Later among the works it cites.
Contextuality as a resource for measurement-based quantum computation beyond qubits
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Optimal error correction in topological subsystem codes
Ruben S. Andrist, H. Bombin, Helmut G. Katzgraber, and M. A. Martin-Delgado · 2012
Cited alongside, same era.
Disorder-assisted error correction in Majorana chains
Sergey Bravyi and Robert König · 2012
Cited alongside, same era.
The Convex Geometry of Linear Inverse Problems
Venkat Chandrasekaran, Benjamin Recht, Pablo A. Parrilo, and Alan S. Willsky · 2012
Cited alongside, same era.
Negative quasi-probability as a resource for quantum computation
Victor Veitch, Christopher Ferrie, David Gross, and Joseph Emerson · 2012
Cited alongside, same era.
Positive wigner functions render classical simulation of quantum computation efficient
Andrea Mari and Jens Eisert · 2012
Cited alongside, same era.
On detection of quasiclassical states
Michał Oszmaniec and Marek Kuś · 2012
Cited alongside, same era.
Markus Frembs, Sam Roberts, and Stephen D. Bartlett · 2018
Later among the works it cites.
Tailoring surface codes for highly biased noise
David K. Tuckett, Andrew S. Darmawan, Christopher T. Chubb, Sergey Bravyi, Stephen D. Bartlett, and Steven T. Flammia · 2019
Later among the works it cites.
All pure fermionic non-Gaussian states are magic states for matchgate computations
Martin Hebenstreit, Richard Jozsa, Barbara Kraus, Sergii Strelchuk, and Mithuna Yoganathan · 2019
Later among the works it cites.
Robustness of magic and symmetries of the stabiliser polytope
Markus Heinrich and David Gross · 2019
Later among the works it cites.
Simulation of quantum circuits by low-rank stabilizer decompositions
Sergey Bravyi, Dan Browne, Padraic Calpin, Earl Campbell, David Gosset, and Mark Howard · 2019
Later among the works it cites.
Phase-space-simulation method for quantum computation with magic states on qubits
Robert Raussendorf, Juani Bermejo-Vega, Emily Tyhurst, Cihan Okay, and Michael Zurel · 2020
Later among the works it cites.
Stabilizer extent is not multiplicative
Arne Heimendahl, Felipe Montealegre-Mora, Frank Vallentin, and David Gross · 2021
Later among the works it cites.
Quantifying quantum speedups: Improved classical simulation from tighter magic monotones
James R. Seddon, Bartosz Regula, Hakop Pashayan, Yingkai Ouyang, and Earl T. Campbell · 2021
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.
Stabilizer testing and magic entropy
Kaifeng Bu, Weichen Gu, and Arthur Jaffe · 2023
Closest in time.
Circuit knitting with classical communication
Christophe Piveteau and David Sutter · 2023
Closest in time.
Extending matchgate simulation methods to universal quantum circuits
Avinash Mocherla, Lingling Lao, and Dan E. Browne · 2023
Closest in time.
Improved classical simulation of quantum circuits dominated by fermionic linear optical gates
Oliver Reardon-Smith, Michał Oszmaniec, and Kamil Korzekwa · 2023
Closest in time.
Gaussian decomposition of magic states for matchgate computations
Joshua Cudby and Sergii Strelchuk · 2023
Closest in time.
Lower bounds on the non-Clifford resources for quantum computations
Michael Beverland, Earl Campbell, Mark Howard, and Vadym Kliuchnikov · 2058
Closest in time.