Quantum machine language and quantum computation with Josephson junctions

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

An implementation method of a gate in a quantum computer is studied in terms of a finite number of steps evolving in time according to a finite number of basic Hamiltonians, which are controlled by on-off switches. As a working example, the case of a particular implementation of the two qubit computer employing a simple system of two coupled Josephson junctions is considered. The binary values of the switches together with the time durations of the steps constitute the quantum machine language of the system.
11 pages + 2 eps figure files, RevTeX4

Keywords

Quantum Physics, Condensed Matter

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/89711

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/quant-ph/0109098
 http://arxiv.org/abs/quant-ph/0109098
 Quantum Computers and Computing, v.4, No2, p.93 (2003);Proceedings of the XXII Solvay Conference on Physics-The Physics of Communication, World Scientific Publishing, p.589 (2003)

Collections

arXiv