What I really want to discuss in this talk is hypothesis testing in quantum information theory. I will mostly restrict myself to the case of two simple hypotheses, each of which is represented by a quantum state (density matrix). The plan is to first review the basics and the difficulties of quantum hypothesis testing, covering both one-shot (Neyman- Pearson-Helstrom) and asymptotic (Stein, Chernoff) settings. Furthermore, I will indicate some applications in quantum Shannon theory, from coding theorems to strong converses and finite block-length analysis.
The main focus of the talk, however, will be on the peculiarity of quantum mechanics that we need to specify a measurement to learn about the quantum state, and that these measurements are often subject to physically motivated restrictions. Thus, a tension arises between a 'strong' set of measurements (decision rules) with a 'weak' set, i.e. all theoretically allowed measurements vs the restricted ones. This is actually a phenomenon arising generically in statistics; the classical analogue would be secret sharing, in which two perfectly distinguishable multi-partite hypotheses appear to be indistinguishable when accessing only a marginal. The quantum versions are richer in that, for instance, local operations and classical communication (LOCC) allow for state tomography, so the states cannot become perfectly indistinguishable but only nearly so, and hence the question is one of efficiency. We will focus on a couple of concrete examples and associated sets of ideas, including open problems:
1. Local operation and classical communication (LOCC): I will show simple arguments to bound the minimum bias of any LOCC test in a bipartite setting of two d-dimensional systems, some of which can even be extended to probabilistic theories beyond quantum mechanics. While these results are in the one-shot setting, in certain cases we also have a good understanding of the asymptotic case (Chernoff exponent).
2. Gaussian operations and classical computation (GOCC): These are motivated by the so-called linear optics describing most of quantum optics, but which cannot distinguish optimally even two coherent states of a single mode of light. Recently, we found states which are almost perfectly distinguishable by suitable measurements, but when restricted to GOCC, i.e. linear optics and post-processing, the states appear almost identical. The construction is probabilistic and relies on coding arguments; one of its interesting features is that the states can be prepared by GOCC, though as we show, they cannot be distinguished by GOCC. Open questions include whether one can give a constructive version of the argument, and whether even thermal states can be used, and how efficient the hiding is.
3. Returning to LOCC: It was known for a while that, asymptotically, n bits can be hidden in a bipartite system of n qubits each. Only recently it was shown that this is asymptotically optimal, by using the calculus of min-entropies. This is reminiscent of the fact that in secret sharing, each relevant share has to be at least as large as the hidden message. Indeed, we get bounds on the so-called data hiding capacity of any preparation system; these are, however, not always tight. While it is known that data hiding by separable states is possible (i.e., the state preparation can be done by LOCC), it is open whether the optimal information efficiency of one bit per local qubit can be achieved by separable hiding states.
camera iphone 8 plus apk ISIT 2017 | Andreas Winter | Reading and Hiding Data in Quantum Systems | 2017-06-26 | |
| 6 Likes | 6 Dislikes |
| 527 views views | 165 followers |
| Education | Upload TimePublished on 4 Jul 2017 |
Related keywords
camera iphone x vs xr,video phone beyonce mp3,video phone commax,camera phone ranking,free robux,video phone letra,upload to imgur,free ringtones,freedom mortgage,video phone number,camera phone x - os 12 camera apk,sharing amazon prime,sharingan eyes,sharing shelf,video phone é a continuação de telephone,upload speed,sharing community,camera iphone 7 plus,camera iphone x apk,camera iphone apk,free dating sites,sharing is caring,free stock photos,uploadvr,upload photos to icloud,camera iphone 7 vs iphone 8,free music,upload video to youtube,upload speed test,upload photo,video phone ft lady gaga,freep,video phone beyonce,sharingan naruto,upload download speed,video phone extended remix,video phone call,sharingbox,upload youtube,upload to google drive,freeform,camera iphone xr vs xs,camera iphone,camera phone comparison,sharing economy,sharing is caring meme,upload resume to linkedin,sharing wifi password,sharing kindle books,sharing community yonkers,app video iphone,free vpn,sharing wifi iphone,camera iphone 8 plus,camera iphone xr,camera iphone x,free fonts,video phone screen,upload music to spotify,upload pictures,free people,free online games,free movies online,video phone wikipedia,sharing outlook calendar,sharing network 5k,freecell,video phone gaga,video phone beyonce lyrics,upload soundcloud,freebirds,video phone beyonce letra,upload pdf to kindle,free movies,camera phone x apk,upload studio,freestyle libre,sharing network,sharingan contacts,camera iphone 8,upload image,video phone lyrics,upload to instagram from pc,upload file,camera iphone 7,camera iphone 6,free games,camera phone x,video phone tradução,camera phone 2019,sharing google calendar,video phone lady gaga,video phone feat lady gaga,upload video,sharingan,sharingan tattoo,video phone beyonce lady gaga,free credit report,free credit score,
Không có nhận xét nào:
Đăng nhận xét