Classical computation with quantum systems

被引:5
|
作者
Delaney, P [1 ]
Greer, JC [1 ]
机构
[1] Tyndall Natl Inst, Cork, Ireland
关键词
reduced density matrices; maximum entropy principle; quantum sub-systems; spin electronics;
D O I
10.1098/rspa.2005.1565
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
As semiconductor electronic devices scale to the nanometer range and quantum structures (molecules, fullerenes, quantum dots, nanotubes) are investigated for use in information processing and storage, it, becomes useful to explore the limits imposed by quantum mechanics on classical computing. To formulate the problem of a quantum mechanical description of classical computing, electronic device and logic gates are described as quantum sub-systems with inputs treated as boundary conditions, outputs expressed.is operator expectation values, and transfer characteristics and logic operations expressed through the sub-system Hamiltonian. with constraints appropriate to the boundary conditions. This approach, naturally, leads to a description of the subsystem.,, in terms of density matrices. Application of the maximum entropy principle subject to the boundary conditions (inputs) allows for the determination of the density matrix (logic operation), and for calculation of expectation values of operators over a finite region (outputs). The method allows for in analysis of the static properties of quantum sub-systems.
引用
收藏
页码:117 / 135
页数:19
相关论文
共 50 条
  • [1] Classical versus quantum errors in quantum computation of dynamical systems
    Rossini, D
    Benenti, G
    Casati, G
    [J]. PHYSICAL REVIEW E, 2004, 70 (05):
  • [2] Computation and Dynamics: Classical and Quantum
    Kisil, Vladimir V.
    [J]. QUANTUM THEORY: RECONSIDERATION OF FOUNDATIONS - 5, 2010, 1232 : 306 - 312
  • [3] A Unified Approach to Quantum Computation and Classical Reversible Computation
    De Vos, Alexis
    De Baerdemacker, Stijn
    [J]. REVERSIBLE COMPUTATION, RC 2018, 2018, 11106 : 133 - 143
  • [4] Quantum and Classical Structures in Nondeterminstic Computation
    Pavlovic, Dusko
    [J]. QUANTUM INTERACTION, PROCEEDINGS, 2009, 5494 : 143 - 157
  • [5] Succinct Classical Verification of Quantum Computation
    Bartusek, James
    Kalai, Yael Tauman
    Lombardi, Alex
    Ma, Fermi
    Malavolta, Giulio
    Vaikuntanathan, Vinod
    Vidick, Thomas
    Yang, Lisa
    [J]. ADVANCES IN CRYPTOLOGY - CRYPTO 2022, PT II, 2022, 13508 : 195 - 211
  • [6] Information and computation:: Classical and quantum aspects
    Galindo, A
    Martín-Delgado, MA
    [J]. REVIEWS OF MODERN PHYSICS, 2002, 74 (02) : 347 - 423
  • [7] Physics of computation: From classical to quantum
    Thomas, H
    [J]. COMPLEXITY FROM MICROSCOPIC TO MACROSCOPIC SCALES: COHERENCE AND LARGE DEVIATIONS, 2002, 63 : 1 - 20
  • [8] Secure Quantum Computation with Classical Communication
    Bartusek, James
    [J]. THEORY OF CRYPTOGRAPHY, TCC 2021, PT I, 2021, 13042 : 1 - 30
  • [9] Advice Coins for Classical and Quantum Computation
    Aaronson, Scott
    Drucker, Andrew
    [J]. AUTOMATA, LANGUAGES AND PROGRAMMING, ICALP, PT I, 2011, 6755 : 61 - 72
  • [10] Quantum and classical dynamics in adiabatic computation
    Crowley, P. J. D.
    Duric, T.
    Vinci, W.
    Warburton, P. A.
    Green, A. G.
    [J]. PHYSICAL REVIEW A, 2014, 90 (04):