OPTIMAL UNIVERSAL QUANTUM CLONING: ASYMMETRIES AND FIDELITY MEASURES

被引:0
作者
Kay, Alastair [1 ]
机构
[1] Royal Holloway Univ London, Dept Math, Egham TW20 0EX, Surrey, England
关键词
quantum cloning; optimal cloning; universal cloning; asymmetric cloning; multipartite fidelity measures; INFORMATION;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We study the problem of universal quantum cloning taking several identical copies of a pure but unknown quantum state and producing further copies. While it is well known that it is impossible to perfectly reproduce the state, how well the copies can be cloned can be quantified using the fidelity. We examine how individual fidelities can be traded against each other, and how different fidelity measures can be incorporated. The broadly applicable formalism into which we transform the cloning problem is described as a series of quadratic constraints which are amenable to mathematical and computational scrutiny. As such, we reproduce all known results on optimal universal cloning, and push the recent results on asymmetric cloning much further, giving new trade-off relations between fidelities for broad classes of optimal cloning machines. We also provide substantial evidence that motivates why other parameter ranges (number of input copies) have not, and will not, yield to similar analysis.
引用
收藏
页码:991 / 1028
页数:38
相关论文
共 38 条
[1]   Device-independent security of quantum cryptography against collective attacks [J].
Acin, Antonio ;
Brunner, Nicolas ;
Gisin, Nicolas ;
Massar, Serge ;
Pironio, Stefano ;
Scarani, Valerio .
PHYSICAL REVIEW LETTERS, 2007, 98 (23)
[2]   Any AND-OR formula of size can be evaluated in time on a quantum computer [J].
Ambainis, Andris ;
Childs, Andrew M. ;
Reichardt, Ben W. ;
Spalek, Robert ;
Zhang, Shengyu .
48TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2007, :363-+
[3]  
[Anonymous], 1984, P IEEE INT C COMP, DOI DOI 10.1016/J.TCS.2014.05.025
[4]  
Bacon D, 2007, PROCEEDINGS OF THE EIGHTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P1235
[5]  
Baguette D., 2014, PHYS REV A, V90, DOI DOI 032314
[6]   Stabilization of quantum computations by symmetrization [J].
Barenco, A ;
Berthiaume, A ;
Deutsch, D ;
Ekert, A ;
Jozsa, R ;
Macchiavello, C .
SIAM JOURNAL ON COMPUTING, 1997, 26 (05) :1541-1557
[7]   Reference frames, superselection rules, and quantum information [J].
Bartlett, Stephen D. ;
Rudolph, Terry ;
Spekkens, Robert W. .
REVIEWS OF MODERN PHYSICS, 2007, 79 (02) :555-609
[8]  
Boyd S, 2004, CONVEX OPTIMIZATION
[9]   Optimal universal quantum cloning and state estimation [J].
Bruss, D ;
Ekert, A ;
Macchiavello, C .
PHYSICAL REVIEW LETTERS, 1998, 81 (12) :2598-2601
[10]   Quantum copying: Beyond the no-cloning theorem [J].
Buzek, V ;
Hillery, M .
PHYSICAL REVIEW A, 1996, 54 (03) :1844-1852