Quantum Minimal One Way Information: Relative Hardness and Quantum Advantage of Combinatorial Tasks

Simple item page
dc.creatorNishimura, Harumichi
dc.creatorYamakami, Tomoyuki
dc.date2005-07-28
dc.date.accessioned2026-07-07T06:43:37Z
dc.date.available2026-07-07T06:43:37Z
dc.descriptionTwo-party one-way quantum communication has been extensively studied in the recent literature. We target the size of minimal information that is necessary for a feasible party to finish a given combinatorial task, such as distinction of instances, using one-way communication from another party. This type of complexity measure has been studied under various names: advice complexity, Kolmogorov complexity, distinguishing complexity, and instance complexity. We present a general framework focusing on underlying combinatorial takes to study these complexity measures using quantum information processing. We introduce the key notions of relative hardness and quantum advantage, which provide the foundations for task-based quantum minimal one-way information complexity theory.
dc.description2 pages. This abstract will appear in the Proceedings of the ERATO conference on Quantum Information Science, Tokyo, August 26-30, 2005
dc.identifierhttps://arxiv.org/abs/quant-ph/0507270
dc.identifierhttp://arxiv.org/abs/quant-ph/0507270
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/102483
dc.subjectQuantum Physics
dc.subjectComputational Complexity
dc.titleQuantum Minimal One Way Information: Relative Hardness and Quantum Advantage of Combinatorial Tasks
dc.typetext

Files

Collections

arXiv