Characterization of quantum computable decision problems by state discrimination

Details Characterization of quantum computable decision problems by state discrimination Characterization of quantum computable decision problems by state discrimination

2005-05-17

arxiv.org/abs/quant-ph/0505129v2

AIP Conference Proceedings 810. Quantum Theory. Reconsideration of Foundations--3, ed. by Guillaume Adenier, Andrei Yu. Khrenn

Physics

Quantum Physics

9 pages

Scientific paper

10.1063/1.2158729

One advantage of quantum algorithms over classical computation is the possibility to spread out, process, analyse and extract information in multipartite configurations in coherent superpositions of classical states. This will be discussed in terms of quantum state identification problems based on a proper partitioning of mutually orthogonal sets of states. The question arises whether or not it is possible to encode equibalanced decision problems into quantum systems, so that a single invocation of a filter used for state discrimination suffices to obtain the result.

Affiliated with

Also associated with

No associations

Rating

Characterization of quantum computable decision problems by state discrimination 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 Characterization of quantum computable decision problems by state discrimination, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Characterization of quantum computable decision problems by state discrimination will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-600356