| | |
| | |
Stat |
Members: 3643 Articles: 2'488'730 Articles rated: 2609
29 March 2024 |
|
| | | |
|
Article overview
| |
|
Quantum Minimal One Way Information: Relative Hardness and Quantum Advantage of Combinatorial Tasks | Harumichi Nishimura
; Tomoyuki Yamakami
; | Date: |
28 Jul 2005 | Subject: | quant-ph | Abstract: | 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. | Source: | arXiv, quant-ph/0507270 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |