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:1701.01828 · International Journal of Quantum Information

Solutions to the mean king’s problem: Higher-dimensional quantum error-correcting codes

Masakazu Yoshida, Toru Kuriyama, Jun Cheng

Published Dec 1, 2016• 0 citations
arXivHTMLPDF

Abstract

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 the viewpoint of error detection and correction. We construct higher-dimensional quantum error-correcting codes against error corresponding to the noncommutative observables. Any code state of the codes provides a way to discriminate the eigenstates correctly with the classical delayed information.

DOI
10.1142/s0219749916500489

Related papers

Solution to the mean king's problem using quantum error-correcting codes

M. Yoshida, Gen Kimura, Takayuki Miyadera +2 more

We discuss the so-called mean king's problem, a retrodiction problem among noncommutative observables, in the context of error detection. Describing the king's measurement effectively by a single error operation, we give a solution of the mean king's problem using quantum error-correcting codes. The existence of a quantum error-correcting code from a solution is also presented.

arXiv:1507.07072•Physical Review A•May 26, 2015•5 citations

Qubits in phase space: Wigner-function approach to quantum-error correction and the mean-king problem

Juan Pablo Paz, Augusto J. Roncaglia, Marcos Saraceno

We analyze and further develop a method to represent the quantum state of a system of $n$ qubits in a phase-space grid of $N\ifmmode\times\else\texttimes\fi{}N$ points (where $N={2}^{n}$). The method, which was recently proposed by Wootters and co-workers (Gibbons et al., Phys. Rev. A 70, 062101 (2004).), is based on the use of the elements of the finite field $\mathrm{GF}({2}^{n})$ to label the phase-space axes. We present a self-contained overview of the method, we give insights into some of its features, and we apply it to investigate problems which are of interest for quantum-information theory: We analyze the phase-space representation of stabilizer states and quantum error-correction codes and present a phase-space solution to the so-called mean king problem.

arXiv:quant-ph/0410117•Physical Review A•Jul 11, 2005•79 citations

Constructing Quantum Error-Correcting Codes for pm-State System from Classical Error-Correcting Codes

Ryutaroh Matsumoto, Tomohiko Uyematsu

Quantum error-correcting codes have attracted much attention. Among many research articles, the most general and systematic construction is the so called stabilizer code construction [6] or additive code construction [2], which constructs a quantum error-correcting code as an eigenspace of an Abelian subgroup S of the error group. Thereafter Calderbank et al. [3] proposed a construction of S from an additive code over the finite field F4 with 4 elements. These constructions work for tensor products of 2-state quantum systems. However Knill [8], [9] and Rains [13] observed that the construction [2], [6] can be generalized to n-state systems by an appropriate choice of the error basis. Rains [13] also generalized the construction [3] using additive codes over F4 to p-state quantum systems, but his generalization does not relate the problem of quantum code construction to classical error-correcting codes. We propose a construction of quantum error-correcting codes for p-state systems from classical error-correcting codes which is a generalization of [3]. Throughout this paper, p denotes a prime number andm a positive integer. This paper is organized as follows. In Sect. 2, we review the construction of quantum codes for nonbinary systems. In Sect. 3, we propose a construction of quantum codes for p-state systems from classical codes over Fp2 . In Sect. 4, we propose a construction of quantum codes for p-state systems from classical linear codes over Fp2m . In Sect. 5, we discuss a

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Oct 25, 2000•26 citations

Encoding a qubit in an oscillator

Daniel Gottesman, Alexei Kitaev, John P. Preskill

Quantum error-correcting codes are constructed that embed a finite-dimensional code space in the infinite-dimensional Hilbert space of a system described by continuous quantum variables. These codes exploit the noncommutative geometry of phase space to protect against errors that shift the values of the canonical variables q and p. In the setting of quantum optics, fault-tolerant universal quantum computation can be executed on the protected code subspace using linear optical operations, squeezing, homodyne detection, and photon counting; however, nonlinear mode coupling is required for the preparation of the encoded states. Finite-dimensional versions of these codes can be constructed that protect encoded quantum information against shifts in the amplitude or phase of a d-state system. Continuous-variable codes can be invoked to establish lower bounds on the quantum capacity of Gaussian quantum channels.

arXiv:quant-ph/0008040•Physical Review A•Jun 11, 2001•1,525 citations

Re-Formulation of Mean King’s Problem Using Shannon’s Entropy

M. Yoshida, Hideki Imai

Mean King’s problem is formulated as a retrodiction problem among noncommutative observables. In this paper, we reformulate Mean King’s problem using Shannon’s entropy as a first step of introducing quantum uncertainty relation with delayed classical information. As a result, we give informational and statistical meanings to the estimation on Mean King problem. As its application, we give an alternative proof of nonexistence of solutions of Mean King’s problem for qubit system without using entanglement.

