State Discrimination With Post-Measurement Information

DOI10.1109/TIT.2008.928276MaRDI QIDQ3604819zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Manuel A. Ballester, S. Wehner, Andreas Winter

Publication date 24 February 2009

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/quant-ph/0608014

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Quantum measurement theory, state operations, state preparations (81P15) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Abstract: We introduce a new state discrimination problem in which we are given additional information about the state after the measurement, or more generally, after a quantum memory bound applies. In particular, the following special case plays an important role in quantum cryptographic protocols in the bounded storage model: Given a string x encoded in an unknown basis chosen from a set of mutually unbiased bases, you may perform any measurement, but then store at most q qubits of quantum information. Later on, you learn which basis was used. How well can you compute a function f(x) of x, given the initial measurement outcome, the q qubits and the additional basis information? We first show a lower bound on the success probability for any balanced function, and any number of mutually unbiased bases, beating the naive strategy of simply guessing the basis. We then show that for two bases, any Boolean function f(x) can be computed perfectly if you are allowed to store just a single qubit, independent of the number of possible input strings x. However, we show how to construct three bases, such that you need to store all qubits in order to compute f(x) perfectly. We then investigate how much advantage the additional basis information can give for a Boolean function. To this end, we prove optimal bounds for the success probability for the AND and the XOR function for up to three mutually unbiased bases. Our result shows that the gap in success probability can be maximal: without the basis information, you can never do better than guessing the basis, but with this information, you can compute f(x) perfectly. We also exhibit an example where the extra information does not give any advantage at all.

Cited in

(9)

• Distinguishability of quantum states under restricted families of measurements with an application to quantum data hiding
• Qubit state discrimination using post-measurement information
• Quantum algorithm for quantum state discrimination via partial negation and weak measurement
• Entropic uncertainty relations -- a survey
• Two-sided estimates of minimum-error distinguishability of mixed quantum states via generalized Holevo–Curlander bounds
• Weak locking capacity of quantum channels can be much larger than private capacity
• Witnessing incompatibility of quantum channels
• Two-sided bounds on minimum-error quantum measurement, on the reversibility of quantum dynamics, and on maximum overlap using directional iterates
• Metainformation in quantum guessing games

This page was built for publication: State Discrimination With Post-Measurement Information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604819)