Related papers: Optimal two-qubit quantum circuits using exchange …
In order to demonstrate non-trivial quantum computations experimentally, such as the synthesis of arbitrary entangled states, it will be useful to understand how to decompose a desired quantum computation into the shortest possible sequence…
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…
We propose a method for implementation of an universal set of one- and two-quantum-bit gates for quantum computation in the system of two coupled electrons with constant non-diagonal exchange interaction. Suppression of the exchange…
While Ising-type interactions are ideal for implementing controlled phase flip gates in one-way quantum computing, natural interactions between solid-state qubits are most often described by either the XY or the Heisenberg models. We show…
Two-qubit gates between spin qubits are often performed using a rectangular or an adiabatic exchange interaction pulse resulting in a CZ gate. An oscillating exchange pulse not only performs a CZ gate, but also enables the iSWAP gate, which…
In a previous publication [1] we showed that it is possible to implement universal quantum computation with the anisotropic XY-Heisenberg exchange acting as a single interaction. To achieve this we used encodings of the states of the…
Experimental implementations of quantum computer architectures are now being investigated in many different physical settings. The full set of requirements that must be met to make quantum computing a reality in the laboratory [1] is…
We present a universal set of quantum gate operations based on exchange-only spin qubits in a double quantum dot, where each qubit is obtained by three electrons in the (2,1) filling. Gate operations are addressed by modulating…
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…
It has been widely assumed that one-qubit gates in spin-based quantum computers suffer from severe technical difficulties. We show that one-qubit gates can in fact be generated using only modest and presently feasible technological…
The two-qubit interaction Hamiltonian of a given physical implementation determines whether or not a two-qubit gate such as the CNOT gate can be realized easily. It can be shown that, e.g., with the XY interaction more than one two-qubit…
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'…
We construct a minimal robust controlled-NOT gate with an Ising-type interaction by which elementary two-qubit gates are implemented. It is robust against inaccuracy of the coupling strength and the obtained quantum circuits are constructed…
Optimal implementation of quantum gates is crucial for designing a quantum computer. The necessary condition for optimal construction of a two-qubit unitary operation is obtained. It can be proved that the B gate is the unique gate that can…
We consider a model of two interacting always-on, exchange-only qubits for which controlled phase ($CPHASE$), controlled NOT ($CNOT$), quantum Fourier transform ($QFT$) and $SWAP$ operations can be implemented only in a few electrical…
Heisenberg spin chains can act as quantum wires transferring quantum states either perfectly or with high fidelity. Gaussian packets of excitations passing through dual rails can encode the two states of a logical qubit, depending on which…
We consider the implementation of two-qubit unitary transformations by means of CNOT gates and single-qubit unitary gates. We show, by means of an explicit quantum circuit, that together with local gates three CNOT gates are necessary and…
We give quantum circuits that simulate an arbitrary two-qubit unitary operator up to global phase. For several quantum gate libraries we prove that gate counts are optimal in worst and average cases. Our lower and upper bounds compare…
A new approach to single-qubit operations using exchange interactions of single electrons in gate-defined quantum dots has recently been demonstrated: the resonant exchange qubit. We show that two-qubit operations, specifically the CPHASE…
Quantum circuits currently constitute a dominant model for quantum computation. Our work addresses the problem of constructing quantum circuits to implement an arbitrary given quantum computation, in the special case of two qubits. We…