On the computational power of molecular heat engines

Journal of Statistical Physics

Volumn 122, Issue 3, 2006, Pages 531-556

  Janzing, Dominik ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

Complexity theory; Molecular computing; Nanoscopic machines; Second law

Indexed keywords

EID: 33644516305     PISSN: 00224715     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10955-005-8015-9     Document Type: Article

References (28)

1. L. Schulman and U. Vazirani. Scalable NMR Quantum Computers. quant-ph/9804060 (1998).
2. R. Landauer. Irreversibility and heat generation in the computing process. IBM J. Res. Develop. 5:183-191, (1961).
3. L. Szilard. Über die Entropieverminderung in einem thermodynamischen System bei Eingriffen intelligenter Wesen. Z. Phys, 840-856, (1929).
4. M. Nielsen and I. Chuang. Quantum Computation and Quantum Information. Cambridge University Press (2000).
5. A. Lenard. Thermodynamical proof of the Gibbs formula for elementary quantum systems. Journ. Stat. Phys. 19:575 (1978).
6. A. Allahverdyan, R. Balian and T. Nieuwenhuizen. Quantum thermodynamics: thermodynamics at the nanoscale. cond-mat/0402387.
7. A. Allahverdyan, R. Balian and T. Nieuwenhuizen. Maximal work extraction from quantum systems. Europhys. Lett. 67:565 (2004).
8. H. Quan, P. Zhang and C. Sun. Quantum heat engines with multi-level quantum systems, quantph/0504118.
9. E. Davies. Information and quantum measurement. IEEE Trans. Inform. Theory IT-24(5):596-599 (1978).
10. D. Janzing, P. Wocjan, R. Zeier, R. Geiss and Th. Beth. Thermodynamic cost of reliability and low temperatures: tightening Landauer's principle and the Second Law. Int. Jour. Theor. Phys. 39(12):2217-2753 (2000).
11. P. Benioff. The computer as a physical system: A microscopic quantum mechanical model of computers as represented by Turing machines. J. Stat. Phys. 22(5):562-591 (1980).
12. C. H. Bennett. Logical reversibility of computation. IBM J. Res. Develop. 17:525-532 (1973).
13. R. Feynman.Quantum mechanical computers. Opt. News 11:11-46 (1985).
14. N. Margolus. Parallel quantum computation. In W. Zurek, editor, Complexity, Entropy, and the Physics of Information. (Addison Wesley Longman, 1990).
15. D. Janzing and Th. Beth. Are there quantum bounds on the recyclability of clock signals in low power computers? In Proceedings of the DFG-Kolloquium VIVA, (Chemnitz, 2002). See also LANL-preprint quant-ph/0202059.
16. D. Janzing and P. Wocjan. Ergodic quantum computing. QIP 4(2):129-158 (2005).
17. W. Pusz and L. Woronowicz. Passive states and KMS states for general quantum systems. Comm. Math. Phys. 58:273-290 (1978).
18. R. Bhatia. Matrix analysis. (Springer Verlag, 1997).
19. H. Callen. Thermodynamics. (J. Wiley and Sons, New York, 1960).
20. Becker. T. and V. Weispfenning. Gröbner Bases. (1993).
21. T. Toffoli. Reversible computing. MIT Report MIT/LCS/TM-151 (1980).
22. J. Håstad. Computational Limitations for Small-Depth Circuits. (MIT Press, Cambridge, Massachusetts, 1987).
23. D. Janzing and Th. Beth. Remark on multi-particle states and observables with constant complexity. LANL-preprint quant-ph/0003117.
24. M. Garey and D. Johnson. Computers and Intractibility. Freeman and Company, New York.
25. J. van Leeuwen, editor. Algorithms and Complexity. (Elsevier, Cambridge, MA, 1990).
26. Ausiello et al. Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. (Springer, 1999).
27. A. Vergis, K Striglitz and B. Dickinson. The complexity of analog computation. Math. Comp. Stimuli. 28:91-113 (1986).
28. P. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SLAM Journal on Computing 26(5):1484-1509 (1997).