|
| related topics |
| {states, state, optimal} |
| {algorithm, log, probability} |
| {qubit, qubits, gate} |
| {time, systems, information} |
| {vol, operators, histories} |
| {state, phys, rev} |
|
Impossibility of comparing and sorting quantum states
A. John Arul
abstract: Is there any point of principle that prohibits us from doing one or more
forms of quantum information processing? It is now well known that an unknown
quantum state can neither be copied nor deleted perfectly. Given a set of
states which are not necessarily orthogonal, is it possible to compare any two
states from the set, given some reasonable ordering of such states? Is it
possible to sort them in some specific order? In the context of quantum
computation, it is shown here that there is no quantum circuit implementing a
unitary transformation, for comparing and sorting an unrestricted set of
quantum states.
- oai_identifier:
- oai:arXiv.org:quant-ph/0107085
- categories:
- quant-ph
- comments:
- 2 pages, no figures
- arxiv_id:
- quant-ph/0107085
- report_no:
- igc\qc\0701-01
- created:
- 2001-07-17
Full article ▸
|
|
| related documents |
| 9806011v1 |
| 9801005v1 |
| 0612123v2 |
| 0307132v1 |
| 9907101v1 |
| 0406077v1 |
| 0701079v1 |
| 0501093v1 |
| 0407120v1 |
| 0406104v1 |
| 9704025v1 |
| 0205195v1 |
| 9911056v1 |
| 0507194v1 |
| 0612033v1 |
| 0105014v2 |
| 0606242v3 |
| 0507024v1 |
| 0005087v2 |
| 0502144v1 |
| 0209139v1 |
| 0104007v2 |
| 0002009v1 |
| 9908090v3 |
| 0406146v1 |
|