Advertisement

Journal of Statistical Physics

, Volume 122, Issue 3, pp 531–556 | Cite as

On the Computational Power of Molecular Heat Engines

  • Dominik JanzingEmail author
Article

Abstract

A heat engine is a machine which uses the temperature difference between a hot and a cold reservoir to extract work. Here both reservoirs are quantum systems and a heat engine is described by a unitary transformation which decreases the average energy of the bipartite system. On the molecular scale, the ability of implementing a (good) unitary heat engine is closely connected to the ability of performing logical operations and classical computing. This is shown by several examples:
  1. (1)

    The most elementary heat engine is a SWAP-gate acting on 1 hot and 1 cold two-level systems with different energy gaps.

     
  2. (2)

    An optimal unitary heat engine on a pair of 3-level systems can directly implement OR and NOT gates, as well as copy operations. The ability to implement this heat engine on each pair of 3-level systems taken from the hot and the cold ensemble therefore allows universal classical computation.

     
  3. (3)

    Optimal heat engines operating on one hot and one cold oscillator mode with different frequencies are able to calculate polynomials and roots approximately.

     
  4. (4)

    An optimal heat engine acting on 1 hot and n cold 2-level systems with different level spacings can even solve the NP-complete problem KNAPSACK. Whereas it is already known that the determination of ground states of interacting many-particle systems is NP-hard, the optimal heat engine is a thermodynamic problem which is NP-hard even for n non-interacting spin systems. This result suggests that there may be complexity-theoretic limitations on the efficiency of molecular heat engines.

     

Key Words

Second law complexity theory molecular computing nanoscopic machines 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

Copyright information

© Springer Science + Business Media, Inc. 2006

Authors and Affiliations

  1. 1.Institut für Algorithmen und Kognitive Systeme, Arbeitsgruppe Quantum ComputingUniversität KarlsruheGermany

Personalised recommendations