DocumentCode
2867964
Title
Calculation of Quantum Entanglement
Author
Yu, Jingshui ; Xu, Wenbo
Author_Institution
Sch. of IoT Engieering, Jiangnan Univ., Wuxi, China
fYear
2011
fDate
14-17 Oct. 2011
Firstpage
87
Lastpage
91
Abstract
Quantum entanglement which is used as the basis for such applications as quantum cryptography, quantum teleportation, and quantum computing, is a multifaceted property that has attracted much attention. The calculation of quantum entanglement therefore has become important. But the calculation of entanglement has become much more complex as systems that use entanglement have evolved. Based on the relative entropy of entanglement, a general method was developed for the calculation of entanglement for n-qubit or n-qudit system, which using an optimization algorithm technique such as genetic algorithm or Quantum-behaved Particle Swarm Optimization. The method using different optimization algorithm was tested on a two qubit system, for which there are some known points, and compared to exact calculations using the entanglement of formation and with each other. Advantages and disadvantages of the method are discussed and directions of future research are exposed.
Keywords
particle swarm optimisation; quantum computing; entanglement entropy; n-qubit system; n-qudit system; optimization algorithm; particle swarm optimization; quantum computing; quantum cryptography; quantum entanglement calculation; quantum teleportation; Correlation; Entropy; Genetic algorithms; Optimization; Particle swarm optimization; Quantum entanglement; White noise; Calculation; Genetic Algorithm; Measure; Quantum Entanglement; Quantum-behaved Particle Swarm Optimization(QPSO) Algorithm; The Relative Entropy Of Entanglement;
fLanguage
English
Publisher
ieee
Conference_Titel
Distributed Computing and Applications to Business, Engineering and Science (DCABES), 2011 Tenth International Symposium on
Conference_Location
Wuxi
Print_ISBN
978-1-4577-0327-0
Type
conf
DOI
10.1109/DCABES.2011.27
Filename
6119025
Link To Document