Journal of Quantum Information Science•Jan 1, 2013•1 citation

QUANTUM ERROR CORRECTION ON INFINITE-DIMENSIONAL HILBERT SPACES

Cédric Bény, Achim Kempf, David W. Kribs +1 more

Abstract. We present a generalization of quantum error correction to infinite-dimensional Hilbert spaces. The generalization yields new classes of quantum error correcting codes that have no finite-dimensional counterparts. The error correction theory we develop begins with a shift of focus from states to algebras of observables. Standard subspace codes and subsystem codes are seen as the special case of algebras of observables given by finite-dimensional von Neumann factors of type I. Our generalization allows for the correction of codes characterized by any von Neumann algebra and we give examples, in particular, of codes defined by infinite-dimensional algebras. 1.

•Nov 26, 2012•14 citations
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 the viewpoint of error detection and correction. We construct higher-dimensional quantum error-correcting codes against error corresponding to the noncommutative observables. Any code state of the codes provides a way to discriminate the eigenstates correctly with the classical delayed information.
We analyze and further develop a method to represent the quantum state of a system of nnn qubits in a phase-space grid of $N\ifmmode\times\else\texttimes\fi{}N$ points (where N=2nN={2}^{n}N=2n). The method, which was recently proposed by Wootters and co-workers (Gibbons et al., Phys. Rev. A 70, 062101 (2004).), is based on the use of the elements of the finite field GF(2n)\mathrm{GF}({2}^{n})GF(2n) to label the phase-space axes. We present a self-contained overview of the method, we give insights into some of its features, and we apply it to investigate problems which are of interest for quantum-information theory: We analyze the phase-space representation of stabilizer states and quantum error-correction codes and present a phase-space solution to the so-called mean king problem.
Quantum error-correcting codes have attracted much attention. Among many research articles, the most general and systematic construction is the so called stabilizer code construction [6] or additive code construction [2], which constructs a quantum error-correcting code as an eigenspace of an Abelian subgroup S of the error group. Thereafter Calderbank et al. [3] proposed a construction of S from an additive code over the finite field F4 with 4 elements. These constructions work for tensor products of 2-state quantum systems. However Knill [8], [9] and Rains [13] observed that the construction [2], [6] can be generalized to n-state systems by an appropriate choice of the error basis. Rains [13] also generalized the construction [3] using additive codes over F4 to p-state quantum systems, but his generalization does not relate the problem of quantum code construction to classical error-correcting codes. We propose a construction of quantum error-correcting codes for p-state systems from classical error-correcting codes which is a generalization of [3]. Throughout this paper, p denotes a prime number andm a positive integer. This paper is organized as follows. In Sect. 2, we review the construction of quantum codes for nonbinary systems. In Sect. 3, we propose a construction of quantum codes for p-state systems from classical codes over Fp2 . In Sect. 4, we propose a construction of quantum codes for p-state systems from classical linear codes over Fp2m . In Sect. 5, we discuss a
Quantum error-correcting codes are constructed that embed a finite-dimensional code space in the infinite-dimensional Hilbert space of a system described by continuous quantum variables. These codes exploit the noncommutative geometry of phase space to protect against errors that shift the values of the canonical variables q and p. In the setting of quantum optics, fault-tolerant universal quantum computation can be executed on the protected code subspace using linear optical operations, squeezing, homodyne detection, and photon counting; however, nonlinear mode coupling is required for the preparation of the encoded states. Finite-dimensional versions of these codes can be constructed that protect encoded quantum information against shifts in the amplitude or phase of a d-state system. Continuous-variable codes can be invoked to establish lower bounds on the quantum capacity of Gaussian quantum channels.
Mean King’s problem is formulated as a retrodiction problem among noncommutative observables. In this paper, we reformulate Mean King’s problem using Shannon’s entropy as a first step of introducing quantum uncertainty relation with delayed classical information. As a result, we give informational and statistical meanings to the estimation on Mean King problem. As its application, we give an alternative proof of nonexistence of solutions of Mean King’s problem for qubit system without using entanglement.
Abstract. We present a generalization of quantum error correction to infinite-dimensional Hilbert spaces. The generalization yields new classes of quantum error correcting codes that have no finite-dimensional counterparts. The error correction theory we develop begins with a shift of focus from states to algebras of observables. Standard subspace codes and subsystem codes are seen as the special case of algebras of observables given by finite-dimensional von Neumann factors of type I. Our generalization allows for the correction of codes characterized by any von Neumann algebra and we give examples, in particular, of codes defined by infinite-dimensional algebras. 1.