IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-1-4615-4799-0_17.html

Atomic Operator Formalism of Elementary Gates for Quantum Computation and Impurity-Induced Exciton Quantum Gates

In: Mathematical Models of Non-Linear Excitations, Transfer, Dynamics, and Control in Condensed Systems and Other Media

Author

Listed:
  • Shozo Takeno

    (Department of Information Systems Osaka Institute of Technology Hirakata)

  • Hideaki Matsueda

    (Department of Information Science Kochi University Kochi)

Abstract

The information-processing capability of quantum systems has long been of theoretical interest in physics and computer science. Feynman considered gate arrays with computing operations based on principles of quantum mechanics1. Deutch and his co-workers sought formulating quantum Turing machines2,3 and quantum complexity theory4. Recently, considerable progress has been achieved in the latter line of approach where quantum computers were shown to be qualitatively much stronger than classical ones, culminating in Shor’s discovery of quantum polynomial time algorithms for factoring and discrete logarithm5. This has led several-physicist groups to make attempts to. implement quantum computers by using trapped ions6,7, quantum dots, nuclear spins using multiple pulse resonance techniques8 and so on. Appreciation of the power of quantum computing was quickly tempered by the realization that preserving quantum coherence made the implementation of practical quantum computers unlikely within decades.

Suggested Citation

  • Shozo Takeno & Hideaki Matsueda, 1999. "Atomic Operator Formalism of Elementary Gates for Quantum Computation and Impurity-Induced Exciton Quantum Gates," Springer Books, in: Ludmila A. Uvarova & Arkadii E. Arinstein & Anatolii V. Latyshev (ed.), Mathematical Models of Non-Linear Excitations, Transfer, Dynamics, and Control in Condensed Systems and Other Media, pages 195-204, Springer.
    • Handle: RePEc:spr:sprchp:978-1-4615-4799-0_17
    DOI: 10.1007/978-1-4615-4799-0_17
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-1-4615-4799-0_17. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.