IEICE TRANSACTIONS on Fundamentals
Schmidt Decomposition for Quantum Entanglement in Quantum Algorithms
Summary :
We study quantum entanglement by Schmidt decomposition for some typical quantum algorithms. In the Shor'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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E90-A No.5 pp.1012-1013
- Publication Date
- 2007/05/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1093/ietfec/e90-a.5.1012
- Type of Manuscript
- Special Section LETTER (Special Section on Discrete Mathematics and Its Applications)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Kazuto OSHIMA, "Schmidt Decomposition for Quantum Entanglement in Quantum Algorithms" in IEICE TRANSACTIONS on Fundamentals,
vol. E90-A, no. 5, pp. 1012-1013, May 2007, doi: 10.1093/ietfec/e90-a.5.1012.
Abstract: We study quantum entanglement by Schmidt decomposition for some typical quantum algorithms. In the Shor'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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e90-a.5.1012/_p
Copy
@ARTICLE{e90-a_5_1012,
author={Kazuto OSHIMA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Schmidt Decomposition for Quantum Entanglement in Quantum Algorithms},
year={2007},
volume={E90-A},
number={5},
pages={1012-1013},
abstract={We study quantum entanglement by Schmidt decomposition for some typical quantum algorithms. In the Shor'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.},
keywords={},
doi={10.1093/ietfec/e90-a.5.1012},
ISSN={1745-1337},
month={May},}
Copy
TY - JOUR
TI - Schmidt Decomposition for Quantum Entanglement in Quantum Algorithms
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1012
EP - 1013
AU - Kazuto OSHIMA
PY - 2007
DO - 10.1093/ietfec/e90-a.5.1012
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E90-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2007
AB - We study quantum entanglement by Schmidt decomposition for some typical quantum algorithms. In the Shor'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.
ER -
English
