arXiv:quant-ph/0408037 · Physical Review A

Energetic suppression of decoherence in exchange-only quantum computation

Yaakov S. Weinstein, C. Stephen Hellberg

Published Aug 17, 2005• 30 citations

Abstract

Universal quantum computation requiring only the Heisenberg exchange interaction and suppressing decoherence via an energy gap is presented. The combination of an always-on exchange interaction between the three physical qubits comprising the encoded qubit and a global magnetic field generates an energy gap between the subspace of interest and all other states. This energy gap suppresses decoherence. Always-on exchange couplings greatly simplify hardware specifications and the implementation of inter-logical-qubit gates. A controlled phase gate can be implemented using only three Heisenberg exchange operations all of which can be performed simultaneously.

DOI: 10.1103/physreva.72.022319

Related papers

Universal Quantum Computation with Spin- 1 / 2 Pairs and Heisenberg Exchange

Jeremy Levy

An efficient and intuitive framework for universal quantum computation is presented that uses pairs of spin-1/2 particles to form logical qubits and a single physical interaction, Heisenberg exchange, to produce all gate operations. Only two Heisenberg gate operations are required to produce a controlled pi-phase shift, compared to nineteen for exchange-only proposals employing three spins. Evolved from well-studied decoherence-free subspaces, this architecture inherits immunity from collective decoherence mechanisms. The simplicity and adaptability of this approach should make it attractive for spin-based quantum computing architectures.

arXiv:quant-ph/0101057Physical Review LettersSep 17, 2002407 citations

Two-qubit gates for decoherence-free qubits using a ring exchange interaction

Bobby Antonio, Sougato Bose

It is known that it is possible to encode a logical qubit over many physical qubits such that it is immune to the effects of collective decoherence, and it is possible to perform universal quantum computation using these ``decoherence-free'' qubits. However, current proposed methods of performing gates on these encoded qubits could be difficult to implement, or could take too much time to perform. Here we investigate whether exploiting ring exchange interactions, which may be naturally present, can simplify the implementation of these gates in any way. Using a ring exchange interaction, we have found a way to create a controlled-Z gate on the four-qubit decoherence-free subspace and the three-qubit decoherence-free subsystem using a sequence with five pulses. This could be useful in situations where simplicity is important or where ring exchange interactions are prominent. We also investigate how timing errors and magnetic field fluctuations affect the fidelity of this gate.

arXiv:1301.2922Physical Review AOct 7, 20139 citations

Scheme for Quantum Computing Immune to Decoherence

Colin P. Williams, Farrokh Vatan

A constructive scheme has been devised to enable mapping of any quantum computation into a spintronic circuit in which the computation is encoded in a basis that is, in principle, immune to quantum decoherence. The scheme is implemented by an algorithm that utilizes multiple physical spins to encode each logical bit in such a way that collective errors affecting all the physical spins do not disturb the logical bit. The scheme is expected to be of use to experimenters working on spintronic implementations of quantum logic. Spintronic computing devices use quantum-mechanical spins (typically, electron spins) to encode logical bits. Bits thus encoded (denoted qubits) are potentially susceptible to errors caused by noise and decoherence. The traditional model of quantum computation is based partly on the assumption that each qubit is implemented by use of a single two-state quantum system, such as an electron or other spin-1.2 particle. It can be surprisingly difficult to achieve certain gate operations . most notably, those of arbitrary 1-qubit gates . in spintronic hardware according to this model. However, ironically, certain 2-qubit interactions (in particular, spin-spin exchange interactions) can be achieved relatively easily in spintronic hardware. Therefore, it would be fortunate if it were possible to implement any 1-qubit gate by use of a spin-spin exchange interaction. While such a direct representation is not possible, it is possible to achieve an arbitrary 1-qubit gate indirectly by means of a sequence of four spin-spin exchange interactions, which could be implemented by use of four exchange gates. Accordingly, the present scheme provides for mapping any 1-qubit gate in the logical basis into an equivalent sequence of at most four spin-spin exchange interactions in the physical (encoded) basis. The complexity of the mathematical derivation of the scheme from basic quantum principles precludes a description within this article; it must suffice to report that the derivation provides explicit constructions for finding the exchange couplings in the physical basis needed to implement any arbitrary 1-qubit gate. These constructions lead to spintronic encodings of quantum logic that are more efficient than those of a previously published scheme that utilizes a universal but fixed set of gates.

Mar 1, 20080 citations

Quantum logic gates from time-dependent global magnetic field in a system with constant exchange

A. V. Nenashev, A. F. Zinovieva, А. В. Двуреченский +2 more

We propose a method that implements a universal set of one- and two-quantum-bit gates for quantum computation in a system of coupled electron pairs with constant non-diagonal exchange interaction. In our proposal, suppression of the exchange interaction is performed by the continual repetition of single-spin rotations. A small g-factor difference between the electrons allows for addressing qubits and avoiding strong magnetic field pulses. Numerical experiments were performed to show that, to implement the one- and two-qubit operations, it is sufficient to change the strength of the magnetic field by a few Gauss. This introduces one and then the other electron in a resonance. To determine the evolution of the two-qubit system, we use the algorithms of optimal control theory.

arXiv:1501.06294Journal of Applied PhysicsMar 20, 20159 citations

Fault-Tolerant Quantum Computation via Exchange Interactions

Masoud Mohseni, Daniel A. Lidar

Quantum computation can be performed by encoding logical qubits into the states of two or more physical qubits, and control of effective exchange interactions and possibly a global magnetic field. This "encoded universality" paradigm offers potential simplifications in quantum computer design since it does away with the need to control physical qubits individually. Here we show how encoded universality schemes can be combined with fault-tolerant quantum error correction, thus establishing the scalability of such schemes.

arXiv:quant-ph/0406198Physical Review LettersFeb 3, 200530 citations

Quantum computation in decoherence-free subspaces for overcoming bit-flip error in cavity QED

陈月月, 刘呈普, 冯勋立 +3 more

Universal quantum computation overcoming influnce of bit-flip error is realized by suppressing collective decoherence with decoherence-free subspace method. The scheme is based on cavity QED system. A logical bit is encoded by two adjacent atoms trapped in a cavity, and a four-dimensional decoherence-free subspace is constructed to suppress the collective bit reversal error. By adjusting the coupling between the external optical field and cavity, two noncommutative single-qubit operations and a controlled phase gate are implemented in decoherence-free subspace. Universal quantum computation overcoming the collective bit reversal error is realized.

Jan 1, 20160 citations