Information Processing Using Three-Qubit and Qubit–Qutrit Encodings of Noncomposite Quantum Systems

Abstract

We study quantum information properties of a seven-level system realized by a particle in an onedimensional square-well trap. Features of encodings of seven-level systems in a form of three-qubit or qubit-qutrit systems are discussed. We use the three-qubit encoding of the system in order to investigate subadditivity and strong subadditivity conditions for the thermal state of the particle. The qubit-qutrit encoding is employed to suggest a single qudit algorithm for calculation of parity of a bit string. Obtained results indicate on the potential resource of multilevel systems for realization of quantum information processing.

The Partition Formalism and New Entropic-Information Inequalities for Real Numbers on an Example of Clebsch–Gordan Coefficients

“…In the future publication, we relate the introduced formalism to the star-product quantization scheme discussed, e.g., in [33,34] and study a possibility to introduce and employ the notion of "hidden states" for single qudit states (see [35]) extending the notion of gates for composite systems to the case of noncomposite systems.…”

Molecular spin qudits for quantum algorithms

“…27,61,62 In addition, multilevel qudits are more advantageous than twolevel qubits counterparts, due to their ability to parallel quantum information processing in a single unit, decreasing the error rates. 38,[63][64][65][66] Furthermore, entanglement and superposition could be achieved in qudits in large dimensions with smaller clusters of processing units.…”

Quantum Genetic Algorithm on Multilevel Quantum Systems

“…Recently much attention has been devoted to studies of possibility of using of the quantum systems for realization of quantum algorithms [8][9][10]. In contradiction to qubit, qudit is a quantum unit of information, which may be in any of basis states |0⟩, |1⟩, |2⟩, .…”

“…end if (9) end for (10) end for Algorithm 1: Qudit state measurement. be at least 21 qubits, for = 3 -14 qutrits, and for = 4 only 11 qudits are enough ( Figure 1).…”