Are problems in Quantum Information Theory (un)decidable?

Details Are problems in Quantum Information Theory (un)decidable? Are problems in Quantum Information Theory (un)decidable?

2011-11-23

arxiv.org/abs/1111.5425v1

Physics

Quantum Physics

11 pages

Scientific paper

This note is intended to foster a discussion about the extent to which typical problems arising in quantum information theory are algorithmically decidable (in principle rather than in practice). Various problems in the context of entanglement theory and quantum channels turn out to be decidable via quantifier elimination as long as they admit a compact formulation without quantification over integers. For many asymptotically defined properties which have to hold for all or for one integer N, however, effective procedures seem to be difficult if not impossible to find. We review some of the main tools for (dis)proving decidability and apply them to problems in quantum information theory. We find that questions like "can we overcome fidelity 1/2 w.r.t. a two-qubit singlet state?" easily become undecidable. A closer look at such questions might rule out some of the "single-letter" formulas sought in quantum information theory.

Affiliated with

Also associated with

No associations

Rating

Are problems in Quantum Information Theory (un)decidable? 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 Are problems in Quantum Information Theory (un)decidable?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Are problems in Quantum Information Theory (un)decidable? will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-376907