20.12.2012 Views

Quantum Computing based on Tensor Products ... - Cinvestav

Quantum Computing based on Tensor Products ... - Cinvestav

Quantum Computing based on Tensor Products ... - Cinvestav

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Communicati<strong>on</strong> Complexity<br />

The complexity of a communicati<strong>on</strong> process is determined by the minimum<br />

informati<strong>on</strong> quantity that should be transmitted, in order that the total<br />

informati<strong>on</strong> can be recovered by the receiving part, within a given c<strong>on</strong>text.<br />

Optimal Transmissi<strong>on</strong><br />

Let us assume that three sets X, Y, Z are given and a functi<strong>on</strong><br />

f : X × Y → Z. At some moment, Alice, who is a communicating part,<br />

possesses a point x ∈ X, Bob, who is a sec<strong>on</strong>d part, possesses a point<br />

y ∈ Y and both parts should calculate z = f(x, y), by interchanging the<br />

minimum informati<strong>on</strong> quantity.<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. 34 / 38

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!