相关论文: Guesswork with Quantum Side Information

This paper provides upper and lower bounds on the optimal guessing moments of a random variable taking values on a finite set when side information may be available. These moments quantify the number of guesses required for correctly…

We introduce a way of quantifying how informative a quantum measurement is, starting from a resource-theoretic perspective. This quantifier, which we call the robustness of measurement, describes how much `noise' must be added to a…

We investigate the generic aspects of quantum coherence guided by the concentration of measure phenomenon. We find the average relative entropy of coherence of pure quantum states sampled randomly from the uniform Haar measure and show that…

Quantum state discrimination, alongside its other applications, has recently found use as a tool for witnessing generalised contextuality. In this article, we derive noncontextuality inequalities for both conclusive and inconclusive…

Complex numbers are theoretically proved and experimentally confirmed as necessary in quantum mechanics and quantum information, and a resource theory of imaginarity of quantum states has been established. In this work, we establish a…

Quantum computing algorithms require that the quantum register be initially present in a superposition state. To achieve this, we consider the practical problem of creating a coherent superposition state of several qubits. Owing to…

The usual conjectures of quantum measurements approaches, inspired from the traditional interpretation of Heisenberg's ("uncertainty") relations, are proved as being incorrect. A group of reconsidered conjectures and a corresponding new…

Quantum measurements are not deterministic. For this reason quantum measurements are repeated for a number of shots on identically prepared systems. The uncertainty in each measurement depends on the number of shots and the expected outcome…

The estimation of the guessing probability has paramount importance in quantum cryptographic processes. It can also be used as a witness for nonlocal correlations. In most of the studied scenarios, estimating the guessing probability…

A Massey-like inequality is any useful lower bound on guessing entropy in terms of the computationally scalable Shannon entropy. The asymptotically optimal Massey-like inequality is determined and further refined for finite-support…

The quantification of aleatoric and epistemic uncertainty in terms of conditional entropy and mutual information, respectively, has recently become quite common in machine learning. While the properties of these measures, which are rooted…

We propose a general approach to quantitatively assessing the risk and vulnerability of artificial intelligence (AI) systems to biased decisions. The guiding principle of the proposed approach is that any AI algorithm must outperform a…

The use of imaginary numbers in modelling quantum mechanical systems encompasses the wave-like nature of quantum states. Here we introduce a resource theoretic framework for imaginarity, where the free states are taken to be those with…

A preparation game is a task whereby a player sequentially sends a number of quantum states to a referee, who probes each of them and announces the measurement result. The measurement setting in each round, as well as the final score of the…

From the perspective of resource-theoretic approach, this study explores the quantification of imaginary in quantum physics. We propose a well defined measure of imaginarity, the geometric-like measure of imaginarity. Compared with the…

The recently established resource theory of quantum coherence allows for a quantitative understanding of the superposition principle, with applications reaching from quantum computing to quantum biology. While different quantifiers of…

In a recently introduced coset guessing game, Alice plays against Bob and Charlie, aiming to meet a joint winning condition. Bob and Charlie can only communicate before the game starts to devise a joint strategy. The game we consider begins…

We consider an unknown multivariate function representing a system-such as a complex numerical simulator-taking both deterministic and uncertain inputs. Our objective is to estimate the set of deterministic inputs leading to outputs whose…

Quantum key distribution (QKD) achieves information-theoretic security, without relying on computational assumptions, by distributing quantum states. To establish secret bits, two honest parties exploit key distillation protocols over…

It is a fundamental question that why quantum mechanics uses complex numbers instead of only real numbers. To address this topic, recently, a rigorous resource theory for the imaginarity of quantum states were established, and several…