A Hamiltonian for quantum copying
From MaRDI portal
DOI10.1016/S0375-9601(96)00939-5zbMATH Open0962.81504arXivquant-ph/9609018OpenAlexW3122402413MaRDI QIDQ1968158FDOQ1968158
Authors: Dima Mozyrsky, Vladimir Privman, Mark Hillery 
Publication date: 7 March 2000
Published in: Physics Letters. A (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/quant-ph/9609018
Recommendations
Cites Work
- Demonstration of a Fundamental Quantum Logic Gate
- Quantum computation
- A single quantum cannot be cloned
- Experimental quantum cryptography.
- Quantum computers, factoring, and decoherence
- On the Power of Quantum Computation
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
- A universal two-bit gate for quantum computation
- Quantum mechanical Hamiltonian models of Turing machines
- Quantum communication in a quantum network
- Quantum computing and quadratically signed weight enumerators
- Title not available (Why is that?)
- Universality in quantum computation
- Radix-\(r>2\) quantum computation
- New trends in quantum computing
- Quantum computing with spin qubits in semiconductor structures
- Design of gates for quantum computation: the NOT gate
- Quantum Cryptography with Photon Pairs
- Title not available (Why is that?)
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)
