Related papers: Quantum-gate implementation in permanently coupled…
In circuit-based quantum computing, the available gate set typically consists of single-qubit gates acting on each individual qubit and at least one entangling gate between pairs of qubits. In certain physical architectures, however, some…
Implementations for quantum computing require fast single- and multi-qubit quantum gate operations. In the case of optically controlled quantum dot qubits theoretical designs for long-range two- or multi-qubit operations satisfying all the…
A proposal for applying non-adiabatic geometric phases to quantum computing, called the double-loop method [S.-L. Zhu and Z. D. Wang, Phys. Rev. A {\bf 67}, 022319 (2003)], is demonstrated in a liquid state NMR quantum computer. Using a…
Constructing compact quantum circuits for universal quantum gates on solid-state systems is crucial for quantum computing. We present some compact quantum circuits for a deterministic solid-state quantum computing, including the CNOT,…
High-fidelity and robust quantum manipulation is the key for scalable quantum computation. Therefore, due to the intrinsic operational robustness, quantum manipulation induced by geometric phases is one of the promising candidates. However,…
We describe and discuss a solid state proposal for quantum computation with mobile spin qubits in one-dimensional systems, based on recent advances in spintronics. Static electric fields are used to implement a universal set of quantum…
The prevalent approach to executing quantum algorithms on quantum computers is to break-down the algorithms to a concatenation of universal gates, typically single and two-qubit gates. However such a decomposition results in long gate…
We employ quantum optimal control theory to realize quantum gates for two protected superconducting circuits: the heavy-fluxonium qubit and the 0-$\pi$ qubit. Utilizing automatic differentiation facilitates the simultaneous inclusion of…
We propose a new fast scalable method for achieving a two-qubit entangling gate between arbitrary distant qubits in a network by exploiting dispersionless propagation in uniform chains. This is achieved dynamically by switching on a strong…
Algorithms for quantum information processing are usually decomposed into sequences of quantum gate operations, most often realized with single- and two- qubit gates[1]. While such operations constitute a universal set for quantum…
We present a new experimental protocol for performing universal gates in a register of superconducting qubits coupled by fixed on-chip linear reactances. The qubits have fixed, detuned Larmor frequencies and can remain, during the entire…
Cat-state qubits (qubits encoded with cat states) have recently drawn intensive attention due to their enhanced life times with quantum error correction. We here propose a method to implement a universal controlled-phase gate of two…
Implementation of logical entangling gates is an important step towards realizing a quantum computer. We use a gradient-based optimization approach to find single-qubit rotations which can be interleaved between applications of a noisy…
The circuit model of a quantum computer consists of sequences of gate operations between quantum bits (qubits), drawn from a universal family of discrete operations. The ability to execute parallel entangling quantum gates offers clear…
Achieving control over the electron spin in quantum dots (artificial atoms) or real atoms promises access to new technologies in conventional and in quantum information processing. Here we review our proposal for quantum computing with…
We propose a method for quantum computation which uses control of spin-orbit coupling in a linear array of single electron quantum dots. Quantum gates are carried out by pulsing the exchange interaction between neighboring electron spins,…
We propose the use of dipolar spin chains to enable long-range quantum logic between distant qubits. In our approach, an effective interaction between remote qubits is achieved by adiabatically following the ground state of the dipolar…
We analyze the operation of quantum gates for neutral atoms with qubits that are delocalized in space, i.e., the computational basis states are defined by the presence of a neutral atom in the ground state of one out of two trapping…
A common requirement of quantum simulations and algorithms is the preparation of complex states through sequences of 2-qubit gates. For a generic quantum state, the number of gates grows exponentially with the number of qubits, becoming…
Robust quantum computation with d-level quantum systems (qudits) poses two requirements: fast, parallel quantum gates and high fidelity two-qudit gates. We first describe how to implement parallel single qudit operations. It is by now well…