Fetching the paper…
Reading the bibliography…
We construct a family of time-independent nearest-neighbor Hamiltonians coupling eight-state systems on a 1D ring that enables universal quantum computation.
R. A. Horn and C. R. Johnson, Matrix analysis (Cambridge University Press, Cambridge, 1985), ISBN 0-521-30586-1
1985
Earlier work this paper cites.
R. P. Feynman, Quantum mechanical computers , Found. Phys. 16
1986
Earlier work this paper cites.
D. Deutsch, Quantum computational networks , Proc. Roy. Soc. London A 425
1989
Earlier work this paper cites.
N. Margolus, Parallel quantum computation , in Complexity, entropy, and the physics of information , edited by W. H. Zurek (Addison-Wesley, Redwood City, CA, 1990), vol. VII of SFI Studies in the Sciences of Complexity , pp. 273–287, ISBN 0-201-51509-1, URL http://kh.bu.edu/qcl/margolun19901c1f6f6d.pdf
1990
Earlier work this paper cites.
E. Bernstein and U. Vazirani, Quantum complexity theory , in Proceedings of the 25th Annual ACM Symposium on the Theory of Computing , ACM (ACM Press, New York, 16–18 May 1993, San Diego, CA, USA, 1993), pp. 11–20, ISBN 0-89791-591-7, doi:10.1145/167088.167097
1993
Earlier work this paper cites.
A. C.-C. Yao, Quantum circuit complexity , in Proceedings of the 34th Annual Symposium on Foundations of Computer Science , IEEE (IEEE Press, New York, 3–5 Nov. 1993, Palo Alto, CA, 1993), pp. 352–361, doi:10.1109/SFCS.1993.366852
1993
Earlier work this paper cites.
A. Barenco, A universal two-bit gate for quantum computation , Proc. Roy. Soc. London A 449
1995
Earlier work this paper cites.
D. P. DiVincenzo, Two-bit gates are universal for quantum computation , Phys. Rev. A 51
1995
Earlier work this paper cites.
S. Lloyd, Almost any quantum logic gate is universal , Phys. Rev. Lett. 75
1995
Earlier work this paper cites.
J. Watrous, On one-dimensional quantum cellular automata , in Proceedings of the 36th Annual Symposium on Foundations of Computer Science , IEEE (IEEE Press, Los Alamitos, CA, 23–25 Oct. 1995, Milwaukee, WI, USA, 1995), pp. 528–537, ISBN 0-8186-7183-1, doi:10.1109/SFCS.1995.492583
1995
Earlier work this paper cites.
P. W. Shor, Fault-tolerant quantum computation , in Proceedings of the 37th Annual Symposium on Foundations of Computer Science , edited by R. S. Sipple, IEEE (IEEE Press, Los Alamitos, CA, 14–16 Oct. 1996, Burlington, VT, USA, 1996), pp. 56–65, ISBN 0-8186-7594-2, arXiv:quant-ph/9605011
1996
Earlier work this paper cites.
R. Landauer, The physical nature of information , Phys. Lett. A 217
1996
Earlier work this paper cites.
D. A. Meyer, From quantum cellular automata to quantum lattice gases , J. Stat. Phys 85
1996
Earlier work this paper cites.
W. van Dam, A universal quantum cellular automaton , in Proceedings of the Fourth Workshop on the Physics of Computation , edited by T. Toffoli, M. Biafore, and J. Leäo (New England Complex Systems Institute, Cambridge, MA, 22–24 Nov. 1996, Boston, MA, USA, 1996), pp. 323–331, URL http://www.cs.ucsb.edu/~vandam/research/uqca.pdf
1996
Earlier work this paper cites.
D. Aharonov and M. Ben-Or, Fault tolerant quantum computation with constant error rate (1999), See also condensed version Aharonov and Ben-Or 1997 ., arXiv:quant-ph/9906129
1997
Cited alongside, same era.
E. Farhi and S. Gutmann, Quantum computation and decision trees , Phys. Rev. A 58
1998
Cited alongside, same era.
P. O. Boykin, T. Mor, M. Pulver, V. Roychowdhury, and F. Vatan, On universal and fault-tolerant quantum computing , pp. 486–494 (1999), doi:0.1109/SFFCS.1999.814621 , arXiv:quant-ph/9906054
1999
Cited alongside, same era.
D. Aharonov and M. Ben-Or, Fault tolerant quantum computation with constant error , in Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing , edited by F. T. Leighton and P. Shor, ACM (ACM Press, New York, El Paso, TX, USA, 1997), pp. 176–188, ISBN 0-89791-888-6, See also extended version Aharonov and Ben-Or 1999 ., doi:10.1145/258533.258579 , arXiv:quant-ph/9611025
1999
Cited alongside, same era.
R. Oliveira and B. M. Terhal, The complexity of quantum spin systems on a two-dimensional square lattice (2005), arXiv:quant-ph/0504050
2005
Later among the works it cites.
D. Janzing and P. Wocjan, Ergodic quantum computing , Quant Inf. Proc. 4
2005
Later among the works it cites.
M. Christandl, N. Datta, T. C. Dorlas, A. Ekert, A. Kay, and A. J. Landahl, Perfect transfer of arbitrary states in quantum spin networks , Phys. Rev. A 71
2005
Later among the works it cites.
J. Kempe, A. Kitaev, and O. Regev, The complexity of the local Hamiltonian problem , SIAM J. Comput. 35
2006
Later among the works it cites.
D. J. Shepherd, T. Franz, and R. F. Werner, Universally programmable quantum cellular automaton , Phys. Rev. Lett. 97
2006
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
P. O. Boykin, T. Mor, M. Pulver, V. Roychowdhury, and F. Vatan, A new universal and fault tolerant quantum basis , Inf. Proc. Lett. 75
2000
Cited alongside, same era.
R. Solovay, Lie groups and quantum circuits (2000), MSRI presentation at http://www.msri.org/publica-tions/ln/msri/2000/qcomputing/solovay/1/
2000
Cited alongside, same era.
M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, Cambridge, 2000), ISBN 0-521-63235-8 (Hardback), 0-521-63503-9 (Paperback)
2000
Cited alongside, same era.
A. Yu. Kitaev, A. Shen, and M. N. Vyalyi, Classical and Quantum Computation , vol. 47 of Graduate Studies in Mathematics (American Mathematical Society, Providence, RI, 2002), ISBN 0-821-82161-X, Translated from the Russian edition by Lester J. Senechal
2002
Cited alongside, same era.
Y. Shi, Both Toffoli and controlled-NOT need little help to do universal quantum computation , Quant. Info. Comp. 3
2003
Cited alongside, same era.
A. M. Childs, R. Cleve, E. Deotto, E. Farhi, S. Gutmann, and D. A. Spielman, Exponential algorithmic speedup by a quantum walk , in Proceedings of the Thirty-Fifth Annual ACM Symposium on the Theory of Computing , edited by L. L. Larmore and M. X. Goemans, ACM (ACM Press, New York, 9–11 Jun. 2003, San Diego, CA, USA, 2003), pp. 59–68, ISBN 1-58113-674-9, doi:10.1145/780542.780552 , arXiv:quant-ph/0209131
2003
Cited alongside, same era.
D. Aharonov, W. van Dam, J. Kempe, Z. Landau, S. Lloyd, and O. Regev, Adiabatic quantum computation is equivalent to standard quantum computation , in Azada 2004 , pp. 42–51, doi:10.1109/FOCS.2004.8 , arXiv:quant-ph/0405098
2004
Cited alongside, same era.
D. Azada, ed., Proceedings of the 45th IEEE Symposium on Foundations of Computer Science , IEEE (IEEE Press, Los Alamitos, CA, Oct. 17–19, Rome, IT, 2004), ISBN 0-7695-2228-9
2004
Cited alongside, same era.
C. M. Dawson and M. A. Nielsen, The Solovay-Kitaev algorithm , Quant. Inf. Comp. 6
2006
Later among the works it cites.
T. J. Osborne, The dynamics of 1d quantum spin systems can be approximated efficiently , Phys. Rev. Lett. 97
2006
Later among the works it cites.
2007
Later among the works it cites.
2007
Later among the works it cites.
D. Janzing, Spin-1/2 particles moving on a 2d lattice with nearest-neighbor interactions can realize an autonomous quantum computer , Phys. Rev. A p. 012307 (2007), doi:10.1103/PhysRevA.75.012307 , arXiv:quant-ph/0506270
2007
Later among the works it cites.
P. Deift, M. B. Ruskai, and W. Spitzer, Improved gap estimates for simulating quantum circuits by adiabatic evolution , Quant. Inf. Proc. 6
2007
Later among the works it cites.
S. Irani, The complexity of quantum systems on a one-dimensional chain (2007), arXiv:0705.4067
2007
Later among the works it cites.
D. A. Lidar, Towards fault tolerant adiabatic quantum computation (2007), arXiv:0707.0021
2007
Later among the works it cites.