An explicit universal gate-set for exchange-only quantum computation

DOI10.1023/B:QINP.0000020084.53422.8EMaRDI QIDQ2573090zbMATH OpenFDO

Authors Yanyan Li

Publication date 7 November 2005

Published in Quantum Information Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/quant-ph/0309002

zbMATH Keywords

quantum information theoryQuantum computation

Mathematics Subject Classification ID

Quantum computation (81P68) Research exposition (monographs, survey articles) pertaining to quantum theory (81-02)

Abstract: A single physical interaction might not be universal for quantum computation in general. It has been shown, however, that in some cases it can generate universal quantum computation over a subspace. For example, by encoding logical qubits into arrays of multiple physical qubits, a single isotropic or anisotropic exchange interaction can generate a universal logical gate-set. Recently, encoded universality for the exchange interaction was explicitly demonstrated on three-qubit arrays, the smallest nontrivial encoding. We now present the exact specification of a discrete universal logical gate-set on four-qubit arrays. We show how to implement the single qubit operations exactly with at most 3 nearest neighbor exchange operations and how to generate the encoded controlled-not with 29 parallel nearest neighbor exchange interactions or 54 serial gates, obtained from extensive numerical optimization using genetic algorithms and Nelder-Mead searches. Our gate-sequences are immediately applicable to implementations of quantum circuits with the exchange interaction.

Recommendations

• Universal set of quantum gates for double-dot exchange-only spin qubits with intradot coupling
• Existence of the exact CNOT on a quantum computer with the exchange interaction
• Encoded universality from a single physical interaction
• Universal quantum computing in linear nearest neighbor architectures
• Implementing a quantum algorithm with exchange-coupled quantum dots: a feasibility study

Cited in

(7)

• Existence of the exact CNOT on a quantum computer with the exchange interaction
• Encoded universality from a single physical interaction
• Complexity classification of local Hamiltonian problems
• Quantum algorithms for classical lattice models
• Universal set of quantum gates for double-dot exchange-only spin qubits with intradot coupling
• Universal quantum computation with spin-\(1/2\) pairs and Heisenberg exchange
• Dissipative quantum repeater

This page was built for publication: An explicit universal gate-set for exchange-only quantum computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2573090)