Editing
Asymmetric Universal 1-2 Cloning
(section)
Jump to navigation
Jump to search
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
This protocol achieves the functionality of [[Quantum Cloning]]. Asymmetric universal cloning refers to a quantum cloning machine (QCM) where its output clones are not the same or in other words, they have different [[fidelities]]. Here we focus on <math>1 \rightarrow 1 + 1</math> universal cloning. In asymmetric cloning, we try to distribute information unequally among the copies. A trade-off relation exists between the fidelities, meaning if one of the copies are very close to the original state, the other one will be far from it. There are two approaches to this kind of cloning, both leading to same trade-off relation. Here we discuss the quantum circuit approach (Buzek et al., 1997) It can be also noted that the symmetric universal <math>1 \rightarrow 2</math> cloning can be considered as a special case of the asymmetric universal cloning where the information between copies has been equally distributed. '''Tags:''' [[Category: Building Blocks]][[:Category: Building Blocks|Building Blocks]], [[Quantum Cloning]], Universal Cloning, asymmetric cloning, copying quantum states, [[:Category: Quantum Functionality|Quantum Functionality]][[Category: Quantum Functionality]], [[:Category:Specific Task|Specific Task]][[Category:Specific Task]],symmetric or [[Optimal Universal N-M Cloning|Optimal or Symmetric Cloning]], [[Probabilistic Cloning]]
Summary:
Please note that all contributions to Quantum Protocol Zoo may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
Quantum Protocol Zoo:Copyrights
for details).
Do not submit copyrighted work without permission!
To protect the wiki against automated edit spam, we kindly ask you to solve the following CAPTCHA:
Cancel
Editing help
(opens in new window)
Navigation menu
Personal tools
Not logged in
Talk
Contributions
Log in
Namespaces
Page
Discussion
English
Views
Read
Edit
View history
More
Search
Navigation
Main page
News
Protocol Library
Certification Library
Nodal Subroutines
Codes Repository
Knowledge Graphs
Submissions
Categories
Supplementary Information
Recent Changes
Contact us
Help
Tools
What links here
Related changes
Special pages
Page information