ﻻ يوجد ملخص باللغة العربية
This paper addresses the question how to implement a desired two-qubit gate U using a given tunable two-qubit entangling interaction H_int. We present a general method which is based on the K_1 A K_2 decomposition of unitary matrices in SU(4) to calculate analytically the smallest number of two-qubit gates U_int [based on H_int] and single-qubit rotations, and the explicit sequence of these operations that are required to implement U. We illustrate our protocol by calculating the implementation of (1) the transformation from standard basis to Bell basis, (2) the CNOT gate, and (3) the quantum Fourier transform for two kinds of interaction - Heisenberg exchange interaction and quantum inductive coupling - and discuss the relevance of our results for solid-state qubits.
Quantum computing based on spins in the solid state allows for densely-packed arrays of quantum bits. While high-fidelity operation of single qubits has been demonstrated with individual control pulses, the operation of large-scale quantum processors
Universal quantum computation will require qubit technology based on a scalable platform, together with quantum error correction protocols that place strict limits on the maximum infidelities for one- and two-qubit gate operations. While a variety of
We employ pulse shaping to abate single-qubit gate errors arising from the weak anharmonicity of transmon superconducting qubits. By applying shaped pulses to both quadratures of rotation, a phase error induced by the presence of higher levels is cor
We propose a fast, scalable all-optical design for arbitrary two-qubit operations for defect qubits in diamond (NV centers) and in silicon carbide, which are promising candidates for room temperature quantum computing. The interaction between qubits
The capacity of a quantum gate to produce entangled states on a bipartite system is quantified in terms of the entangling power. This quantity is defined as the average of the linear entropy of entanglement of the states produced after applying a qua