Related papers: Best conventional solutions to the King's Problem
Conventional solutions to the (Mean) King's problem without using entanglement have been investigated by Aravind [P. K. Aravind, ``Best conventional solutions to the King's problem'', Z. Naturforsch. 58a, 682 (2003)]. We report that the…
The mean king problem is a quantum mechanical retrodiction problem, in which Alice has to name the outcome of an ideal measurement on a d-dimensional quantum system, made in one of (d+1) orthonormal bases, unknown to Alice at the time of…
Mean king's problem is a kind of quantum state discrimination problems. In the problem, we try to discriminate eigenstates of noncommutative observables with the help of classical delayed information. The problem has been investigated from…
In quantum theory, the retrodiction problem is not as clear as its classical counterpart because of the uncertainty principle of quantum mechanics. In classical physics, the measurement outcomes of the present state can be used directly for…
The mean King problem is a conditional retrodiction problem. In this problem Alice prepares a two prime-dimensional particles state and avails one of the particles to the King who measures its state in one of mutually unbiased bases of his…
The Mean King's problem asks to determine the outcome of a measurement that is randomly selected from a set of complementary observables. We review this problem and offer a combinatorial solution. More generally, we show that whenever an…
The Mean King's problem with mutually unbiased bases is reconsidered for arbitrary d-level systems. Hayashi, Horibe and Hashimoto [Phys. Rev. A 71, 052331 (2005)] related the problem to the existence of a maximal set of d-1 mutually…
We discuss the so-called mean king's problem, a retrodiction problem among non-commutative observables, in the context of error detection. Describing the king's measurement effectively by a single error operation, we give a solution of the…
We present the solution to the "mean king's problem" in the continuous variable setting. We show that in this setting, the outcome of a randomly-selected projective measurement of any linear combination of the canonical variables x and p…
In 1987, Vaidman, Aharanov, and Albert put forward a puzzle called the Mean King's Problem (MKP) that can be solved only by harnessing quantum entanglement. Prime-powered solutions to the problem have been shown to exist, but they have not…
We try to find an optimal quantum measurement for generalized quantum state discrimination problems, which include the problem of finding an optimal measurement maximizing the average correct probability with and without a fixed rate of…
We consider the problem of determining the mixed quantum state of a large but finite number of identically prepared quantum systems from data obtained in a sequence of ideal (von Neumann) measurements, each performed on an individual copy…
There has been a surge of progress in recent years in developing algorithms for testing and learning quantum states that achieve optimal copy complexity. Unfortunately, they require the use of entangled measurements across many copies of…
We consider the problem of a state determination for a two-level quantum system which can be in one of two nonorthogonal mixed states. It is proved that for the two independent identical systems the optimal combined measurement (which…
We consider the dihedral hidden subgroup problem as the problem of distinguishing hidden subgroup states. We show that the optimal measurement for solving this problem is the so-called pretty good measurement. We then prove that the success…
We propose upper and lower bounds on the maximum success probability for discriminating given quantum states. The proposed upper bound is obtained from a suboptimal solution to the dual problem of the corresponding optimal state…
The guesswork quantifies the minimum cost incurred in guessing the state of an ensemble, when only one state can be queried at a time. In the classical case, it is well known that the optimal strategy trivially consists of querying the…
We study quantum state testing where the goal is to test whether $\rho=\rho_0\in\mathbb{C}^{d\times d}$ or $\|\rho-\rho_0\|_1>\varepsilon$, given $n$ copies of $\rho$ and a known state description $\rho_0$. In practice, not all measurements…
While canonical quantization solves many problems there are some problems where it fails. A close examination of the classical/quantum connection leads to a new connection that permits quantum and classical realms to coexist, as is the case…
A key concept of quantum information theory is that accessing information encoded in a quantum system requires us to discriminate between several possible states the system could be in. A natural generalization of this problem, namely,…