Ergodic quantum computing

Quantum Information Processing

Volumn 4, Issue 2, 2005, Pages 129-158

  Janzing, Dominik ^a   Wocjan, Pawel ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

Hamiltonian of a quantum computer; Quantum cellular automata; Solid state quantum computing; Thermodynamics of computation

Indexed keywords

AUTOMATA THEORY; COMPUTATION THEORY; COMPUTER SIMULATION; GATES (TRANSISTOR); HAMILTONIANS; MATHEMATICAL MODELS; PROBABILITY; THERMODYNAMICS;

HAMILTONIAN OF A QUANTUM COMPUTER; QUANTUM CELLULAR AUTOMATA; SOLID STATE QUANTUM COMPUTING; THERMODYNAMICS OF COMPUTATION;

QUANTUM THEORY;

EID: 18844372226     PISSN: 15700755     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11128-005-4482-9     Document Type: Article

References (21)

1. S. Benjamin, Quantum computing with globally controlled exchange-type interactions. quant-ph/0104117.
2. S. Benjamin, Schemes for parallel quantum computation without local control of qubits. quant-ph/9909007.
3. D. Leung, Two-qubit projective measurements are universal for quantum computation. quant-ph/0111122, 2001.
4. D. Aharonov, W. van Dam, J. Kempe, Z. Landau, S. Lloyd and O. Regev. Adiabatic quantum computation is equivalent to standard quantum computation, quant-ph/0405098, 2004.
5. P. Benioff, J. Stat. Phys., 22(5), 1980.
6. R. Feynman, Opt. News, 11, 1985.
7. N. Margolus, Ann. NY. Acad. Sci., 480(480-497), 1986.
8. P. Wocjan, Estimating mixing properties of local Hamiltonian dynamics and continuous quantum random walks is PSPACE-hard. quant-ph/0401184.
9. A. Kitaev, Quantum measurements and the abelian stabilizer problem. Electronic Colloquium on Computational Complexity, (TR96-003), 1996. see also quant-ph/9511026.
10. N. Margolus, Complexity, Entropy, and the Physics of Information, W. Zurek (ed.), (Addison Wesley Longman, 1990).
11. A. Yu. Kitaev, A. H. Shen and M. N. Vyalyi, Classical and Quantum Computation, vol 27 of Graduate Studies in Mathematics. American Mathematical Society, 2002.
12. M. Biafore, in Proceedings of Workshop on Physics of Comp., IEEE Computer Soc. Press, Los Alamitos, CA, 1994, pp. 63-86.
13. J. Ziman. Principles of the Theory of Solids (Cambridge University Press, Cambridge, 1972).
14. N. Margolus, Complexity, entropy, and the physics of information, W. Zurek (ed.), Santa Fee Institute, Addison Wesley, vol. 8, pp. 273-287. (Neading, MA, 1990).
15. T. Gramss, On the speed of quantum computers with finite size clocks. Santa Fe Institute Working Papers, 1995. http://www.santafe.edu/sfi/ publications/wpabstract/199510086.
16. D. Aharonov, A. Ambainis, J. Kempe and U. Vazirani, in Proceedings of ACM Symposium on Theory of Computation (STOC'01), July 2001, pp. 50-59.
17. P. Diaconis, S. S. Gupta (ed.), Group Representations in Probability and Statistics IMS Lecture Notes - Monograph Series, Vol. 11, (Inst. of Math. Stat., Hawyard CA, 1988).
18. Ch. Papadimitriou, Computational Complexity (Addison Wesley, Reading, MA, 1994).
19. P. Wocjan, D. Janzing, Th. Decker and Th. Beth, in Proceedings of the WISICT conference, Cancun 2004. quant-ph/0308011.
20. C. H. Bennett, IBM J. Res. Develop., 17, 525-532 (1973).
21. R. Raussendorf and H. Briegel, Phys. Rev. 86 , 5188 (2000).