Characterization of quantum computable decision problems by state discrimination

Simple item page
dc.creatorSvozil, Karl
dc.date2005-05-17
dc.date2006-03-13
dc.date.accessioned2026-07-07T06:40:59Z
dc.date.available2026-07-07T06:40:59Z
dc.descriptionOne 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.
dc.description9 pages
dc.identifierhttps://arxiv.org/abs/quant-ph/0505129
dc.identifierhttp://arxiv.org/abs/quant-ph/0505129
dc.identifierAIP Conference Proceedings 810. Quantum Theory. Reconsideration of Foundations--3, ed. by Guillaume Adenier, Andrei Yu. Khrennikov and Theo M. Nieuwenhuizen (American Institute of Physics, Melville, NY, 2006), pp. 271-279
dc.identifierdoi:10.1063/1.2158729
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/101552
dc.subjectQuantum Physics
dc.titleCharacterization of quantum computable decision problems by state discrimination
dc.typetext

Files

Collections

arXiv