Classical simulations of Abelian-group normalizer circuits with intermediate measurements

quant-ph/9608048

E. Knill, “Non-binary unitary error bases and quantum codes,” tech. rep., Los Alamos National Laboratory, 1996 · 1996

Earlier work this paper cites.

PhD thesis, California Institute of Technology, 1997

D. Gottesman, Stabilizer Codes and Quantum Error Correction · 1997

Earlier work this paper cites.

P. W. Shor, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,” SIAM J. Sci. Statist. Comput. 26

1997

Earlier work this paper cites.

Springer-Verlag, 1998

D. Gottesman, “Fault-tolerant quantum computation with higher-dimensional systems,” in Selected papers from the First NASA International Conference on Quantum Computing and Quantum Communications · 1998

Earlier work this paper cites.

International Press, 1999

D. Gottesman, “The Heisenberg representation of quantum computers,” in Group22: Proceedings of the XXII International Colloquium on Group Theoretical Methods in Physics · 1999

Earlier work this paper cites.

IEEE Computer Society, 1999

P. O. Boykin, T. Mor, M. Pulver, V. Roychowdhury, and F. Vatan, “On universal and fault-tolerant quantum computing: A novel basis and a new constructive proof of universality for shor’s basis,” in Proceedings of the 40th Annual Symposium on Foundations of Computer Science · 1999

Earlier work this paper cites.

M. Hillery, V. Bužek, and A. Berthiaume, “Quantum secret sharing,” Phys. Rev. A

1999

Earlier work this paper cites.

R. Cleve, D. Gottesman, and H.-K. Lo, “How to share a quantum secret,” Phys. Rev. Lett

1999

Earlier work this paper cites.

PhD thesis, University of Oxford, 1999

M. Mosca, Quantum computer algorithms · 1999

Earlier work this paper cites.

Cambridge University Press, 2000

M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information · 2000

Earlier work this paper cites.

P. O. Boykin, T. Mor, M. Pulver, V. Roychowdhury, and F. Vatan, “A new universal and fault-tolerant quantum basis,” Information Processing Letters

2000

Earlier work this paper cites.

D. Gottesman, “Theory of quantum secret sharing,” Phys. Rev. A

2000

Earlier work this paper cites.

PhD thesis, University of Waterloo, 2000

A. Storjohann, Algorithms for Matrix Canonical Forms · 2000

Earlier work this paper cites.

H. J. Briegel and R. Raussendorf, “Persistent entanglement in arrays of interacting particles,” Phys. Rev. Lett

2001

Earlier work this paper cites.

R. Raussendorf and H. J. Briegel, “A one-way quantum computer,” Phys. Rev. Lett

2001

Cited alongside, same era.

K. K. H. Cheung and M. Mosca, “Decomposing finite Abelian groups,” Quantum Info. Comput

2001

Cited alongside, same era.

M. A. Nielsen, M. J. Bremner, J. L. Dodd, A. M. Childs, and C. M. Dawson, “Universal simulation of hamiltonian dynamics for quantum systems with finite-dimensional state spaces,” Phys. Rev. A

2002

Cited alongside, same era.

D. L. Zhou, B. Zeng, Z. Xu, and C. P. Sun, “Quantum computation based on d

2003

Cited alongside, same era.

A. Y. Kitaev, “Fault-tolerant quantum computation by anyons,” Annals of Physics

2003

Cited alongside, same era.

J. Dehaene and B. De Moor, “Clifford group, stabilizer states, and linear and quadratic operations over GF(2),” Phys. Rev. A

D. E. Browne, “Efficient classical simulation of the quantum Fourier transform,” New Journal of Physics

Original

2007

Later among the works it cites.

Cambridge University Press, 2nd ed., 2008

V. Shoup, A Computational Introduction to Number Theory and Algebra · 2008

Later among the works it cites.

M. Van den Nest, “Simulating quantum computers with probabilistic methods,” Quantum Info. Comput

Original

2009

Later among the works it cites.

A. M. Childs and W. van Dam, “Quantum algorithms for algebraic problems,” Rev. Mod. Phys

Original

2010

Later among the works it cites.

Cambridge University Press, 2010

R. P. Brent and P. Zimmermann, Modern Computer Arithmetic · 2010

Later among the works it cites.