Abstract: We derive an explicit Hamiltonian for copying the basis up and down states of a quantum two-state system - a qubit - onto n "copy" qubits initially all prepared in the down state. In terms of spin components, for spin-1/2 particle spin states, the resulting Hamiltonian involves n- and (n+1)-spin interactions. The case n=1 also corresponds to a quantum-computing controlled-NOT gate.
Recommendations
Cites work
- scientific article; zbMATH DE number 3898247 (Why is no real title available?)
- scientific article; zbMATH DE number 5269176 (Why is no real title available?)
- A single quantum cannot be cloned
- A universal two-bit gate for quantum computation
- Demonstration of a Fundamental Quantum Logic Gate
- Design of gates for quantum computation: the NOT gate
- Experimental quantum cryptography.
- New trends in quantum computing
- On the Power of Quantum Computation
- Quantum Cryptography with Photon Pairs
- Quantum communication in a quantum network
- Quantum computation
- Quantum computers, factoring, and decoherence
- Quantum computing and quadratically signed weight enumerators
- Quantum computing with spin qubits in semiconductor structures
- Quantum mechanical Hamiltonian models of Turing machines
- Radix-\(r>2\) quantum computation
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
- Universality in quantum computation
Cited in
(3)
This page was built for publication: A Hamiltonian for quantum copying
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1968158)
