相关论文: Three-Qubit Gate Realization Using Single Quantum …
The controlled-not gate and the single qubit gates are considered elementary gates in quantum computing. It is natural to ask how many such elementary gates are needed to implement more elaborate gates or circuits. Recall that a…
The accurate implementation of quantum gates is essential for the realisation of quantum algorithms and digital quantum simulations. This accuracy may be increased on noisy hardware through the variational optimisation of gates, however the…
Accurate and efficient implementation of parallel quantum gates is crucial for scalable quantum information processing. However, the unavoidable crosstalk between qubits in current noisy processors impedes the achievement of high gate…
All quantum gates with one and two qubits may be described by elements of $Spin$ groups due to isomorphisms $Spin(3) \simeq SU(2)$ and $Spin(6) \simeq SU(4)$. However, the group of $n$-qubit gates $SU(2^n)$ for $n > 2$ has bigger dimension…
We study the computation power of lattices composed of two dimensional systems (qubits) on which translationally invariant global two-qubit gates can be performed. We show that if a specific set of 6 global two qubit gates can be performed,…
Two-qubit logical gates are proposed on the basis of two atoms trapped in a cavity setup. Losses in the interaction by spontaneous transitions are efficiently suppressed by employing adiabatic transitions and the Zeno effect. Dynamical and…
We study the resources required to achieve universal quantum computing via the gate sets that provide the fundamental instructions from which quantum algorithms are built. While single-gate universal sets are known, they rely on precisely…
The steady increase in control over individual quantum systems has backed the dream of a quantum technology that provides functionalities beyond any classical device. Two particularly promising applications have been explored during the…
Universal quantum gates and quantum error correction~(QEC) lie in the heart of quantum information science. Large-scale quantum computing depends on a universal set of quantum gates, in which some gates may be easily carried out, while…
The benefit of exchange-only qubits compared to other spin qubit types is the universal control using only voltage controlled exchange interactions between neighboring spins. As a compromise, qubit operations have to be constructed from…
To build a general-purpose quantum computer, it is crucial for the quantum devices to implement classical boolean logic. A straightforward realization of quantum boolean logic is to use auxiliary qubits as intermediate storage. This…
We determine the minimal number of qubits that it is necessary to have access to in order to transform Dicke states into other Dicke states. In general, the number of qubits in Dicke states cannot be increased via transformation gates by…
We consider the problem of time-optimal realization of the quantum Fourier transform gate for a single qudit with number of levels d from 3 to 8. As a qudit the quadrupole nucleus with spin I > 1/2 controlled by NMR is considered. We…
Universal gate sets for quantum computation, when single and two qubit operations are accessible, include both Hermitian and non-Hermitian gates. Here we utilize the fact that any single-qubit operator may be implemented as two Hermitian…
There are various gate sets that can be used to describe a quantum computation. A particularly popular gate set in the literature on quantum computing consists of arbitrary single-qubit gates and 2-qubit CNOT gates. A CNOT gate is however…
Recently there has been interest in the idea of quantum computing without control of the physical interactions between component qubits. This is highly appealing since the 'switching' of such interactions is a principal difficulty in…
The Toffoli gate is an important universal quantum gate, and will alongside the Clifford gates be available in future fault-tolerant quantum computing hardware. Many quantum algorithms rely on performing arbitrarily small single-qubit…
It is known that every two-qubit unitary operation has Schmidt rank one, two or four, and the construction of three-qubit unitary gates in terms of Schmidt rank remains an open problem. We explicitly construct the gates of Schmidt rank from…
Single-qubit operations on singlet-triplet qubits in GaAs double quantum dots have not yet reached the fidelities required for fault-tolerant quantum information processing. Considering experimentally important constraints and using…
We demonstrate an implementation scheme for constructing quantum gates using unitary evolutions of the one-dimensional spin-J ferromagnetic XXZ chain. We present numerical results based on simulations of the chain using the time-dependent…