One-qubit Gates Research Articles

Generating a state t-design by diagonal quantum circuits

We investigate protocols for generating a state t-design by using a fixed separable initial state and a diagonal-unitary t-design in the computational basis, which is a t-design of an ensemble of diagonal unitary matrices with random phases as their eigenvalues. We first show that a diagonal-unitary t-design generates a -approximate state t-design, where N is the number of qubits. We then discuss a way of improving the degree of approximation by exploiting non-diagonal gates after applying a diagonal-unitary t-design. We also show that it is necessary and sufficient to use -qubit gates with random phases to generate a diagonal-unitary t-design by diagonal quantum circuits, and that each multi-qubit diagonal gate can be replaced by a sequence of multi-qubit controlled-phase-type gates with discrete-valued random phases. Finally, we analyze the number of gates for implementing a diagonal-unitary t-design by non-diagonal two- and one-qubit gates. Our results provide a concrete application of diagonal quantum circuits in quantum informational tasks.

Realization of quantum Fourier transform over ZN

Since the difficulty in preparing the equal superposition state of amplitude is 1/√N, we construct a quantile transform of quantum Fourier transform (QFT) over ZN based on the elementary transforms, such as Hadamard transform and Pauli transform. The QFT over ZN can then be realized by the quantile transform, and used to further design its quantum circuit and analyze the requirements for the quantum register and quantum gates. However, the transform needs considerable quantum computational resources and it is difficult to construct a high-dimensional quantum register. Hence, we investigate the design of t-bit quantile transform, and introduce the definition of t-bit semiclassical QFT over ZN. According to probability amplitude, we prove that the transform can be used to realize QFT over ZN and further design its quantum circuit. For this transform, the requirements for the quantum register, the one-qubit gate, and two-qubit gate reduce obviously when compared with those for the QFT over ZN.

Implementing discrete quantum Fourier transform via superconducting qubits coupled to a superconducting cavity

A new physical scheme for implementing an N-bit discrete quantum Fourier transform (DQFT) is proposed via superconducting (SC) qubits coupled to a single-mode SC cavity. Two-qubit and one-qubit gates as well as a new two-qubit gate are realized. Such gates are used for implementing the algorithm of N-bit DQFT. We propose and analyze a detailed experimental procedure for implementing the algorithm and compute the fidelity measure to quantify the success of this algorithm. Estimates show that the protocol can be successfully implemented within the present experimental limits.

Approximation of realistic errors by Clifford channels and Pauli measurements

The Gottesman-Knill theorem allows for the efficient simulation of stabilizer-based quantum error-correction circuits. Errors in these circuits are commonly modeled as depolarizing channels by using Monte Carlo methods to insert Pauli gates randomly throughout the circuit. Although convenient, these channels are poor approximations of common, realistic channels such as amplitude damping. Here we analyze a larger set of efficiently simulable error channels by allowing the random insertion of any one-qubit gate or measurement that can be efficiently simulated within the stabilizer formalism. Our error channels are shown to be a viable method for accurately approximating realistic error channels.

Non-fault-tolerantTgates for the [7,1,3] quantum error-correction code

We simulate the implementation of a $T$ gate, or $\frac{\ensuremath{\pi}}{8}$ gate, for a [7,1,3] encoded logical qubit in a nonequiprobable error environment. We demonstrate that the use of certain non-fault-tolerant methods in the implementation may nevertheless enable reliable quantum computation while reducing basic resource consumption. Reliability is determined by calculating gate fidelities for the one-qubit logical gate. Specifically, we show that despite using a non-fault-tolerant procedure in constructing a logical zero ancilla to implement the $T$ gate, the gate fidelity of the logical gate, after perfect error correction, has no first order error terms. Meaning, any errors that may have occurred during implementation are ``correctable'' and fault tolerance may still be achieved.

Minimal and robust composite two-qubit gates with Ising-type interaction

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 with the minimal number ($N=3$) of elementary two-qubit gates and several one-qubit gates. It is noteworthy that all the robust circuits can be mapped to one-qubit circuits robust against a pulse length error. We also prove that a minimal robust swap gate cannot be constructed with $N=3$ but requires $N=6$ elementary two-qubit gates.

Dirac four-potential tunings-based quantum transistor utilizing the Lorentz force

We propose a mathematical model of \textit{quantum} transistor in which bandgap engineering corresponds to the tuning of Dirac potential in the complex four-vector form. The transistor consists of $n$-relativistic spin qubits moving in \textit{classical} external electromagnetic fields. It is shown that the tuning of the direction of the external electromagnetic fields generates perturbation on the potential temporally and spatially, determining the type of quantum logic gates. The theory underlying of this scheme is on the proposal of the intertwining operator for Darboux transfomations on one-dimensional Dirac equation amalgamating the \textit{vector-quantum gates duality} of Pauli matrices. Simultaneous transformation of qubit and energy can be accomplished by setting the $\{\textit{control, cyclic}\}$-operators attached on the coupling between one-qubit quantum gate: the chose of \textit{cyclic}-operator swaps the qubit and energy simultaneously, while \textit{control}-operator ensures the energy conservation.

