Schmidt Decomposition for Quantum Entanglement in Quantum Algorithms

Authors:
Kazuto Oshima
Affiliations:
-
Venue:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Year:
2007

Citing 4
Cited 1

A fast quantum mechanical algorithm for database search

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

SIAM Journal on Computing
Quantum computation and quantum information

Quantum computation and quantum information
Algorithms for quantum computation: discrete logarithms and factoring

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science

Minimum assured fidelity and minimum average fidelity in quantum teleportation of single qubit using non-maximally entangled states

Quantum Information Processing

Quantified Score

Hi-index	0.00

Visualization

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.