Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1304.4506 · Quantum Information Processing

Lower bound of quantum uncertainty from extractable classical information

Tanumoy Pramanik, Shiladitya Mal, A. S. Majumdar

Published Nov 26, 2015• 45 citations
arXivHTMLPDF
DOI
10.1007/s11128-015-1187-6

Related papers

The role of quantum discord in reduction of the lower bound of entropic uncertainty relation in presence of quantum memory

Tanumoy Pramanik, Shiladitya Mal

The uncertainty of measurement on a quantum system can be reduced in presence of quantum memory [M. Berta et. al. Nature Phys. {\bf 6}, 659 (2010)]. By measurement on quantum memory, some information (non-classical information) is inaccessible, hence, it limits the lower bound of entropic uncertainty relation. In the present work, we improve the lower bound of entropic uncertainty relation in presence of quantum memory by considering inaccessibility of non classical correlation at Bob side and also compare the lower bound given by M. Berta et. al. and our prescription for two different kind of shared bipartite state.

arXiv:1202.0939•Feb 5, 2012•0 citations

Quantum information distance based on classical descriptions

Songsong Dai

Quantum Machine Intelligence•Mar 21, 2022•1 citation

Quantum versus classical uncertainty

Shunlong Luo

Theoretical and Mathematical Physics•May 1, 2005•149 citations

Reducing the entropic uncertainty lower bound in the presence of quantum memory via LOCC

Farzin Adabi, Soroush Haseli, S. Salimi

The uncertainty principle sets a lower bound on the uncertainties of two incompatible observables measured on a particle. The uncertainty lower bound can be reduced by considering a particle as a quantum memory entangled with the measured particle. In this paper, we consider a tripartite scenario in which a quantum state has been shared among Alice, Bob, and Charlie. The aim of Bob and Charlie is to minimize Charlie's lower bound about Alice's measurement outcomes. To this aim, they concentrate their correlation with Alice in Charlie's side via a cooperative strategy based on local operations and classical communication. We obtain a lower bound for Charlie's uncertainty about Alice's measurement outcomes after concentrating information and compare it with the lower bound without concentrating information in some examples. We also provide a physical interpretation of the entropic uncertainty lower bound based on the dense coding capacity.

arXiv:1606.06027•Europhysics Letters (EPL)•Sep 1, 2016•39 citations

Key Rate Available from Mismatched Measurements in the BB84 Protocol and the Uncertainty Principle

Ryutaroh Matsumoto, Shun Watanabe

We consider the mismatched measurements in the BB84 quantum key distribution protocol, in which measuring bases are different from transmitting bases. We give a lower bound on the amount of a secret key that can be extracted from the mismatched measurements. Our lower bound shows that we can extract a secret key from the mismatched measurements with certain quantum channels, such as the channel over which the Hadamard matrix is applied to each qubit with high probability. Moreover, the entropic uncertainty principle implies that one cannot extract the secret key from both matched measurements and mismatched ones simultaneously, when we use the standard information reconciliation and privacy amplification procedure.

arXiv:0711.1731•IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Oct 1, 2008•14 citations

Quantum Information Theory and Uncertainty Relation

Kenjiro Yanagi

IEICE Technical Report; IEICE Tech. Rep.•Nov 19, 2019•0 citations
The uncertainty of measurement on a quantum system can be reduced in presence of quantum memory [M. Berta et. al. Nature Phys. {\bf 6}, 659 (2010)]. By measurement on quantum memory, some information (non-classical information) is inaccessible, hence, it limits the lower bound of entropic uncertainty relation. In the present work, we improve the lower bound of entropic uncertainty relation in presence of quantum memory by considering inaccessibility of non classical correlation at Bob side and also compare the lower bound given by M. Berta et. al. and our prescription for two different kind of shared bipartite state.
The uncertainty principle sets a lower bound on the uncertainties of two incompatible observables measured on a particle. The uncertainty lower bound can be reduced by considering a particle as a quantum memory entangled with the measured particle. In this paper, we consider a tripartite scenario in which a quantum state has been shared among Alice, Bob, and Charlie. The aim of Bob and Charlie is to minimize Charlie's lower bound about Alice's measurement outcomes. To this aim, they concentrate their correlation with Alice in Charlie's side via a cooperative strategy based on local operations and classical communication. We obtain a lower bound for Charlie's uncertainty about Alice's measurement outcomes after concentrating information and compare it with the lower bound without concentrating information in some examples. We also provide a physical interpretation of the entropic uncertainty lower bound based on the dense coding capacity.
We consider the mismatched measurements in the BB84 quantum key distribution protocol, in which measuring bases are different from transmitting bases. We give a lower bound on the amount of a secret key that can be extracted from the mismatched measurements. Our lower bound shows that we can extract a secret key from the mismatched measurements with certain quantum channels, such as the channel over which the Hadamard matrix is applied to each qubit with high probability. Moreover, the entropic uncertainty principle implies that one cannot extract the secret key from both matched measurements and mismatched ones simultaneously, when we use the standard information reconciliation and privacy amplification procedure.