Two-dimensional Affleck-Kennedy-Lieb-Tasaki state on the honeycomb lattice is a universal resource for quantum computation

Universal quantum computation can be achieved by simply performing single-qubit measurements on a highly entangled resource state. Resource states can arise from ground states of carefully designed two-body interacting Hamiltonians. This opens up an appealing possibility of creating them by cooling. The family of Affleck-Kennedy-Lieb-Tasaki (AKLT) states are the ground states of particularly simple Hamiltonians with high symmetry, and their potential use in quantum computation gives rise to a new research direction. Expanding on our prior work [T.-C. Wei, I. Affleck, and R. Raussendorf, Phys. Rev. Lett. 106, 070501 (2011)], we give detailed analysis to explain why the spin-3/2 AKLT state on a two-dimensional honeycomb lattice is a universal resource for measurement-based quantum computation. Along the way, we also provide an alternative proof that the 1D spin-1 AKLT state can be used to simulate arbitrary one-qubit unitary gates. Moreover, we connect the quantum computational universality of 2D random graph states to their percolation property and show that these states whose graphs are in the supercritical (i.e. percolated) phase are also universal resources for measurement-based quantum computation.

CATHODOLUMINESCENCE AND PHOTOLUMINESCENCE OF NV CENTERS

Nitrogen-vacancy (NV) centers in diamond are a promising candidate as a solid state qubit memory for quantum information as they possess very long coherence times even at room temperature. Furthermore, NV centers are very sensitive to their electromagnetic environment and are addressable in the GHz frequency range. Here we review our progress towards the detection of single NV centers for the implementation of fast on demand coupling between NV centers and GHz electromagnetic fields. Precisely, we present efforts towards mapping NV centers with a cathodoluminescence setup. Developing such capability is important for patterning local one-qubit gates for the application of high amplitude electromagnetic fields as a tuning parameter.

Randomized Benchmarking of Multiqubit Gates

We describe an extension of single-qubit gate randomized benchmarking that measures the error of multiqubit gates in a quantum information processor. This platform-independent protocol evaluates the performance of Clifford unitaries, which form a basis of fault-tolerant quantum computing. We implemented the benchmarking protocol with trapped ions and found an error per random two-qubit Clifford unitary of 0.162±0.008, thus setting the first benchmark for such unitaries. By implementing a second set of sequences with an extra two-qubit phase gate inserted after each step, we extracted an error per phase gate of 0.069±0.017. We conducted these experiments with transported, sympathetically cooled ions in a multizone Paul trap-a system that can in principle be scaled to larger numbers of ions.

Effects of noisy quantum channels on one-qubit rotation gate

We investigate the effects of noisy quantum channels on the entanglement of cluster states and one way quantum computational gates. We take a basic model, the rotational gate about x axis based on the cluster state, in order to get the most essential effects of the paradigmatic noisy quantum channels. The entanglement of cluster states in the noisy channels and the fidelity between the rotated state without noisy channel and that with noisy channel are calculated.

One-qubit quantum gates associated with topological defects in solids

We show a new proposal for implementing one-qubit quantum gates in a solid associated with the presence of topological defects. We discuss a new way of obtaining quantum holonomies for a spin-half particle, and the implementation of a set of one-qubit quantum gates based on the topological phases provided by the presence of a defect in a crystalline solid.

Frequency-based Quantum Computers from a Chemist's Perspective

Quantum computer elements are often designed and tested using molecular or nanoscopic components that form registers of qubits in which memory is stored and information processed. Often such registers are probed and manipulated using frequency-based techniques such as nuclear-magnetic resonance spectroscopy. A major challenge is to design molecules to act as these registers. We provide a basis for rational molecular design through consideration of the generic spectroscopic properties required for quantum computing, bypassing the need for intricate knowledge of the way these molecules are used spectroscopically. Designs in which two-qubit gate times scale similarly to those for one-qubit gates are presented. The specified spectroscopic requirements are largely independent of the type of spectroscopy used (e.g. magnetic resonance or vibrational) and are often independent of technical details of the application (e.g. broadband or high-resolution spectroscopy). This should allow the design of much larger quantum registers than have currently been demonstrated.

Holonomic quantum computation based on the scalar Aharonov–Bohm effect for neutral particles and linear topological defects

We discuss holonomic quantum computation based on the scalar Aharonov–Bohm effect for a neutral particle. We show that the interaction between the magnetic dipole moment and external fields yields a non-abelian quantum phase allowing us to make any arbitrary rotation on a one-qubit. Moreover, we show that the interaction between the magnetic dipole moment and a magnetic field in the presence of a topological defect yields an analogue effect of the scalar Aharonov–Bohm effect for a neutral particle, and a new way of building one-qubit quantum gates.

