Fetching the paper…
Reading the bibliography…
Simulating quantum circuits using classical computers lets us analyse the inner workings of quantum algorithms.
Bennett, C. H. Logical reversibility of computation. IBM J. Res. Develop
1973
Earlier work this paper cites.
Toffoli, T. Reversible computing. Automata, languages and programming, Seventh colloquium, Lecture notes in computer science
1980
Earlier work this paper cites.
Freuder, E. C. A sufficient condition for backtrack-bounded search. J. ACM
1985
Earlier work this paper cites.
Damm, C. Problems complete for ⊕ \oplus L. Information Processing Letters
1990
Earlier work this paper cites.
Shor, P. Algorithms for quantum computation: Discrete logarithms and factoring, SIAM J. Comput
1997
Earlier work this paper cites.
Gottesman, D. A theory of fault-tolerant quantum computation. Phys. Rev. A
1998
Earlier work this paper cites.
Nielsen, M. & Chuang, I. L. Quantum computation and quantum information
2000
Earlier work this paper cites.
Knill, E. Fermionic linear optics and matchgates. Preprint at < < http://arxiv.org/abs/quant-ph/0108033 > > (2001)
2001
Earlier work this paper cites.
Valiant, L. G. Quantum computers that can be simulated classically in polynomial time. SIAM J. Comput
2002
Earlier work this paper cites.
Terhal, B. M. & DiVincenzo, D. P. Classical simulation of noninteracting-fermion quantum circuits. Phys. Rev. A
2002
Earlier work this paper cites.
Jozsa, R. & Linden, N. On the role of entanglement in quantum-computational speed-up. Proc. R. Soc. Lond. A
2003
Earlier work this paper cites.
Vidal, G. Efficient classical simulation of slightly entangled quantum computations. Phys. Rev. Lett
2003
Earlier work this paper cites.
Aaronson, S. & Gottesman, D. Improved simulation of stabilizer circuits. Phys. Rev. A
2004
Earlier work this paper cites.
DiVincenzo, D. P. & Terhal, B. M. Fermionic linear optics revisited. Found. Phys
2005
Cited alongside, same era.
Bravyi, S. Lagrangian representation for fermionic linear optics. Quantum Inf. Comp
2005
Cited alongside, same era.
Anders, S. & Briegel, H. J. Fast simulation of stabilizer circuits using a graph-state representation. Phys. Rev. A
2006
Cited alongside, same era.
Jozsa, R. On the simulation of quantum circuits. Preprint at < < http://arxiv.org/abs/quant-ph/0603163 > > (2006)
2006
Cited alongside, same era.
Shi, Y.-Y., Duan, L.-M. & Vidal, G. Classical simulation of quantum many-body systems with a tree tensor network. Phys. Rev. A
2006
Cited alongside, same era.
Markov, I. L. & Shi, Y.-Y. Simulating quantum computation by contracting tensor networks. SIAM J. Comput
2008
Later among the works it cites.
Bravyi, S. Contraction of matchgate tensor networks on non-planar graphs. Contemporary Mathematics
2009
Later among the works it cites.
Van den Nest, M., Dür, W., Raussendorf, R. & Briegel, H. J. Quantum algorithms for spin models and simulable gate sets for quantum computation. Phys. Rev. A
2009
Later among the works it cites.
Arora, S. & Barak, B. Computational complexity: A modern approach
2009
Later among the works it cites.
Van den Nest, M. Classical simulation of quantum computation, the Gottesman-Knill theorem, and slightly beyond. Quant. Inf. Comp
2010
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2006
Cited alongside, same era.
Yoran, N. & Short, A. J. Efficient classical simulation of the approximate quantum Fourier transform. Phys. Rev. A
2007
Cited alongside, same era.
Browne, D. E. Efficient classical simulation of the quantum Fourier transform. New J. Phys
2007
Cited alongside, same era.
Bravyi, S. & Raussendorf, R. On measurement-based quantum computation with the toric code states. Phys. Rev. A
2007
Cited alongside, same era.
Van den Nest, M., Dür, W., Vidal, G. & Briegel, H. J. Classical simulation versus universality in measurement-based quantum computation. Phys. Rev. A
2007
Cited alongside, same era.
McCulloch, I. From density-matrix renormalization group to matrix product states. J. Stat. Mech
2007
Cited alongside, same era.
Clark, S., Jozsa, R. & Linden, N. Generalized Clifford groups and simulation of associated quantum circuits. Quant. Inf. Comp
2008
Cited alongside, same era.
Johnson, T. H., Clark, S. R., & Jaksch, D. Dynamical simulations of classical stochastic systems using matrix product states. Phys. Rev. E
2010
Later among the works it cites.
Goldreich, O. P, NP, and NP-completeness: The basics of computational complexity
2010
Later among the works it cites.
Clark, S. R., Prior, J., Hartmann, M. J., Jaksch, D. & Plenio, M. B., Exact matrix product solutions in the Heisenberg picture of an open quantum spin chain. New J. Phys
2010
Later among the works it cites.
Biamonte, J. D., Clark, S. R. & Jaksch, D. Categorical tensor network states. AIP Advances
2011
Later among the works it cites.
Cai, J.-Y. & Lu, P. Holographic algorithms: From art to science. J. Comput. Syst. Sci
2011
Later among the works it cites.
Van den Nest, M. Quantum matchgate computations and linear threshold gates. Proc. R. Soc. A
2011
Later among the works it cites.