The ability to perform quantum error correction is a significant hurdle for scalable quantum information processing. A key requirement for multiple-round quantum error correction is the ability to dynamically extract entropy from ancilla qubits. Heat
-bath algorithmic cooling is a method that uses quantum logic operations to move entropy from one subsystem to another, and permits cooling of a spin qubit below the closed system (Shannon) bound. Gamma-irradiated, $^{13}$C-labeled malonic acid provides up to 5 spin qubits: 1 spin-half electron and 4 spin-half nuclei. The nuclei are strongly hyperfine coupled to the electron and can be controlled either by exploiting the anisotropic part of the hyperfine interaction or by using pulsed electron-nuclear double resonance (ENDOR) techniques. The electron connects the nuclei to a heat-bath with a much colder effective temperature determined by the electrons thermal spin polarization. By accurately determining the full spin Hamiltonian and performing realistic algorithmic simulations, we show that an experimental demonstration of heat-bath algorithmic cooling beyond the Shannon bound is feasible in both 3-qubit and 5-qubit variants of this spin system. Similar techniques could be useful for polarizing nuclei in molecular or crystalline systems that allow for non-equilibrium optical polarization of the electron spin.
In the context of evolutionary quantum computing in the literal meaning, a quantum crossover operation has not been introduced so far. Here, we introduce a novel quantum genetic algorithm which has a quantum crossover procedure performing crossovers
among all chromosomes in parallel for each generation. A complexity analysis shows that a quadratic speedup is achieved over its classical counterpart in the dominant factor of the run time to handle each generation.
Eigenvalue-preserving-but-not-completely-eigenvalue-preserving (EnCE) maps were previously introduced for the purpose of detection and quantification of nonclassical correlation, employing the paradigm where nonvanishing quantum discord implies the e
xistence of nonclassical correlation. It is known that only the matrix transposition is nontrivial among Hermiticity-preserving (HP) linear EnCE maps when we use the changes in the eigenvalues of a density matrix due to a partial map for the purpose. In this paper, we prove that this is true even among not-necessarily HP (nnHP) linear EnCE maps. The proof utilizes a conventional theorem on linear preservers. This result imposes a strong limitation on the linear maps and promotes the importance of nonlinear maps.
Existing measures of bipartite nonclassical correlation that is typically characterized by nonvanishing nonlocalizable information under the zero-way CLOCC protocol are expensive in computational cost. We define and evaluate economical measures on th
e basis of a new class of maps, eigenvalue-preserving-but-not-completely-eigenvalue-preserving (EnCE) maps. The class is in analogy to the class of positive-but-not-completely-positive (PnCP) maps that have been commonly used in the entanglement theories. Linear and nonlinear EnCE maps are investigated. We also prove subadditivity of the measures in a form of logarithmic fidelity.
In the context of the Oppenheim-Horodecki paradigm of nonclassical correlation, a bipartite quantum state is (properly) classically correlated if and only if it is represented by a density matrix having a product eigenbasis. On the basis of this para
digm, we propose a measure of nonclassical correlation by using truncations of a density matrix down to individual eigenspaces. It is computable within polynomial time in the dimension of the Hilbert space albeit imperfect in the detection range. This is in contrast to the measures conventionally used for the paradigm. The computational complexity and mathematical properties of the proposed measure are investigated in detail and the physical picture of its definition is discussed.
We study a (k,m)-threshold controlling scheme for controlled quantum teleportation. A standard polynomial coding over GF(p) with prime p > m-1 needs to distribute a d-dimensional qudit with d >= p to each controller for this purpose. We propose a sch
eme using m qubits (two-dimensional qudits) for the controllers portion, following a discussion on the benefit of a quantum control in comparison to a classical control of a quantum teleportation.
