Related papers: Solutions to the mean king's problem: higher-dimen…
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…
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…
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 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…
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…
In the King's Problem, a physicist is asked to prepare a d-state quantum system in any state of her choosing and give it to a king who measures one of (d+1) sets of mutually unbiased observables on it. The physicist is then allowed to make…
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…
One advantage of quantum algorithms over classical computation is the possibility to spread out, process, analyse and extract information in multipartite configurations in coherent superpositions of classical states. This will be discussed…
The mean king's problem with maximal mutually unbiased bases (MUB's) in general dimension d is investigated. It is shown that a solution of the problem exists if and only if the maximal number (d+1) of orthogonal Latin squares exists. This…
This paper explores the use of 2-categorical technology for describing and reasoning about complex quantum procedures. We give syntactic definitions of a family of complementary measurements, and of quantum key distribution, and show that…
State estimation is a classical problem in quantum information. In optimization of estimation scheme, to find a lower bound to the error of the estimator is a very important step. So far, all the proposed tractable lower bounds use…
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…
The quantum state discrimination problem is to distinguish between non-orthogonal quantum states. This problem has many applications in quantum information theory, quantum communication and quantum cryptography. In this paper a quantum…
Non-orthogonal quantum states pose a fundamental challenge in quantum information processing, as they cannot be distinguished with absolute certainty. Conventionally, the focus has been on minimizing error probability in quantum state…
Quantum error correction in general is experimentally challenging as it requires significant expansion of the size of quantum circuits and accurate performance of quantum gates to fulfill the error threshold requirement. Here we propose a…
Tasked with the challenge to build better and better computers, quantum computing and classical computing face the same conundrum: the success of classical computing systems. Small quantum computing systems have been demonstrated, and…
We systematically investigate quantum algorithms and lower bounds for mean estimation given query access to non-identically distributed samples. On the one hand, we give quantum mean estimators with quadratic quantum speed-up given samples…
Quantum error correction is a set of methods to protect quantum information--that is, quantum states--from unwanted environmental interactions (decoherence) and other forms of noise. The information is stored in a quantum error-correcting…