Learning Gaussian Operations and the Matchgate Hierarchy

N. Rengaswamy, R. Calderbank, and H. D. Pfister, “Unifying the Clifford Hierarchy via Symmetric Matrices over Rings,” Physical Review A , vol. 100, no. 2, p. 022304, Aug. 2019, arXiv:1902.04022 [quant-ph]. [Online]. Available: http://arxiv.org/abs/1902.04022

Original

1902

Earlier work this paper cites.

P. Jordan and E. Wigner, “Über das Paulische Äquivalenzverbot,” Zeitschrift für Physik , vol. 47, no. 9, pp. 631–651, Sep. 1928. [Online]. Available: https://doi.org/10.1007/BF01331938

1928

Earlier work this paper cites.

C. H. Bennett and S. J. Wiesner, “Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states,” Physical Review Letters , vol. 69, no. 20, pp. 2881–2884, Nov. 1992, publisher: American Physical Society. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevLett.69.2881

1992

Earlier work this paper cites.

R. Bhatia, Matrix Analysis . Springer Science & Business Media, Nov. 1996, google-Books-ID: F4hRy1F1M6QC

1996

Earlier work this paper cites.

I. L. Chuang and M. A. Nielsen, “Prescription for experimental determination of the dynamics of a quantum black box,” Journal of Modern Optics , vol. 44, no. 11-12, pp. 2455–2467, Nov. 1997, arXiv:quant-ph/9610001. [Online]. Available: http://arxiv.org/abs/quant-ph/9610001

1997

Earlier work this paper cites.

J. F. Poyatos, J. I. Cirac, and P. Zoller, “Complete Characterization of a Quantum Process: the Two-Bit Quantum Gate,” Physical Review Letters , vol. 78, no. 2, pp. 390–393, Jan. 1997, arXiv:quant-ph/9611013. [Online]. Available: http://arxiv.org/abs/quant-ph/9611013

1997

Earlier work this paper cites.

D. Gottesman, “The Heisenberg Representation of Quantum Computers,” Jul. 1998, arXiv:quant-ph/9807006. [Online]. Available: http://arxiv.org/abs/quant-ph/9807006

1998

Earlier work this paper cites.

D. Gottesman and I. L. Chuang, “Quantum Teleportation is a Universal Computational Primitive,” Nature , vol. 402, no. 6760, pp. 390–393, Nov. 1999, arXiv:quant-ph/9908010. [Online]. Available: http://arxiv.org/abs/quant-ph/9908010

1999

Earlier work this paper cites.

X. Zhou, D. W. Leung, and I. L. Chuang, “Methodology for quantum logic gate constructions,” Physical Review A , vol. 62, no. 5, p. 052316, Oct. 2000, arXiv:quant-ph/0002039. [Online]. Available: http://arxiv.org/abs/quant-ph/0002039

2000

Cited alongside, same era.

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 , ser. STOC ’01. New York, NY, USA: Association for Computing Machinery, Jul. 2001, pp. 114–123. [Online]. Available: https://dl.acm.org/doi/10.1145/380752.380785

2001

Cited alongside, same era.

B. M. Terhal and D. P. DiVincenzo, “Classical simulation of noninteracting-fermion quantum circuits,” Physical Review A , vol. 65, no. 3, p. 032325, Mar. 2002, arXiv:quant-ph/0108010. [Online]. Available: http://arxiv.org/abs/quant-ph/0108010

2002

Cited alongside, same era.

T. Pllaha, N. Rengaswamy, O. Tirkkonen, and R. Calderbank, “Un-Weyl-ing the Clifford Hierarchy,” Quantum , vol. 4, p. 370, Dec. 2020, arXiv:2006.14040 [quant-ph]. [Online]. Available: http://arxiv.org/abs/2006.14040

N. de Silva, “Efficient quantum gate teleportation in higher dimensions,” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences , vol. 477, no. 2251, p. 20200865, Jul. 2021, arXiv:2011.00127 [math-ph, physics:quant-ph]. [Online]. Available: http://arxiv.org/abs/2011.00127

Original

2011

Later among the works it cites.

M. Oszmaniec, N. Dangniam, M. E. S. Morales, and Z. Zimborás, “Fermion Sampling: a robust quantum computational advantage scheme using fermionic linear optics and magic input states,” PRX Quantum , vol. 3, no. 2, p. 020328, May 2022, arXiv:2012.15825 [math-ph, physics:quant-ph]. [Online]. Available: http://arxiv.org/abs/2012.15825

Original

2012

Later among the works it cites.

E. S. Meckes, The Random Matrix Theory of the Classical Compact Groups , ser. Cambridge Tracts in Mathematics. Cambridge: Cambridge University Press, 2019. [Online]. Available: https://www.cambridge.org/core/books/random-matrix-theory-of-the-classical-compact-groups/06D446A342AACF0214BA492B49237394

2019

Later among the works it cites.

B. Dias and R. Koenig, “Classical simulation of non-Gaussian fermionic circuits,” Jul. 2023, arXiv:2307.12912 [quant-ph]. [Online]. Available: http://arxiv.org/abs/2307.12912