Simplified approach to implementing controlled-unitary operations in a two-qubit system

Abstract

We introduce a scheme for realizing arbitrary controlled-unitary operations in a two-qubit system. If the 2 ϫ 2 unitary matrix is special unitary ͑has unit determinant͒, the controlled-unitary gate operation can be realized in a single pulse operation. The pulse in our scheme will constitute varying one of the parameters of the system between an arbitrarily maximum and a "calculated" minimum value. This parameter will constitute the variable parameter of the system while the other parameters, which include the coupling between the two qubits, will be treated as fixed parameters. The values of the parameters are what we solve for using our approach in order to realize an arbitrary controlled-unitary operation. We further show that the computational complexity of the operation is no greater than that required for a controlled-NOT ͑CNOT͒ gate. Since conventional schemes realize a controlled-unitary operation by breaking it into a sequence of single-qubit and CNOT gate operations, our method is an improvement because we not only require less time duration, but also fewer control lines to implement the same operation. To demonstrate improvement over other schemes, we show, as examples, how two controlled-unitary operations, one being the controlled-Hadamard gate, can be realized in a single pulse operation using our scheme. Furthermore, our method can be applied to a wide range of coupling schemes and can be used to realize gate operations between two qubits coupled via Ising, Heisenberg, and anisotropic interactions.

Realization of Surface Code Quantum Memory on Systems with Always-On Interactions

“…In this work, we considered the Hamiltonian with Ising interactions, however, the proposed gates can be realized for Hamiltonians with XX and YY interactions by simply interchanging the tunneling and bias values while coupling values and other parameters remain unchanged [7,15]. Furthermore, here we considered an arbitrary size 2D array of qubits to represent the application of multi-qubit parity gates in Surface Code schemes.…”

“…It is challenging to solve such a large matrix analytically in order to derive the system parameters. However, using a pulses bias scheme [14,15] and reduced Hamiltonian technique [16], we can solve the system parameters to realize a desired multi-qubit parity gate.…”

Nearest-neighbor architecture to overcome effects of qubit precessions in gate operations

“…This is because qubit A i is coupled to the |0〉 and the |1〉 qubits adjacent to it through the same coupling ξ 1 , and the relative phases due to the presence of each of these qubits cancel out. Next, we perform a Hadamard gate on qubit A i , where the bias on it is pulsed to a value Δ+ξ [43]. Again, no relative phases are picked up by qubit B i , now in the |0〉 state, since it is coupled to the |0〉 and |1〉 qubits on either side of it through the same coupling (−ξ 1 ).…”

Parity-based mirror inversion for efficient quantum state transfer and computation in nearest-neighbor arrays

“…Further, to match our parameter values with those in [50], we used the following values in our simulations: A j = 1 GHz, K12 = K2 3 = 866 MHz (or, equivalently, f | 2 = £23 = 866 MHz), and T = 1.25 ns. These values were obtained by scaling up the values obtained in a weak-coupling regime [53] PHYSICAL REVIEW A 91, 042310 (2015) by multiplying each parameter by a scaling factor of 40. This is because in increasing Aj from 25 MHz (value of tunneling solved for in Sec.…”

“…This is because in increasing Aj from 25 MHz (value of tunneling solved for in Sec. II and in [53]) to 1 GHz we have increased it 40 times. Note that in scaling the time required for each gate operation (P gate and DCN gate), we used Eq.…”