Scalable Neutral Atom Quantum Computer with Interaction on Demand: Proposal for Selective Application of Two-Qubit Gate

We propose a scalable neutral atom quantum computer with an on-demand interaction through a selective two-qubit gate operation. Atoms are trapped by a lattice of near field Fresnel diffraction lights so that each trap captures a single atom. One-qubit gate operation is implemented by a gate control laser beam which is applied to an individual atom. Two-qubit gate operation between an arbitrary pair of atoms is implemented by sending these atoms to a state-dependent optical lattice and making them collide so that a particular two-qubit state acquires a dynamical phase. We give numerical evaluations corresponding to these processes, from which we estimate the upper bound of a two-qubit gate operation time and corresponding gate fidelity. Our proposal is feasible within currently available technology developed in cold atom gas, MEMS, nanolithography, and various areas in optics.

Quantum holonomies for an electric dipole moment

In this Letter, we obtain the quantum holonomies for a neutral particle with a permanent electric dipole moment based on the analogue effects of the He–McKellar–Wilkens effect and the Scalar Aharonov–Bohm effect and show a new proposal for implementing one-qubit quantum gates.

Nanodevice for High Precision Readout of Electron Spin

The essential components of a quantum computer are quantum bits (qubits) and an appropriate set of quantum gates. The spin state of electron confined in a semiconductor heterostructure is well suited for physical realization of a quantum bit [1, 2]. There has been widespread search for nanodevices, which could perform logical operations on such states [3–5]. So far the majority of proposed solutions for achieving transitions between different spin states require the application of external microwaves. It is the simplest method of processing information stored in an isolated qubit, but applying it to perform selective operations on single qubit, being part of a many-qubit register is not possible. In order to overcome this problem, we recently proposed the realization of one-qubit logical gates, without the usage of microwaves [6, 7]. The main idea of our method is to obtain the spin rotation by the spin–orbit coupling during electron’s motion in closed trajectories, which are determined by the metal electrodes deposited on top of a semiconductor heterostructure. The operations are triggered by applying low voltages to the gates. We have simulated operation of the basic one-qubit quantum gates: negation, Hadamard and phase shift [6, 7]. Two of the problems that remain to be solved are: setting electron’s spin in the desired orientation before the logical operation and precise read-out of the quantum computation results. In this paper we put forward the design of a nanodevice which could serve as an electron spin filter to accumulate electrons in a given spin state in order to set the initial value of qubit and its read-out after quantum computation.

Optimal preparation of graph states

We show how to prepare any graph state of up to 12 qubits with: (a) the minimum number of controlled-Z gates, and (b) the minimum preparation depth. We assume only one-qubit and controlled-Z gates. The method exploits the fact that any graph state belongs to an equivalence class under local Clifford operations. We extend up to 12 qubits the classification of graph states according to their entanglement properties, and identify each class using only a reduced set of invariants. For any state, we provide a circuit with both properties (a) and (b), if it does exist, or, if it does not, one circuit with property (a) and one with property (b), including the explicit one-qubit gates needed.

Block-based quantum-logic synthesis

In this paper, the problem of constructing an efficient quantum circuit for the imple-mentation of an arbitrary quantum computation is addressed. To this end, a basic blockbased on the cosine-sine decomposition method is suggested which contains l qubits.In addition, a previously proposed quantum-logic synthesis method based on quantumShannon decomposition is recursively applied to reach unitary gates over l qubits. Then,the basic block is used and some optimizations are applied to remove redundant gates.It is shown that the exact value of l affects the number of one-qubit and CNOT gates inthe proposed method. In comparison to the previous synthesis methods, the value of l isexamined consequently to improve either the number of CNOT gates or the total numberof gates. The proposed approach is further analyzed by considering the nearest neighborlimitation. According to our evaluation, the number of CNOT gates is increased by atmost a factor of 5/3 if the nearest neighbor interaction is applied.

Block-based quantum-logic synthesis

In this paper, the problem of constructing an efficient quantum circuit for the implementation of an arbitrary quantum computation is addressed. To this end, a basic block based on the cosine-sine decomposition method is suggested which contains $l$ qubits. In addition, a previously proposed quantum-logic synthesis method based on quantum Shannon decomposition is recursively applied to reach unitary gates over $l$ qubits. Then, the basic block is used and some optimizations are applied to remove redundant gates. It is shown that the exact value of $l$ affects the number of one-qubit and CNOT gates in the proposed method. In comparison to the previous synthesis methods, the value of $l$ is examined consequently to improve either the number of CNOT gates or the total number of gates. The proposed approach is further analyzed by considering the nearest neighbor limitation. According to our evaluation, the number of CNOT gates is increased by at most a factor of $\frac{5}{3}$ if the nearest neighbor interaction is applied.