TALKING BREATHER QUBITS

2009 ◽  
Vol 23 (20n21) ◽  
pp. 4352-4364
Author(s):  
TOSHIYUKI FUJII ◽  
MUNEHIRO NISHIDA ◽  
SATOSHI TANDA ◽  
NORIYUKI HATAKENAKA

Breather is an elementary excitation regarded as a bound state of a fluxon and an antifluxon in a long Josephson junction. In quantum-mechanical regime, the breather energy is quantized so that the breather can be considered as an artificial moving atom. We propose a new type of fluxon qubit that is constructed by quantum-mechanical superposition of the breather's states. We describe quantum logic gates of breather qubit required for constructing quantum computer. In addition, our qubit can move in the system so that transfer of quntum information is possible between mobile qubits as well as stationary qubits. Our talking qubits support the global information sharing in quantum information networks.

Author(s):  
M. Suhail Zubairy

A remarkable application of quantum mechanical concepts of coherent superposition and quantum entanglement is a quantum computer which can solve certain problems at speeds unbelievably faster than the conventional computer. In this chapter, the basic principles and the conditions for the implementation of the quantum computer are introduced and the limitations imposed by the probabilistic nature of quantum mechanics and the inevitable decoherence phenomenon are discussed. Next the basic building blocks, the quantum logic gates, are introduced. These include the Hadamard, the CNOT, and the quantum phase gates. After these preliminaries, the implementation of the Deutsch algorithm, quantum teleportation, and quantum dense coding in terms of the quantum logic gates are discussed. It is also shown how the Bell states can be produced and measured using a sequence of quantum logic gates.


1999 ◽  
Vol 60 (4) ◽  
pp. 2777-2780 ◽  
Author(s):  
Mark D. Price ◽  
Shyamal S. Somaroo ◽  
Amy E. Dunlop ◽  
Timothy F. Havel ◽  
David G. Cory

2007 ◽  
Vol 85 (6) ◽  
pp. 625-632 ◽  
Author(s):  
D F James ◽  
J Jerke

This paper presents a useful compact formula for deriving an effective Hamiltonian describing the time-averaged dynamics of detuned quantum systems. The formalism also works for ensemble-averaged dynamics of stochastic systems. To illustrate the technique, we give examples involving Raman processes, Bloch-Siegert shifts, and quantum logic gates. PACS Nos: 03.65.–w


2008 ◽  
Vol 06 (supp01) ◽  
pp. 633-638
Author(s):  
M. A. CIRONE ◽  
A. NEGRETTI ◽  
A. RECATI ◽  
T. CALARCO

The realization of quantum logic gates with neutral atoms on atom chips is investigated, including realistic features, such as noise and actual experimental setups.


2003 ◽  
Vol 01 (01) ◽  
pp. 51-77 ◽  
Author(s):  
G. P. BERMAN ◽  
D. I. KAMENEV ◽  
R. B. KASSMAN ◽  
C. PINEDA ◽  
V. I. TSIFRINOVICH

We present protocols for implementation of universal quantum gates on an arbitrary superposition of quantum states in a scalable solid-state Ising spin quantum computer. The spin chain is composed of identical spins 1/2 with the Ising interaction between the neighboring spins. The selective excitations of the spins are provided by the gradient of the external magnetic field. The protocols are built of rectangular radio-frequency pulses. Since the wavelength of the radio-frequency pulses is much larger than the distance between the spins, each pulse affects all spins in the chain and introduces the phase and probability errors, which occur even without the influence of the environment. These errors caused by the unwanted transitions are minimized and computed numerically.


Author(s):  
Ciaran Hughes ◽  
Joshua Isaacson ◽  
Anastasia Perry ◽  
Ranbel F. Sun ◽  
Jessica Turner

AbstractWe have come a long way from Chap. 10.1007/978-3-030-61601-4_1 To recap on what we have learnt, we have understood important quantum mechanical phenomena such as superposition and measurement (through the Stern-Gerlach and Mach-Zehnder experiments). We have also learnt that while quantum computers can in principle break classical encryption protocols, they can also be used to make new secure channels of communication. Furthermore, we have applied quantum logic gates to qubits to perform quantum computations. With entanglement, we teleported the information in an unknown qubit to another qubit. This is quite a substantial achievement.


2012 ◽  
Vol 01 (02) ◽  
pp. 14-31
Author(s):  
APPN Editorial Office

Quantum computing promises to deliver unprecedented effciency by exploiting the laws of quantum mechanics in order to process information in ways fundamentally different from today's classical computers. As recently as a decade ago Raussendorf and Briegel proposed the one-way quantum computer which differs dramatically from the standard model of quantum computation [1]. Whereas the standard model relies on sequences of quantum logic gates that process qubits, the one-way model implements computations as a sequence of measurements on an array of highly entangled states; the so-called cluster state. A cluster state is first created as a generic resource, and the algorithms to be computed are determined by the choice and sequence of measurements, allowing us to imprint a circuit in real time as the flow of information is directed through the cluster.


Author(s):  
Olga Ivancova ◽  
Vladimir Korenkov ◽  
Olga Tyatyushkina ◽  
Sergey Ulyanov ◽  
Toshio Fukuda

Principles and methodologies of quantum algorithmic gate-based design on small quantum computer described. The possibilities of quantum algorithmic gates simulation on classical computers discussed. A new approach to a circuit implementation design of quantum algorithm gates for fast quantum massive parallel computing presented. SW & HW support sophisticated smart toolkit of supercomputing accelerator of quantum algorithm simulation on small quantum programmable computer algorithm gate (that can program in SW to implement arbitrary quantum algorithms by executing any sequence of universal quantum logic gates) described


Sign in / Sign up

Export Citation Format

Share Document