Communication Capacity of Quantum Computation
classification
🪐 quant-ph
keywords
quantumcommunicationcapacitycomputationefficiencyalgorithmsallowsbounds
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.