1,379 research outputs found

    Reflection Symmetries for Multiqubit Density Operators

    Full text link
    For multiqubit density operators in a suitable tensorial basis, we show that a number of nonunitary operations used in the detection and synthesis of entanglement are classifiable as reflection symmetries, i.e., orientation changing rotations. While one-qubit reflections correspond to antiunitary symmetries, as is known for example from the partial transposition criterion, reflections on the joint density of two or more qubits are not accounted for by the Wigner Theorem and are well-posed only for sufficiently mixed states. One example of such nonlocal reflections is the unconditional NOT operation on a multiparty density, i.e., an operation yelding another density and such that the sum of the two is the identity operator. This nonphysical operation is admissible only for sufficiently mixed states.Comment: 9 page

    Experimental Implementation of Logical Bell State Encoding

    Get PDF
    Liquid phase NMR is a general purpose test-bed for developing methods of coherent control relevant to quantum information processing. Here we extend these studies to the coherent control of logical qubits and in particular to the unitary gates necessary to create entanglement between logical qubits. We report an experimental implementation of a conditional logical gate between two logical qubits that are each in decoherence free subspaces that protect the quantum information from fully correlated dephasing.Comment: 9 Pages, 5 Figure

    Benchmarking quantum control methods on a 12-qubit system

    Full text link
    In this letter, we present an experimental benchmark of operational control methods in quantum information processors extended up to 12 qubits. We implement universal control of this large Hilbert space using two complementary approaches and discuss their accuracy and scalability. Despite decoherence, we were able to reach a 12-coherence state (or 12-qubits pseudo-pure cat state), and decode it into an 11 qubit plus one qutrit labeled observable pseudo-pure state using liquid state nuclear magnetic resonance quantum information processors.Comment: 11 pages, 4 figures, to be published in PR

    A Method for Modeling Decoherence on a Quantum Information Processor

    Full text link
    We develop and implement a method for modeling decoherence processes on an N-dimensional quantum system that requires only an N2N^2-dimensional quantum environment and random classical fields. This model offers the advantage that it may be implemented on small quantum information processors in order to explore the intermediate regime between semiclassical and fully quantum models. We consider in particular σzσz\sigma_z\sigma_z system-environment couplings which induce coherence (phase) damping, though the model is directly extendable to other coupling Hamiltonians. Effective, irreversible phase-damping of the system is obtained by applying an additional stochastic Hamiltonian on the environment alone, periodically redressing it and thereby irreversibliy randomizing the system phase information that has leaked into the environment as a result of the coupling. This model is exactly solvable in the case of phase-damping, and we use this solution to describe the model's behavior in some limiting cases. In the limit of small stochastic phase kicks the system's coherence decays exponentially at a rate which increases linearly with the kick frequency. In the case of strong kicks we observe an effective decoupling of the system from the environment. We present a detailed implementation of the method on an nuclear magnetic resonance quantum information processor.Comment: 12 pages, 9 figure

    Application of Optimal Control to CPMG Refocusing Pulse Design

    Full text link
    We apply optimal control theory (OCT) to the design of refocusing pulses suitable for the CPMG sequence that are robust over a wide range of B0 and B1 offsets. We also introduce a model, based on recent progress in the analysis of unitary dynamics in the field of quantum information processing (QIP), that describes the multiple refocusing dynamics of the CPMG sequence as a dephasing Pauli channel. This model provides a compact characterization of the consequences and severity of residual pulse errors. We illustrate the methods by considering a specific example of designing and analyzing broadband OCT refocusing pulses of length 10 t180 that are constrained by the maximum instantaneous pulse power. We show that with this refocusing pulse, the CPMG sequence can refocus over 98% of magnetization for resonance offsets up to 3.2 times the maximum RF amplitude, even in the presence of +/- 10% RF inhomogeneity.Comment: 23 pages, 10 figures; Revised and reformatted version with new title and significant changes to Introduction and Conclusions section

    Quantum Simulations on a Quantum Computer

    Get PDF
    We present a general scheme for performing a simulation of the dynamics of one quantum system using another. This scheme is used to experimentally simulate the dynamics of truncated quantum harmonic and anharmonic oscillators using nuclear magnetic resonance. We believe this to be the first explicit physical realization of such a simulation.Comment: 4 pages, 2 figures (\documentstyle[prl,aps,epsfig,amscd]{revtex}); to appear in Phys. Rev. Let

    Algorithm engineering for optimal alignment of protein structure distance matrices

    Get PDF
    Protein structural alignment is an important problem in computational biology. In this paper, we present first successes on provably optimal pairwise alignment of protein inter-residue distance matrices, using the popular Dali scoring function. We introduce the structural alignment problem formally, which enables us to express a variety of scoring functions used in previous work as special cases in a unified framework. Further, we propose the first mathematical model for computing optimal structural alignments based on dense inter-residue distance matrices. We therefore reformulate the problem as a special graph problem and give a tight integer linear programming model. We then present algorithm engineering techniques to handle the huge integer linear programs of real-life distance matrix alignment problems. Applying these techniques, we can compute provably optimal Dali alignments for the very first time

    A Study of Quantum Error Correction by Geometric Algebra and Liquid-State NMR Spectroscopy

    Get PDF
    Quantum error correcting codes enable the information contained in a quantum state to be protected from decoherence due to external perturbations. Applied to NMR, quantum coding does not alter normal relaxation, but rather converts the state of a ``data'' spin into multiple quantum coherences involving additional ancilla spins. These multiple quantum coherences relax at differing rates, thus permitting the original state of the data to be approximately reconstructed by mixing them together in an appropriate fashion. This paper describes the operation of a simple, three-bit quantum code in the product operator formalism, and uses geometric algebra methods to obtain the error-corrected decay curve in the presence of arbitrary correlations in the external random fields. These predictions are confirmed in both the totally correlated and uncorrelated cases by liquid-state NMR experiments on 13C-labeled alanine, using gradient-diffusion methods to implement these idealized decoherence models. Quantum error correction in weakly polarized systems requires that the ancilla spins be prepared in a pseudo-pure state relative to the data spin, which entails a loss of signal that exceeds any potential gain through error correction. Nevertheless, this study shows that quantum coding can be used to validate theoretical decoherence mechanisms, and to provide detailed information on correlations in the underlying NMR relaxation dynamics.Comment: 33 pages plus 6 figures, LaTeX article class with amsmath & graphicx package

    Thirty-two Goldbach Variations

    Full text link
    We give thirty-two diverse proofs of a small mathematical gem--the fundamental Euler sum identity zeta(2,1)=zeta(3) =8zeta(\bar 2,1). We also discuss various generalizations for multiple harmonic (Euler) sums and some of their many connections, thereby illustrating both the wide variety of techniques fruitfully used to study such sums and the attraction of their study.Comment: v1: 34 pages AMSLaTeX. v2: 41 pages AMSLaTeX. New introductory material added and material on inequalities, Hilbert matrix and Witten zeta functions. Errors in the second section on Complex Line Integrals are corrected. To appear in International Journal of Number Theory. Title change
    corecore