اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدGuesswork with Quantum Side Information
49
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
What is the minimum number of guesses needed on average to correctly guess a realization of a random variable? The answer to this question led to the introduction of the notion of a quantity called guesswork by Massey in 1994, which can be viewed as an alternate security criterion to entropy. In this paper, we consider the guesswork in the presence of quantum side information, and show that a general sequential guessing strategy is equivalent to performing a single measurement and choosing a guessing strategy from the outcome. We use this result to deduce entropic one-shot and asymptotic bounds on the guesswork in the presence of quantum side information, and to formulate a semi-definite program (SDP) to calculate the quantity. We evaluate the guesswork for a simple example involving the BB84 states, both numerically and analytically, and prove a continuity result that certifies the security of slightly imperfect key states when the guesswork is used as the security criterion.
قيم البحث
اقرأ أيضاً
The ability to produce random numbers that are unknown to any outside party is crucial for many applications. Device-independent randomness generation (DIRNG) allows new randomness to be provably generated, without needing to trust the devices used f
or the protocol. This provides strong guarantees about the security of the output, but comes at the price of requiring the violation of a Bell inequality to implement. A further challenge is to make the bounds in the security proofs tight enough to allow expansion with contemporary technology. Thus, while randomness has been generated in recent experiments, the amount of randomness consumed in doing so has been too high to certify expansion based on existing theory. Here we present an experiment that demonstrates device-independent randomness expansion (DIRNE), i.e., where the generated randomness surpasses that consumed. By developing a loophole-free Bell test setup with a single photon detection efficiency of around 81% and exploiting a spot-checking protocol, we achieve a net gain of $2.63times10^8$ certified bits with soundness error $5.74times10^{-8}$. The experiment ran for 220 hours corresponding to an average rate of randomness generation of 8202 bits/s. By developing the Entropy Accumulation Theorem (EAT), we established security against quantum adversaries. We anticipate that this work will lead to further improvements that push device-independence towards commercial viability.
In recent proposals for achieving optical super-resolution, variants of the Quantum Fisher Information (QFI) quantify the attainable precision. We find that claims about a strong enhancement of the resolution resulting from coherence effects are ques
tionable because they refer to very small subsets of the data without proper normalization. When the QFI is normalized, accounting for the strength of the signal, there is no advantage of coherent sources over incoherent ones. Our findings have a bearing on further studies of the achievable precision of optical instruments.
Conserved quantities are crucial in quantum physics. Here we discuss a general scenario of Hamiltonians. All the Hamiltonians within this scenario share a common conserved quantity form. For unitary parametrization processes, the characteristic opera
tor of this scenario is analytically provided, as well as the corresponding quantum Fisher information (QFI). As the application of this scenario, we focus on two classes of Hamiltonians: su(2) category and canonical category. Several specific physical systems in these two categories are discussed in detail. Besides, we also calculate an alternative form of QFI in this scenario.
We introduce a novel strategy, based on the use of modular variables, to encode and deterministically process quantum information using states described by continuous variables. Our formalism leads to a general recipe to adapt existing quantum inform
ation protocols, originally formulated for finite dimensional quantum systems, to infinite dimensional systems described by continuous variables. This is achieved by using non unitary and non-gaussian operators, obtained from the superposition of gaussian gates, together with adaptative manipulations in qubit systems defined in infinite dimensional Hilbert spaces. We describe in details the realization of single and two qubit gates and briefly discuss their implementation in a quantum optical set-up.
The article considers the problem of estimating a high-dimensional sparse parameter in the presence of side information that encodes the sparsity structure. We develop a general framework that involves first using an auxiliary sequence to capture the
side information, and then incorporating the auxiliary sequence in inference to reduce the estimation risk. The proposed method, which carries out adaptive SURE-thresholding using side information (ASUS), is shown to have robust performance and enjoy optimality properties. We develop new theories to characterize regimes in which ASUS far outperforms competitive shrinkage estimators, and establish precise conditions under which ASUS is asymptotically optimal. Simulation studies are conducted to show that ASUS substantially improves the performance of existing methods in many settings. The methodology is applied for analysis of data from single cell virology studies and microarray time course experiments.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
