Fetching the paper…
Reading the bibliography…
It is often said that the transition from quantum to classical worlds is caused by decoherence originated from an interaction between a system of interest and its surrounding environment.
On the einstein–podolsky–rosen paradox
Bell, J · 1964
Earlier work this paper cites.
On the power of random access machines (Springer, 1979)
Schönhage, A · 1979
Earlier work this paper cites.
Quantum cryptography based on bell’s theorem
Ekert, A. K · 1991
Earlier work this paper cites.
Teleporting an unknown quantum state via dual classical and einstein-podolsky-rosen channels
Bennett, C. H. et al · 1993
Earlier work this paper cites.
Stabilizer codes and quantum error correction
Gottesman, D · 1997
Earlier work this paper cites.
Power of one bit of quantum information
Knill, E. & Laflamme, R · 1998
Earlier work this paper cites.
Quantum circuits with mixed states
Aharonov, D., Kitaev, A. & Nisan, N · 1998
Earlier work this paper cites.
Entanglement of formation of an arbitrary state of two qubits
Wootters, W. K · 1998
Earlier work this paper cites.
A scheme for efficient quantum computation with linear optics
Knill, E., Laflamme, R. & Milburn, G. J · 2001
Earlier work this paper cites.
Quantum circuits that can be simulated classically in polynomial time
Valiant, L. G · 2002
Earlier work this paper cites.
Topological quantum memory
Dennis, E., Kitaev, A., Landahl, A. & Preskill, J · 2002
Earlier work this paper cites.
Decoherence and the transition from quantum to classical–revisited
Zurek, W. H · 2003
Earlier work this paper cites.
Decoherence, einselection, and the quantum origins of the classical
Zurek, W. H · 2003
Earlier work this paper cites.
Valence-bond states for quantum computation
Verstraete, F. & Cirac, J. I · 2004
Earlier work this paper cites.
Guest column: Np-complete problems and physical reality
Aaronson, S · 2005
Earlier work this paper cites.
Quantum computing, postselection, and probabilistic polynomial-time
Aaronson, S · 2005
Earlier work this paper cites.
Long-range quantum entanglement in noisy cluster states
Raussendorf, R., Bravyi, S. & Harrington, J · 2005
Earlier work this paper cites.
Quantum computing with realistically noisy devices
Knill, E · 2005
Earlier work this paper cites.
Scalable quantum computing in the presence of large detected-error rates
Knill, E · 2005
Earlier work this paper cites.
Universal quantum computation with ideal clifford gates and noisy ancillas
Bravyi, S. & Kitaev, A · 2005
Earlier work this paper cites.
Quantum universality from magic states distillation applied to css codes
Reichardt, B. W · 2005
Cited alongside, same era.
Standard forms of noisy quantum operations via depolarization
Dür, W., Hein, M., Cirac, J. I. & Briegel, H.-J · 2005
Cited alongside, same era.
Quantum computers, algorithms and chaos
Hein, M. et al · 2006
Cited alongside, same era.
A fault-tolerant one-way quantum computer
Raussendorf, R., Harrington, J. & Goyal, K · 2006
Cited alongside, same era.
The bqp-hardness of approximating the jones polynomial
Aharonov, D. & Arad, I · 2006
Cited alongside, same era.
Noise thresholds for optical quantum computers
Dawson, C. M., Haselgrove, H. L. & Nielsen, M. A · 2006
Cited alongside, same era.
Topologically protected measurement-based quantum computation on the thermal state of a nearest-neighbor two-body hamiltonian with spin-3/2 particles
Fujii, K. & Morimae, T · 2012
Later among the works it cites.
Blind topological measurement-based quantum computation
Morimae, T. & Fujii, K · 2012
Later among the works it cites.
Commuting quantum circuits: efficient classical simulations versus hardness results
Ni, X. & Nest, M. V. d · 2012
Later among the works it cites.
Unconditionally verifiable blind computation
Fitzsimons, J. F. & Kashefi, E · 2012
Later among the works it cites.
Classical command of quantum systems
Reichardt, B. W., Unger, F. & Vazirani, U · 2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Measurement-based quantum computation with the toric code states
Bravyi, S. & Raussendorf, R · 2007
Cited alongside, same era.
Topological fault-tolerance in cluster state quantum computation
Raussendorf, R., Harrington, J. & Goyal, K · 2007
Cited alongside, same era.
Polynomial quantum algorithms for additive approximations of the potts model and other points of the tutte plane
Aharonov, D., Arad, I., Eban, E. & Landau, Z · 2007
Cited alongside, same era.
Temporally unstructured quantum computation
Shepherd, D. & Bremner, M. J · 2009
Cited alongside, same era.
Transitions in the computational power of thermal states for measurement-based quantum computation
Barrett, S. D., Bartlett, S. D., Doherty, A. C., Jennings, D. & Rudolph, T · 2009
Cited alongside, same era.
A polynomial quantum algorithm for approximating the jones polynomial
Aharonov, D., Jones, V. & Landau, Z · 2009
Cited alongside, same era.
Fujii, K. & Morimae, T · 2013
Later among the works it cites.
Measurement-based quantum computation on symmetry breaking thermal states
Fujii, K., Nakata, Y., Ohzeki, M. & Murao, M · 2013
Later among the works it cites.
An introduction to reliable quantum computation
Aliferis, P · 2013
Later among the works it cites.
Theoretical physics: Complexity on the horizon
Gefter, A · 2014
Closest in time.
Defining and detecting quantum speedup
Rønnow, T. F. et al · 2014
Closest in time.
Evidence for quantum annealing with more than one hundred qubits
Boixo, S. et al · 2014
Closest in time.
Hardness of classically simulating the one-clean-qubit model
Morimae, T., Fujii, K. & Fitzsimons, J. F · 2014
Closest in time.
Impossibility of classically simulating one-clean-qubit computation
Fujii, K. et al · 2014
Closest in time.
Diagonal quantum circuits: Their computational power and applications
Nakata, Y. & Murao, M · 2014
Closest in time.
Quantum algorithm for an additive approximation of ising partition functions
Matsuo, A., Fujii, K. & Imoto, N · 2014
Closest in time.
Contextuality supplies the /‘magic/’ for quantum computation
Howard, M., Wallman, J., Veitch, V. & Emerson, J · 2014
Closest in time.
Will boson-sampling ever disprove the extended church-turing thesis?
Rohde, P. P., Motes, K. R., Knott, P. & Munro, W. J · 2014
Closest in time.
Average-case complexity versus approximate simulation of commuting quantum computations
Bremner, M. J., Montanaro, A. & Shepherd, D. J · 2015
Closest in time.
Quantum computation with topological codes: from qubit to topological fault-tolerance
Fujii, K · 2015
Closest in time.