Pith. sign in

REVIEW

Communication Capacity of Quantum Computation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv quant-ph/0003072 v1 pith:S2E5S2AB submitted 2000-03-17 quant-ph

Communication Capacity of Quantum Computation

classification quant-ph
keywords quantumcommunicationcapacitycomputationefficiencyalgorithmsallowsbounds
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

By considering quantum computation as a communication process, we relate its efficiency to a communication capacity. This formalism allows us to rederive lower bounds on the complexity of search algorithms. It also enables us to link the mixedness of a quantum computer to its efficiency. We discuss the implications of our results for quantum measurement.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.