Fetching the paper…
Reading the bibliography…
Quantum information science explores the frontier of highly complex quantum states, the "entanglement frontier." This study is motivated by the observation (widely believed but unproven) that classical systems cannot simulate highly entangled quantum systems efficiently, and we hope to hasten the day when well controlled quantum systems can perform tasks surpassing what can be done in the classical world.
R. P. Feynman, Simulating physics with computers, International Journal of Theoretical Physics 21, 467-488 (1982)
1982
Earlier work this paper cites.
P. W. Shor, Algorithms for quantum computation: discrete logarithms and factoring, Proceedings of the 35th Symposium on Foundations of Computer Science, 124-134 (1994)
1994
Earlier work this paper cites.
A. Yu Kitaev, Quantum measurements and the Abelian stabilizer problem, arXiv:quant-ph/9511026 (1995)
1995
Earlier work this paper cites.
P. Shor, Scheme for reducing decoherence in quantum memory, Phys. Rev. A 52, R2493-R2496 (1995)
1995
Earlier work this paper cites.
A. M. Steane, Error correcting codes in quantum theory, Phys. Rev. Lett. 77, 793-797 (1995)
1995
Earlier work this paper cites.
L. K. Grover, A fast quantum mechanical algorithm for database search, STOC ’96: Proceedings of the 28th annual ACM symposium on theory of computing (1996)
1996
Earlier work this paper cites.
S. Lloyd, Universal quantum simulators, Science 273, 1073-1078 (1996)
1996
Earlier work this paper cites.
D. Aharonov, M. Ben-Or, R. Impagliazzo, and N. Nisan, Limitations of noisy reversible computation, arXiv:quant-ph/9611028 (1996)
1996
Earlier work this paper cites.
C. H. Bennett, E. Bernstein, G. Brassard, and U. Vazirani, Strengths and weaknesses of quantum computing, SIAM Journal on Computing, 26, 1510-1523 (1997)
1997
Earlier work this paper cites.
N. A. Gershenfeld and I. L. Chuang, Bulk spin-resonance quantum computation, Science 275, 350-356 (1997)
1997
Earlier work this paper cites.
D. G. Cory, A. F. Fahmy, and T. F. Havel, Ensemble quantum computing by NMR spectroscopy, Proc. Nat. Acad. Sci. 95, 1634-1639 (1997)
1997
Earlier work this paper cites.
E. Knill and R. Laflamme, Theory of quantum error-correcting codes, Phys. Rev. A 55, 900911 (1997)
1997
Earlier work this paper cites.
D. Aharonov and M. Ben-Or, Fault-tolerant quantum computation with constant error, STOC ’97: Proceedings of the 29th annual ACM symposium on theory of computing (1997)
1997
Earlier work this paper cites.
A. Yu. Kitaev, Quantum computations: algorithms and error correction, Russian Math. Surveys 52, 1191-1249 (1997)
1997
Earlier work this paper cites.
E. Knill and R. Laflamme, Power of one bit of quantum information, Phys. Rev. Lett. 81, 5672-5675 (1998)
1998
Earlier work this paper cites.
R. Laflamme, E. Knill, and W. Zurek, Resilient quantum computation: error models and thresholds, Proc. R. Soc. Lond. A 454, 365-384 (1998)
1998
Earlier work this paper cites.
L. Viola, E. Knill, and S. Lloyd, Dynamical decoupling of open quantum systems, Phys. Rev. Lett. 82, 2417-2421 (1999)
1999
Earlier work this paper cites.
R. W. Ogburn and J. Preskill, Topological quantum computation, Lecture Notes in Computer Science 1509, 341-356 (1999)
1999
Earlier work this paper cites.
E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser, Computation by adiabatic evolution, arXiv:quant-ph/0001106 (2000)
2000
Earlier work this paper cites.
E. Knill, R. Laflamme, and G. J. Milburn, A scheme for efficient quantum computation with linear optics, Nature 409, 46-52 (2001)
2001
Earlier work this paper cites.
D. Gottesman, A. Kitaev, and J. Preskill, Encoding a qubit in an oscillator, Phys. Rev. A 64, 012310 (2001)
2001
Earlier work this paper cites.
L. G. Valiant, Quantum computers that can be simulated classically in polynomial time, STOC ’01: Proceedings of the 33rd annual ACM symposium on theory of computing (2001)
2001
Earlier work this paper cites.
A. Yu. Kitaev, Unpaired Majorana fermions in quantum wires, Physics-Uspekhi 44, 131 (2001)
2001
Earlier work this paper cites.
M. H. Freedman, M. Larsen, and Z. Wang, A modular functor which is universal for universal quantum computation, Comm. Math. Phys. 227, 605-622 (2002)
2002
Earlier work this paper cites.
B. Terhal and D. P. DiVincenzo, Classical simulation of noninteracting-fermion quantum circuits, Phys. Rev. A 65, 032325 (2002)
2002
Cited alongside, same era.
S. B. Bravyi and A. Yu. Kitaev, Fermionic quantum computation, Annals of Physics 298, 210-226 (2002)
2002
Cited alongside, same era.
A. Yu. Kitaev, A. Shen, and M. N. Vyalyi, Classical and Quantum Computation
2002
Cited alongside, same era.
E. Dennis, A. Kitaev, A. Landahl, and J. Preskill, Topological quantum memory, J. Math. Phys. 43, 4452 (2002)
2002
Cited alongside, same era.
M. H. Freedman, A. Kitaev, M. J. Larsen, and Z. Wang, Topological quantum computation, Bull. AMS 40, 31-38 (2002)
2002
Cited alongside, same era.
I. Kassal, S. P. Jordan, P. J. Love, M. Mohseni, and A. Aspuru-Guzik, Polynomial-time quantum algorithm for the simulation of chemical dynamics, Proc. Nat. Acad. Sci. 105, 18681-18686 (2008)
2008
Later among the works it cites.
C. Nayak, S. H. Simon, A. Stern, M. Freedman, and S. Das Sarma, Non-Abelian anyons and topological quantum computation, Rev. Mod. Phys. 80, 1083-1159 (2008)
2008
Later among the works it cites.
L. Fu and C. Kane, Superconducting proximity effect and Majorana fermions at the surface of a topological insulator, Phys. Rev. Lett. 100, 096407 (2008)
2008
Later among the works it cites.
D. Aharonov, V. Jones, and Z. Landau, A polynomial quantum algorithm for approximating the Jones polynomial, Algorithmica 55, 395-421 (2009)
2009
Later among the works it cites.
A. W. Harrow, A. Hassidim, and S. Lloyd, Quantum algorithm for linear systems of equations, Phys. Rev. Lett. 103, 150502 (2009)
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2003
Cited alongside, same era.
S. D. Bartlett and B. C. Sanders, Requirement for quantum computation, J. Mod. Optics 50, 2331-2340 (2003)
2003
Cited alongside, same era.
D. Aharonov and A. Ta-Shma, Adiabatic quantum state generation and statistical zero knowledge, STOC ’03: Proceeding of the 35th ACM symposium on the theory of computing (2003)
2003
Cited alongside, same era.
A. Yu. Kitaev, Fault-tolerant quantum computation by anyons, Annals of Physics 303, 2-30 (2003)
2003
Cited alongside, same era.
A, Aspuru-Guzik, A. D. Dutoi, P. J. Love, and M. Head-Gordon, Simulated quantum computation of molecular energies, Science 309, 1704 (2005)
2005
Cited alongside, same era.
B. Terhal and G. Burkhard, Fault-tolerant quantum computation for local non-Markovian noise, Phys. Rev. A 71, 012336 (2005)
2005
Cited alongside, same era.
S. Das Sarma, M. Freedman, and C. Nayak, Topologically protected qubits from a possible non-Abelian fractional quantum Hall state, Phys. Rev. Lett. 94, 166802 (2005)
2005
Cited alongside, same era.
2009
Later among the works it cites.
D. Gottesman and S. Irani, The quantum and classical complexity of translationally invariant tiling and Hamiltonian problems, Proceedings of 50th Symposium on Foundations of Computer Science, 95-105 (2009)
2009
Later among the works it cites.
H.-K. Ng and J. Preskill, Fault-tolerant quantum computation versus Gaussian noise, Phys. Rev. A 79, 032318 (2009)
2009
Later among the works it cites.
G. Alagic, S. P. Jordan, R. König, and B. W. Reichardt, Estimating Turaev-Viro three-manifold invariants is universal for quantum computation, Phys. Rev. A 82, 040302 (2010)
2010
Later among the works it cites.
M. Cramer, M. B. Plenio, S. T. Flammia, R. Somma, D. Gross, S. D. Bartlett, O. Landon-Cardinal, D. Poulin, and Y.-K. Liu, Efficient quantum state tomography, Nature Communications 1, 149 (2010)
2010
Later among the works it cites.
S. Aaronson and A. Arkhipov, The computational complexity of linear optics, arXiv:1011.3245 (2010)
2010
Later among the works it cites.
J. D. Sau, R. M. Lutchyn, S. Tewari, and S. Das Sarma, Generic new platform for topological quantum computation using semiconductor heterostructures, Phys. Rev. Lett. 104, 040502 (2010)
2010
Later among the works it cites.
J. Alicea, Majorana fermions in a tunable semiconductor device, Phys. Rev. B 81, 125318 (2010)
2010
Later among the works it cites.
R. M. Lutchyn, J. D. Sau, and S. Das Sarma, Majorana Fermions and a topological phase transition in semiconductor-superconductor heterostructures, Phys. Rev. Lett. 105, 077001 (2010)
2010
Later among the works it cites.
Y. Oreg, G. Refael, and F. von Oppen, Helical liquids and Majorana bound states in quantum wires, Phys. Rev. Lett. 105, 177002 (2010)
2010
Later among the works it cites.
R. Alicki, M. Horodecki, P. Horodecki, and R. Horodecki, On thermal stability of topological qubit in Kitaev’s 4D model, Open Syst. Inf. Dyn. 17 (2010)
2010
Later among the works it cites.
S. Chesi, D. Loss, S. Bravyi, and B. Terhal, Thermodynamic stability criteria for a quantum memory based on stabilizer and subsystem codes, New Journal of Physics 12, 025013 (2010)
2010
Later among the works it cites.
D. Poulin, A. Qarry, R. Somma, and F. Verstraete, Quantum simulation of time-dependent Hamiltonians and the convenient illusion of Hilbert space, Phys. Rev. Lett. 106, 170501 (2011)
2011
Later among the works it cites.
2011
Later among the works it cites.
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, 459-472 (2011)
2011
Later among the works it cites.
2011
Later among the works it cites.
J. Alicea, Y. Oreg, G. Refael, F. von Oppen, M. P. A. Fisher, Non-Abelian statistics and topological quantum information processing in 1D wire networks, Nature Physics 7, 412417 (2011)
2011
Later among the works it cites.
J. Haah, Local stabilizer codes in three dimensions without string logical operators, Phys. Rev. A 83, 042330 (2011)
2011
Later among the works it cites.
2011
Later among the works it cites.