Schmidt decomposition for quantum entanglement in quantum algorithms

被引：1

作者：

Oshima, Kazuto ^{[1
]}

机构：

[1] Gunma Natl Coll Technol, Maebashi, Gunma 3718530, Japan

来源：

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES | 2007年 / E90A卷 / 05期

关键词：

Schmidt decomposition; quantum entanglement; quantum algorithm; quantum computation;

D O I：

10.1093/ietfec/e90-a.5.1012

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

We study quantum entanglement by Schmidt decomposition for some typical quantum algorithms. In the Shot's exponentially fast algorithm the quantum entanglement holds almost maximal, which is a major factor that a classical computer is not adequate to simulate quantum efficient algorithms.

引用

页码：1012 / 1013

页数：2

共 7 条

[1] UNIVERSALITY IN QUANTUM COMPUTATION
DEUTSCH, D
BARENCO, A
EKERT, A
[J]. PROCEEDINGS OF THE ROYAL SOCIETY-MATHEMATICAL AND PHYSICAL SCIENCES, 1995, 449 (1937): : 669 - 677
[2] RAPID SOLUTION OF PROBLEMS BY QUANTUM COMPUTATION
DEUTSCH, D
JOZSA, R
[J]. PROCEEDINGS OF THE ROYAL SOCIETY OF LONDON SERIES A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES, 1992, 439 (1907): : 553 - 558
[3] Grover L. K., 1996, P 28 ANN ACM S THEOR, P212, DOI [DOI 10.1145/237814.237866, 10.1145/237814.237866]
[4] Nielsen MA, 2000, Quantum Computation and Quantum Information
[5] SHOR PW, 1994, AN S FDN CO, P124
[6] Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, PW
[J]. SIAM REVIEW, 1999, 41 (02) : 303 - 332
[7] VIDRAL G, 2003, PHYS REV LETT, V91

← 1 →