We present a simple implementation of quantum teleportation in terms of primitive operations in quantum computation.
Quantum computation as a dynamical process
β Scribed by G.P. Berman; G.D. Doolen; V.I. Tsifrinovich
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 83 KB
- Volume
- 127
- Category
- Article
- ISSN
- 0010-4655
No coin nor oath required. For personal study only.
β¦ Synopsis
We discuss the dynamical issues of quantum computation. We demonstrate that fast wave function oscillations can affect the performance of Shor's quantum algorithm by destroying the required quantum interference. We also show that this destructive effect can be routinely avoided by using resonant-pulse techniques. We discuss the dynamics of resonant pulse implementations of quantum logic gates in Ising spin systems. We also discuss the influence of non-resonant excitations. We calculate the range of parameters where undesirable non-resonant effects can be minimized. Finally, we describe the "2Οk-method" which avoids the detrimental deflection of non-resonant qubits.
π SIMILAR VOLUMES
w Ε½ . x Recently, Sinha and Ditto Phys. Rev. Lett. 81 1998 2156 demonstrated the computational possibilities of an array of coupled maps. We generalize this nonlinear dynamical system to improve its computational usefulness. We then consider a second nonlinear system, a parameterized map, and use i
A practically useful quantum computer would be a large quantum network ready to support a universal set of unitary transformations. By these transformations one would generate quantum states at will out of the zero-entropy ground-state, the state of initialization. To what extent this will ever be p