English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The framework of postselection is becoming more and more important in variousrecent directions in Quantum Computation research. Postselection renders simplecomputational models able to perform general quantum computation. This wasfirst observed for the linear optics model [E. Knill, R. Laflamme, G. J.Milburn, Nature 409, 46 (2001)], and has since provided us with many near-termcandidates for the quantum advantage, commuting computations [M. J. Bremner, R.Jozsa, D. J. Shepherd, Proc. R. Soc. A 467, 459 (2011)] being the first. Tofacilitate the discussion of errors in the presence of postselection, we defineand characterize trace-induced distance and diamond distance of postselectedcomputations. We show counterexamples to simple properties that one wouldexpect of any distance measure; the properties of convexity (when consideringonly the pure-state inputs would suffice), contractivity, and subadditivity oferrors. On the positive side, we prove that certain weaker versions ofcontractivity and subadditivity and a number of other properties are preservedin the postselected setting. We achieve this via a "conversion lemma" thattranslates any inequality from the standard to the postselected setting.

Notes on distinguishability of postselected computations