English
Related papers

Related papers: Guesswork with Quantum Side Information

200 papers

This thesis addresses the interplay between asymptotic hypothesis testing and entropy inequalities in quantum information theory. In the first part of the thesis we focus on hypothesis testing. We consider two main settings; one can either…

Quantum Physics · Physics 2018-12-14 Christoph Hirche

We use a novel form of quantum conditional probability to define new measures of quantum information in a dynamical context. We explore relationships between our new quantities and standard measures of quantum information, such as von…

Quantum Physics · Physics 2022-12-09 Jacob A. Barandes , David Kagan

Harnessing quantum processes is an efficient method to generate truly indeterministic random numbers, which are of fundamental importance for cryptographic protocols, security applications or Monte-Carlo simulations. Recently, quantum…

Quantum Physics · Physics 2019-11-14 Johannes Thewes , Carolin Lüders , Marc Aßmann

We propose an operational measure of information leakage in a non-stochastic setting to formalize privacy against a brute-force guessing adversary. We use uncertain variables, non-probabilistic counterparts of random variables, to construct…

Information Theory · Computer Science 2021-01-29 Farhad Farokhi , Ni Ding

Quantum measurements under realistic conditions reveal only partial information about a system. Yet, by performing sequential measurements on the same system, additional information can be accessed. We investigate this problem in the…

Quantum Physics · Physics 2025-10-23 Carles Roch I Carceller , Hanwool Lee , Jonatan Bohr Brask , Kieran Flatt , Joonwoo Bae

For many-particle systems, quantum information in base n can be defined by partitioning the set of states according to the outcomes of n-ary (joint) observables. Thereby, k particles can carry k nits. With regards to the randomness of…

Quantum Physics · Physics 2015-06-26 Karl Svozil

We imagine an experiment on an unknown quantum mechanical system in which the system is prepared in various ways and a range of measurements are performed. For each measurement M and preparation rho the experimenter can determine, given…

Quantum Physics · Physics 2009-01-20 Stephanie Wehner , Matthias Christandl , Andrew C. Doherty

Indeterminacy associated with probing of a quantum state is commonly expressed through spectral distances (metric) featured in the outcomes of repeated experiments. Here we express it as an effective amount (measure) of distinct outcomes…

Quantum Physics · Physics 2021-09-21 Ivan Horváth

The problem of mismatched guesswork considers the additional cost incurred by using a guessing function which is optimal for a distribution $q$ when the random variable to be guessed is actually distributed according to a different…

Information Theory · Computer Science 2023-05-09 Alexander Mariona , Homa Esfahanizadeh , Rafael G. L. D'Oliveira , Muriel Médard

Some quantum algorithms have "quantum speedups": improved time complexity as compared with the best-known classical algorithms for solving the same tasks. Can we understand what fuels these speedups from an entropic perspective? Information…

Quantum Physics · Physics 2024-11-07 Jason Pollack , Dylan VanAllen

The problem of guessing subject to distortion is considered, and the performance of randomized guessing strategies is investigated. A one-shot achievability bound on the guessing moment (i.e., moment of the number of required queries) is…

Information Theory · Computer Science 2021-05-27 Shigeaki Kuzuoka

Although quantum key distribution is regarded as promising secure communication, security of Y00 protocol proposed by Yuen in 2000 for the affinity to conventional optical communication is not well-understood yet; its security has been…

Quantum Physics · Physics 2018-12-13 Takehisa Iwakoshi

We devise a simple modification that essentially doubles the efficiency of the BB84 quantum key distribution scheme proposed by Bennett and Brassard. We also prove the security of our modified scheme against the most general eavesdropping…

Quantum Physics · Physics 2016-09-08 Hoi-Kwong Lo , H. F. Chau , M. Ardehali

We propose to apply the notion of the Schmidt number in order to show that a quantum memory or gate process is capable of maintaining a genuine multi-level quantum coherence. We present a simple criterion in terms of an average gate…

Quantum Physics · Physics 2012-02-03 Ryo Namiki , Yuuki Tokunaga

We study the average skew information-based coherence for both random pure and mixed states. The explicit formulae of the average skew information-based coherence are derived and shown to be the functions of the dimension N of the state…

Quantum Physics · Physics 2021-01-20 Zhaoqi Wu , Lin Zhang , Shao-Ming Fei , Xianqing Li-Jost

Distributed source simulation is the task where two (or more) parties share some correlated randomness and use local operations and no communication to convert this into some target correlation. Wyner's seminal result showed that…

Quantum Physics · Physics 2025-12-09 Ian George , Min-Hsiu Hsieh , Eric Chitambar

To guarantee the security of uniform random numbers generated by a quantum random number generator, we study secure extraction of uniform random numbers when the environment of a given quantum state is controlled by the third party, the…

Quantum Physics · Physics 2018-01-10 Masahito Hayashi , Huangjun Zhu

Every quantum state can be represented as a probability distribution over the outcomes of an informationally complete measurement. But not all probability distributions correspond to quantum states. Quantum state space may thus be thought…

Quantum Physics · Physics 2011-02-14 D. M. Appleby , Asa Ericsson , Christopher A. Fuchs

When simulating a complex stochastic system, the behavior of output response depends on input parameters estimated from finite real-world data, and the finiteness of data brings input uncertainty into the system. The quantification of the…

Risk Management · Quantitative Finance 2017-12-20 Helin Zhu , Tianyi Liu , Enlu Zhou

Given a collection of strings, each with an associated probability of occurrence, the guesswork of each of them is their position in a list ordered from most likely to least likely, breaking ties arbitrarily. Guesswork is central to several…

Information Theory · Computer Science 2019-08-12 Ahmad Beirami , Robert Calderbank , Mark Christiansen , Ken Duffy , Muriel Médard
‹ Prev 1 4 5 6 7 8 10 Next ›