Physics – Quantum Physics
Scientific paper
2005-11-27
Physics
Quantum Physics
Conjecture 2 revised. Accordingly, protocol became a bit more complicated. Added two more references
Scientific paper
Consider a quantum system with $m$ subsystems with $n$ qubits each, and suppose the state of the system is living in the symmetric subspace. It is known that, in the limit of $m\to\infty$, entanglement between any two subsystems vanishes. In this paper we study asymptotic behavior of the entanglement as $m$ and $n$ grows. Our conjecture is that if $m$ is a polynomially bounded function in $n$, then the entanglement decreases polynomially. The motivation of this study is a study of quantum Merlin-Arthur game. If this conjecture is ture, we can prove that bipartite separable certificate does not increase the computational power of the proof system. protocol. In the paper, we provide two evidences which support the conjecture. First, if $m$ is an exponential function, then entanglement decreases exponentially fast. Second, in case of a maximally entangled state, our conjecture is true.
No associations
LandOfFree
Can entanglement efficiently be weakend by symmetrization? does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Can entanglement efficiently be weakend by symmetrization?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Can entanglement efficiently be weakend by symmetrization? will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-25741