Quantum Computing based on Tensor Products ... - Cinvestav
Quantum Computing based on Tensor Products ... - Cinvestav
Quantum Computing based on Tensor Products ... - Cinvestav
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
An interesting questi<strong>on</strong> is whether an exact algorithm can be obtained with<br />
logarithmic complexity.<br />
The following theorem excludes the possibility to communicate more than<br />
k (classical) bits of informati<strong>on</strong> by transmitting k qubits.<br />
Holevo’s Theorem<br />
The informati<strong>on</strong> quantity recovered from a register of qubits is upperly<br />
bounded by the value of v<strong>on</strong> Neumann’s entropy, which is bounded by<br />
Shann<strong>on</strong>’s entropy. Both entropies coincide whenever the qubits are<br />
pairwise orthog<strong>on</strong>al.<br />
However, in <str<strong>on</strong>g>Quantum</str<strong>on</strong>g> <str<strong>on</strong>g>Computing</str<strong>on</strong>g> the use of the noti<strong>on</strong> of entangled states<br />
improves the communicati<strong>on</strong> complexities of several procedures.<br />
Morales-Luna (CINVESTAV) QC <str<strong>on</strong>g>based</str<strong>on</strong>g> <strong>on</strong> <strong>Tensor</strong> <strong>Products</strong> 5-th Int. WS App. Cat. Th. 36 / 38
Change language