|
| related topics |
| {vol, operators, histories} |
| {algorithm, log, probability} |
| {qubit, qubits, gate} |
| {time, decoherence, evolution} |
| {measurement, state, measurements} |
| {state, states, entangled} |
| {let, theorem, proof} |
| {classical, space, random} |
| {particle, mechanics, theory} |
| {error, code, errors} |
| {theory, mechanics, state} |
| {spin, pulse, spins} |
| {force, casimir, field} |
| {information, entropy, channel} |
| {time, systems, information} |
| {light, field, probe} |
| {entanglement, phys, rev} |
| {state, algorithm, problem} |
|
Classicality of quantum information processing
David Poulin
abstract: The ultimate goal of the classicality programme is to quantify the amount of
quantumness of certain processes. Here, classicality is studied for a
restricted type of process: quantum information processing (QIP). Under special
conditions, one can force some qubits of a quantum computer into a classical
state without affecting the outcome of the computation. The minimal set of
conditions is described and its structure is studied. Some implications of this
formalism are the increase of noise robustness, a proof of the quantumness of
mixed state quantum computing and a step forward in understanding the very
foundation of QIP.
- oai_identifier:
- oai:arXiv.org:quant-ph/0108102
- categories:
- quant-ph
- comments:
- Minor changes, published in Phys. Rev. A 65, 42319 (2002)
- doi:
- 10.1103/PhysRevA.65.042319
- arxiv_id:
- quant-ph/0108102
- created:
- 2001-08-22
- updated:
- 2002-05-01
Full article ▸
|
|
| related documents |
| 0505180v1 |
| 0409065v5 |
| 0412024v1 |
| 0409052v1 |
| 0311033v1 |
| 0402082v1 |
| 0604091v1 |
| 0403216v1 |
| 0407252v1 |
| 0609166v1 |
| 0609160v1 |
| 0403071v1 |
| 0207108v1 |
| 0303074v1 |
| 0508156v3 |
| 0208112v1 |
| 0209148v1 |
| 0612052v2 |
| 0308016v1 |
| 0206066v1 |
| 0211129v1 |
| 0412083v1 |
| 0605213v2 |
| 0608156v1 |
| 0401067v2 |
|