Fetching the paper…
Reading the bibliography…
Fermionic Linear Optics (FLO) is a restricted model of quantum computation which in its original form is known to be efficiently classically simulable.
1905
Earlier work this paper cites.
1908
Earlier work this paper cites.
1909
Earlier work this paper cites.
W. Lichtenstein, A system of quadrics describing the orbit of the highest weight vector, Proceedings of the American Mathematical Society 84
1982
Earlier work this paper cites.
C. Lautemann, Bpp and the polynomial hierarchy, Information Processing Letters 17
1983
Earlier work this paper cites.
F. MacWilliams and N. Sloane, The Theory of Error-Correcting Codes (North-Holland Pub. Co., 1983)
1983
Earlier work this paper cites.
L. Stockmeyer, On approximation algorithms for #P, SIAM J. Comput. 14
1985
Earlier work this paper cites.
S. Toda, PP is as hard as the polynomial-time hierarchy, SIAM Journal on Computing 20
1991
Earlier work this paper cites.
R. Paturi, On the degree of polynomials that approximate symmetric boolean functions (preliminary version), in Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing , STOC ’92 (Association for Computing Machinery, New York, NY, USA, 1992) p. 468–474
1992
Earlier work this paper cites.
D. Coppersmith and T. J. Rivlin, The growth of polynomials bounded at equally spaced points, SIAM Journal on Mathematical Analysis 23
1992
Earlier work this paper cites.
R. Mathias, Perturbation bounds for the polar decomposition, SIAM Journal on Matrix Analysis and Applications 14
1993
Earlier work this paper cites.
M. Reck, A. Zeilinger, H. J. Bernstein, and P. Bertani, Experimental realization of any discrete unitary operator, Phys. Rev. Lett. 73
1994
Earlier work this paper cites.
S. Fenner, F. Green, S. Homer, and R. Pruim, Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences 455
1999
Earlier work this paper cites.
B. C. Hall, Lie Groups, Lie Algebras, and Representations: An Elementary Introduction (Springer, 2000)
2000
Earlier work this paper cites.
M. E. Dyer, L. A. Goldberg, C. S. Greenhill, and M. Jerrum, On the relative complexity of approximate counting problems, in Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization , APPROX ’00 (Springer-Verlag, Berlin, Heidelberg, 2000) p. 108–119
2000
Earlier work this paper cites.
E. M. Rains, Polynomial invariants of quantum codes, IEEE Transactions on Information Theory 46
2000
Earlier work this paper cites.
A. J. Coleman and V. I. Yukalov, Reduced density matrices: Coulson’s challenge , Vol. 72 (Springer Science & Business Media, 2000)
2000
Earlier work this paper cites.
E. Knill, Fermionic Linear Optics and Matchgates, arXiv e-prints , quant-ph/0108033 (2001), arXiv:quant-ph/0108033 [quant-ph]
2001
Earlier work this paper cites.
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.
L. Valiant, Quantum Circuits That Can Be Simulated Classically in Polynomial Time, SIAM J. Comput. 31
2002
Earlier work this paper cites.
S. B. Bravyi and A. Y. Kitaev, Fermionic Quantum Computation, Annals of Physics 298
2002
Earlier work this paper cites.
N. Schuch and J. Siewert, Natural two-qubit gate for quantum computation using the xy interaction, Physical Review A 67
2003
Earlier work this paper cites.
J. Fuchs and C. Schweigert, Symmetries, Lie algebras and representations: A graduate course for physicists (Cambridge University Press, 2003)
2003
Earlier work this paper cites.
B. M. Terhal and D. P. DiVincenzo, Adaptive quantum computation, constant depth quantum circuits and Arthur-Merlin games, Quantum Information & Computation 4
2004
Earlier work this paper cites.
C. Beenakker, D. DiVincenzo, C. Emary, and M. Kindermann, Charge detection enables free-electron quantum computation, Physical review letters 93
2004
Earlier work this paper cites.
S. Bravyi, Lagrangian representation for fermionic linear optics, Quantum Info. Comput. 5
2005
Earlier work this paper cites.
S. Bravyi and A. Kitaev, Universal quantum computation with ideal clifford gates and noisy ancillas, Physical Review A 71
2005
Earlier work this paper cites.
S. Bravyi, Classical capacity of fermionic product channels, arXiv e-prints , quant-ph/0507282 (2005), arXiv:quant-ph/0507282 [quant-ph]
2005
Earlier work this paper cites.
H. Elvang, P. Cvitanović, and A. D. Kennedy, Diagrammatic young projection operators for u(n), Journal of Mathematical Physics 46
2005
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.
2007
Earlier work this paper cites.
E. A. Rakhmanov, Bounds for polynomials with a unit discrete norm, Annals of Mathematics 165
2007
Earlier work this paper cites.
2007
Earlier work this paper cites.
R. Jozsa and A. Miyake, Matchgates and classical simulation of quantum circuits, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 464
2008
Earlier work this paper cites.
M. Lobino, D. Korystov, C. Kupchak, E. Figueroa, B. C. Sanders, and A. I. Lvovsky, Complete characterization of quantum-optical processes, Science 322
2008
Earlier work this paper cites.
2009
Earlier work this paper cites.
S. Arora and B. Barak, Computational Complexity: A Modern Approach , 1st ed. (Cambridge University Press, USA, 2009)
2009
Earlier work this paper cites.
A. W. Harrow and R. A. Low, Random quantum circuits are approximate 2-designs, Communications in Mathematical Physics 291
2009
Earlier work this paper cites.
D. Shepherd and M. J. Bremner, Temporally unstructured quantum computation, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 465
2009
Cited alongside, same era.
R. W. Goodman and N. R. Wallach, Symmetry, Representations, and Invariants , Graduate Texts in Mathematics (Springer, Dordrecht, 2009)
2009
Cited alongside, same era.
M. Kuś and I. Bengtsson, “classical” quantum states, Phys. Rev. A 80
2009
Cited alongside, same era.
R. Goodman and N. R. Wallach, Symmetry, Representations, and Invariants (Springer, 2009)
2009
Cited alongside, same era.
M. J. Bremner, R. Jozsa, and D. J. Shepherd, Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy, Proc. R. Soc. A 467
2011
Cited alongside, same era.
D. A. Ivanov, Computational complexity of exterior products and multiparticle amplitudes of noninteracting fermions in entangled states, Phys. Rev. A 96
2017
Later among the works it cites.
2017
Later among the works it cites.
J. Huh and M.-H. Yung, Vibronic boson sampling: generalized gaussian boson sampling for molecular vibronic spectra at finite temperature, Scientific reports 7
2017
Later among the works it cites.
G. Aubrun and S. J. Szarek, Alice and Bob meet Banach: the interface of asymptotic geometric analysis and quantum information theory , Mathematical surveys and monographs (American Mathematical Society, Providence, RI, 2017)
2017
Later among the works it cites.
J. Preskill, Quantum Computing in the NISQ era and beyond, Quantum 2
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2011
Cited alongside, same era.
2011
Cited alongside, same era.
D. J. Brod and E. F. Galvão, Extending matchgates into universal quantum computation, Phys. Rev. A 84
2011
Cited alongside, same era.
S. Rahimi-Keshari, A. Scherer, A. Mann, A. T. Rezakhani, A. I. Lvovsky, and B. C. Sanders, Quantum process tomography with coherent states, New Journal of Physics 13
2011
Cited alongside, same era.
H. Ikai, On the theory of pfaffians based on exponential maps in exterior algebras, Linear algebra and its applications 434
2011
Cited alongside, same era.
D. J. Brod and E. F. Galvão, Geometries for universal quantum computation with matchgates, Phys. Rev. A 86
2012
Cited alongside, same era.
S. Aaronson and A. Arkhipov, The computational complexity of linear optics, Theory of Computing 4
2013
Cited alongside, same era.
2018
Later among the works it cites.
S. Bravyi, D. Gosset, and R. König, Quantum advantage with shallow circuits, Science 362
2018
Later among the works it cites.
2018
Later among the works it cites.
J. Bermejo-Vega, D. Hangleiter, M. Schwarz, R. Raussendorf, and J. Eisert, Architectures for quantum simulation showing a quantum speedup, Phys. Rev. X 8
2018
Later among the works it cites.
2018
Later among the works it cites.
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
Later among the works it cites.
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. Applied 9
2018
Later among the works it cites.
A. Bouland, J. F. Fitzsimons, and D. E. Koh, Complexity Classification of Conjugated Clifford Circuits, in 33rd Computational Complexity Conference (CCC 2018) , Leibniz International Proceedings in Informatics (LIPIcs), Vol. 102, edited by R. A. Servedio (Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2018) pp. 21:1–21:25, iSSN: 1868-8969
2018
Later among the works it cites.
J. M. Arrazola and T. R. Bromley, Using gaussian boson sampling to find dense subgraphs, Physical review letters 121
2018
Later among the works it cites.
J. M. Arrazola, T. R. Bromley, and P. Rebentrost, Quantum approximate optimization with gaussian boson sampling, Physical Review A 98
2018
Later among the works it cites.
A. E. Moylett and P. S. Turner, Quantum simulation of partially distinguishable boson sampling, Physical Review A 97
2018
Later among the works it cites.
A. Bouland, B. Fefferman, C. Nirkhe, and U. Vazirani, On the complexity and verification of quantum random circuit sampling, Nature Physics 15
2019
Later among the works it cites.
F. Arute, K. Arya, R. Babbush, D. Bacon, J. C. Bardin, R. Barends, R. Biswas, S. Boixo, F. G. S. L. Brandao, D. A. Buell, et al. , Quantum supremacy using a programmable superconducting processor, Nature (London) 574
2019
Later among the works it cites.
D. J. Brod, E. F. Galvão, A. Crespi, R. Osellame, N. Spagnolo, and F. Sciarrino, Photonic implementation of boson sampling: a review, Advanced Photonics 1
2019
Later among the works it cites.
H. Wang, J. Qin, X. Ding, M.-C. Chen, S. Chen, X. You, Y.-M. He, X. Jiang, L. You, Z. Wang, et al. , Boson sampling with 20 input photons and a 60-mode interferometer in a 10 14 10^{14} -dimensional hilbert space, Physical review letters 123
2019
Later among the works it cites.
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 Science and Technology 4
2019
Later among the works it cites.
M. Hebenstreit, R. Jozsa, B. Kraus, S. Strelchuk, and M. Yoganathan, All pure fermionic non-gaussian states are magic states for matchgate computations, Phys. Rev. Lett. 123
2019
Later among the works it cites.
D. Hangleiter, M. Kliesch, J. Eisert, and C. Gogolin, Sample complexity of device-independently certified “quantum supremacy”, Physical review letters 122
2019
Later among the works it cites.
G. Aleksandrowicz, T. Alexander, P. Barkoutsos, L. Bello, Y. Ben-Haim, and Bucher, Qiskit: An open-source framework for quantum computing (2019)
2019
Later among the works it cites.
H.-S. Zhong, H. Wang, Y.-H. Deng, M.-C. Chen, L.-C. Peng, Y.-H. Luo, J. Qin, D. Wu, X. Ding, Y. Hu, et al. , Quantum computational advantage using photons, Science 370
2020
Closest in time.
F. Arute, K. Arya, R. Babbush, D. Bacon, J. C. Bardin, R. Barends, S. Boixo, M. Broughton, B. B. Buckley, D. A. Buell, et al. , Hartree-fock on a superconducting qubit quantum computer, Science 369
2020
Closest in time.
B. Foxen, C. Neill, A. Dunsworth, P. Roushan, B. Chiaro, A. Megrant, J. Kelly, Z. Chen, K. Satzinger, R. Barends, et al. , Demonstrating a continuous set of two-qubit gates for near-term quantum algorithms, Phys. Rev. Lett. 125
2020
Closest in time.
H. Pashayan, S. D. Bartlett, and D. Gross, From estimation of quantum probabilities to simulation of quantum circuits, Quantum 4
2020
Closest in time.
D. A. Ivanov and L. Gurvits, Complexity of full counting statistics of free quantum particles in product states, Phys. Rev. A 101
2020
Closest in time.
2020
Closest in time.
L. Banchi, M. Fingerhuth, T. Babej, C. Ing, and J. M. Arrazola, Molecular docking with gaussian boson sampling, Science Advances 6
2020
Closest in time.
M. Schuld, K. Brádler, R. Israel, D. Su, and B. Gupt, Measuring the similarity of graphs with a gaussian boson sampler, Physical Review A 101
2020
Closest in time.
2020
Closest in time.
J. Eisert, D. Hangleiter, N. Walk, I. Roth, D. Markham, R. Parekh, U. Chabaud, and E. Kashefi, Quantum certification and benchmarking, Nature Reviews Physics 2
2020
Closest in time.
2021
Closest in time.
2021
Closest in time.
2021
Closest in time.
2021
Closest in time.