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

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

2005-07-28

arxiv.org/abs/quant-ph/0507270v1

Physics

Quantum Physics

2 pages. This abstract will appear in the Proceedings of the ERATO conference on Quantum Information Science, Tokyo, August 26

Scientific paper

Two-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.

Affiliated with

Also associated with

No associations

Rating

Quantum Minimal One Way Information: Relative Hardness and Quantum Advantage of Combinatorial Tasks 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 Quantum Minimal One Way Information: Relative Hardness and Quantum Advantage of Combinatorial Tasks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Minimal One Way Information: Relative Hardness and Quantum Advantage of Combinatorial Tasks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-46961