Schmidt Decomposition for Quantum Entanglement in Quantum Algorithms(<Special Section>Discrete Mathematics and Its Applications)
スポンサーリンク
概要
- 論文の詳細を見る
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.
- 一般社団法人電子情報通信学会の論文
- 2007-05-01
著者
-
Oshima Kazuto
Gunma National Coll. Technol. Maebash‐shi Jpn
-
Oshima Kazuto
Gunma College Of Technology
関連論文
- Critical Coupling in (1+1)-Dimensional Light-Front φ^4 Theory : Particles and Fields
- A Simple Procedure for Classical Signal-Processing in Cluster-State Quantum Computation
- Contributions of the Discrete Spectrum of the Maass Laplacians to Super Traces of Laplace Operators on Super Riemann Surfaces
- Schmidt Decomposition for Quantum Entanglement in Quantum Algorithms(Discrete Mathematics and Its Applications)
- Instanton Effects and Witten Complex in Supersymmetric Quantum Mechanics on SO(4) : Particles and fields
- Instability of Gap Equations' Solution in Three-Dimensional O(N) Non-Linear σ Model
- A Complete Set for Maass Laplacians on the Pseudosphere : General and Mathematical Physics
- Spontaneous Symmetry Breaking in (1+1)-Dimensional Light-Frontφ^4 Theory(The Physics of Elementary Particles and Fields)