A Hamiltonian for quantum copying
From MaRDI portal
Publication:1968158
DOI10.1016/S0375-9601(96)00939-5zbMath0962.81504arXivquant-ph/9609018OpenAlexW3122402413MaRDI QIDQ1968158
Vladimir Privman, Dima Mozyrsky, Mark Hillery
Publication date: 7 March 2000
Published in: Physics Letters. A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/9609018
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum mechanical Hamiltonian models of Turing machines
- Radix-\(r>2\) quantum computation
- Quantum computing and quadratically signed weight enumerators
- Quantum computing with spin qubits in semiconductor structures
- Experimental quantum cryptography.
- Quantum Computation
- Quantum Computers, Factoring, and Decoherence
- Design of Gates for Quantum Computation: The NOT Gate
- On the Power of Quantum Computation
- Quantum Cryptography with Photon Pairs
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
- Demonstration of a Fundamental Quantum Logic Gate
- New trends in quantum computing
- Universality in quantum computation
- A universal two-bit gate for quantum computation
- A single quantum cannot be cloned
This page was built for publication: A Hamiltonian for quantum copying
