Quantum machine language and quantum computation with Josephson junctions

Simple item page
dc.creatorChatzisavvas, K. Ch.
dc.creatorDaskaloyannis, C.
dc.creatorPanos, C. P.
dc.date2001-09-20
dc.date.accessioned2026-07-07T06:02:43Z
dc.date.available2026-07-07T06:02:43Z
dc.descriptionAn 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.
dc.description11 pages + 2 eps figure files, RevTeX4
dc.identifierhttps://arxiv.org/abs/quant-ph/0109098
dc.identifierhttp://arxiv.org/abs/quant-ph/0109098
dc.identifierQuantum 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)
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/89711
dc.subjectQuantum Physics
dc.subjectCondensed Matter
dc.titleQuantum machine language and quantum computation with Josephson junctions
dc.typetext

Files

Collections

arXiv