{"id":1132,"date":"2018-05-07T12:31:13","date_gmt":"2018-05-07T10:31:13","guid":{"rendered":"https:\/\/webs.uab.cat\/giq\/seminar\/sampling-mixed-quantum-states\/"},"modified":"2018-05-07T12:31:13","modified_gmt":"2018-05-07T10:31:13","slug":"sampling-mixed-quantum-states","status":"publish","type":"seminar","link":"https:\/\/webs.uab.cat\/giq\/seminar\/sampling-mixed-quantum-states\/","title":{"rendered":"Sampling mixed quantum states"},"content":{"rendered":"<p>We investigate sampling procedures that certify that an arbitrary&nbsp;<br \/>\nquantum state on $n$ subsystems is close to an ideal mixed state&nbsp;<br \/>\n$\\varphi^{\\otimes n}$ for a given reference state $\\varphi$, up to&nbsp;<br \/>\nerrors on a few positions. This task makes no sense classically: it&nbsp;<br \/>\nwould correspond to certifying that a given bitstring was generated&nbsp;<br \/>\naccording to some desired probability distribution. However, in the&nbsp;<br \/>\nquantum case, this is possible if one has access to a prover who can&nbsp;<br \/>\nsupply a purification of the mixed state.<\/p>\n<p>In this work, we introduce the concept of mixed-state certification, and&nbsp;<br \/>\nwe show that a natural sampling protocol offers secure certification in&nbsp;<br \/>\nthe presence of a possibly dishonest prover: if the verifier accepts&nbsp;<br \/>\nthen he can be almost certain that the state in question has been&nbsp;<br \/>\ncorrectly prepared, up to a small number of errors.<\/p>\n<p>We then apply this result to two-party quantum coin-tossing. Given that&nbsp;<br \/>\nstrong coin tossing is impossible, it is natural to ask &#8220;how close can&nbsp;<br \/>\nwe get&#8221;. This question has been well studied and is nowadays well&nbsp;<br \/>\nunderstood from the perspective of the bias of individual coin tosses.&nbsp;<br \/>\nWe approach and answer this question from a different&#8212;and somewhat&nbsp;<br \/>\northogonal&#8212;perspective, where we do not look at individual coin tosses&nbsp;<br \/>\nbut at the global entropy instead. We show how two distrusting parties&nbsp;<br \/>\ncan produce a common high-entropy source, where the entropy is an&nbsp;<br \/>\narbitrarily small fraction below the maximum (except with negligible&nbsp;<br \/>\nprobability).<\/p>\n","protected":false},"excerpt":{"rendered":"<p>We investigate sampling procedures that certify that an arbitrary&nbsp; quantum state on $n$ subsystems is close to an ideal mixed state&nbsp; $\\varphi^{\\otimes n}$ for a given reference state $\\varphi$, up to&nbsp; errors on a few positions. This task makes no sense classically: it&nbsp; would correspond to certifying that a given bitstring was generated&nbsp; according to [&hellip;]<\/p>\n","protected":false},"author":20,"featured_media":0,"template":"","class_list":["post-1132","seminar","type-seminar","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/webs.uab.cat\/giq\/wp-json\/wp\/v2\/seminar\/1132","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/webs.uab.cat\/giq\/wp-json\/wp\/v2\/seminar"}],"about":[{"href":"https:\/\/webs.uab.cat\/giq\/wp-json\/wp\/v2\/types\/seminar"}],"author":[{"embeddable":true,"href":"https:\/\/webs.uab.cat\/giq\/wp-json\/wp\/v2\/users\/20"}],"wp:attachment":[{"href":"https:\/\/webs.uab.cat\/giq\/wp-json\/wp\/v2\/media?parent=1132"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}