We demonstrate that in a coupled two-qubit system any single-qubit gate can be decomposed into two conditional two-qubit gates and that any conditional two-qubit gate can be implemented by a manipulation analogous to that used for a controlled two-qubit gate. Based on this we present a unified approach to implement universal single-qubit and two-qubit gates in a coupled two-qubit system with fixed always-on coupling. This approach requires neither supplementary circuit or additional physical qubits to control the coupling nor extra hardware to adjust the energy level structure. The feasibility of this approach is demonstrated by numerical simulation of single-qubit gates and creation of two-qubit Bell states in rf-driven inductively coupled two SQUID flux qubits with realistic device parameters and constant always-on coupling.
Non-adiabatic holonomic quantum computation has received increasing attention due to its robustness against control errors. However, all the previous schemes have to use at least two sequentially implemented gates to realize a general one-qubit gate. In this paper, we put forward a novelty scheme by which one can directly realize an arbitrary holonomic one-qubit gate with a single-shot implementation, avoiding the extra work of combining two gates into one. Based on a three-level model driven by laser pulses, we show that any single-qubit holonomic gate can be realized by varying the detuning,…
Quantum computers promise great improvements in solving problems such as factoring large integers, simulating quantum systems, and database searching. Using a photon as a quantum bit (qubit) is one of the most promising ways to realize a universal quantum computer because the coherent superposition state of a photon is very robust against various sources of decoherence. However, it is too difficult to realize two-qubit (photon) gates because it requires huge nonlinearity between photons. Here we show the realization of a controlled-NOT (CNOT) gate, the most important and elemental two-qubit ga…
Nonadiabatic holonomic quantum computation has received increasing attention due to its robustness against control errors as well as high-speed realization. The original protocol of nonadiabatic holonomic one-qubit gates has been experimentally demonstrated with superconducting transmon qutrit. However, the original protocol requires two noncommuting gates to realize an arbitrary one-qubit gate, which doubles the exposure time of gates to error sources and therefore makes the gates vulnerable to environment-induced decoherence. Single-shot protocol was subsequently proposed to realize an arbit…
Using geometric phases to realize noise-resilient quantum computing is an important method to enhance the control fidelity. In this work, we experimentally realize a universal nonadiabatic geometric quantum gate set in a superconducting qubit chain. We characterize the realized single- and two-qubit geometric gates with both quantum process tomography and randomized benchmarking methods. The measured average fidelities for the single-qubit rotation gates and two-qubit controlled-Z gate are 0.9977(1) and 0.977(9), respectively. Besides, we also experimentally demonstrate the noise-resilient fea…
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 creating real devices. It has been established that one can employ 'always on' interactions in a one-dimensional Heisenberg chain, provided that one can tune the Zeeman energies of the individual (pseudo-)spins. It is important to generalize this scheme to higher dimensional networks, since a real device would probably be of that kind. Such generalisations have be…
To realize one desired nonadiabatic holonomic gate, various equivalent evolution paths can be chosen. However, in the presence of errors, these paths become inequivalent. In this paper, we investigate the difference of these evolution paths in the presence of systematic Rabi frequency errors and aim to find paths with optimal robustness to realize one-qubit nonadiabatic holonomic gates. We focus on three types of evolution paths in the $Λ$ system: paths belonging to the original two-loop scheme [New J. Phys. {\bf 14}, 103035 (2012)], the single-loop multiple-pulse scheme [Phys. Rev. A {\bf 94}…
We report the realization of an elementary quantum processor based on a linear crystal of trapped ions. Each ion serves as a quantum bit (qubit) to store the quantum information in long lived electronic states. We present the realization of single-qubit and of universal two-qubit logic gates. The qwo-qubit operation relies on the coupling of the ions through their collective quantized motion. A detailed description of the setup and the methods is included.
We realize Surface Code quantum memories for nearest-neighbor qubits with always-on Ising interactions. This is done by utilizing multi-qubit gates that mimic the functionality of several gates. The previously proposed Surface Code memories rely on error syndrome detection circuits based on CNOT gates. In a two-dimensional planar architecture, to realize a two-qubit CNOT gate in the presence of couplings to other neighboring qubits, the interaction of the target qubit with its three other neighbors must cancel out. Here we present a new error syndrome detection circuit utilizing multi-qubit pa…
Because of using geometric phases, nonadiabatic geometric gates have the robustness against control errors. On the other hand, decoherence still affects nonadiabatic geometric gates, which is a key factor in reducing their fidelities. In this paper, we show that based on the system Hamiltonian that realizes a nonadiabatic geometric gate, one may construct a new system Hamiltonian, by using which not only the geometric feature of the nonadiabatic geometric gate is preserved, but also the system's coherence is protected. As a result, a coherence-protected nonadiabatic geometric gate is realized …
The universality theorem in quantum computing states that any quantum computational task can be decomposed into a finite set of logic gates operating on one and two qubits. However, the process of such decomposition is generally inefficient, often leading to exponentially many gates to realize an arbitrary computational task. Practical processor designs benefit greatly from availability of multi-qubit gates that operate on more than two qubits to implement the desired circuit. In 1995, Cirac and Zoller proposed a method to realize native multi-qubit controlled-$Z$ gates in trapped ion systems,…
We introduce an always-on, exchange-only qubit made up of three localized semiconductor spins that offers a true "sweet spot" to fluctuations of the quantum dot energy levels. Both single- and two-qubit gate operations can be performed using only exchange pulses while maintaining this sweet spot. We show how to interconvert this qubit to other three-spin encoded qubits as a new resource for quantum computation and communication.
Addressability of spin qubits in a silicon double quantum dot setup in the (1,1) charge configuration relies on having a large difference between the Zeeman splittings of the electrons. When the difference is not sufficiently large, the rotating wave approximation becomes inaccurate. We consider a device working in this regime, with always-on exchange coupling, and describe how a CZ gate and arbitrary one-qubit gates which are robust against charge noise can be implemented by smoothly pulsing the microwave source, while eliminating the crosstalk. We find that the most significant deviations fr…
To realize fault-tolerant quantum computing, it is necessary to store quantum information in logical qubits with error correction functions, realized by distributing a logical state among multiple physical qubits or by encoding it in the Hilbert space of a high-dimensional system. Quantum gate operations between these error-correctable logical qubits, which are essential for implementation of any practical quantum computational task, have not been experimentally demonstrated yet. Here we demonstrate a geometric method for realizing controlled-phase gates between two logical qubits encoded in p…
Non-Perturbative Geometric Framework for Single-Qubit Gates under Always-On Couplings
International Quantum Academy, Shenzhen（国际量子学院）；Southern University of Science and Technology, Shenzhen（南方科技大学）；Shenzhen Branch, Hefei National Laboratory, Shenzhen（合肥国家实验室深圳分部）
In this work, we provide an overview of circuits for quantum computing. We introduce gates used in quantum computation and then present resource cost measurements used to evaluate circuits made from these gates. We then illustrate how the gates shown are then combined into quantum circuits for basic arithmetic functions. Architectures for addition, subtraction, multiplication, and division are shown. We demonstrate how to calculate the resource costs of quantum circuits. We conclude this overview with by illustrating an application of the elementary quantum circuits for the image rotation oper…
We propose a scheme to realize a multiqubit tunable phase gate in a circuit QED setup where two resonators, each coupling with a qudit, are interconnected to a common qudit (d=4). In this proposal, only two levels of each qudit serve as the logical states and the other two levels are used for the gate realization. The proposal is efficient and simple because only a classical microwave pulse is needed, no matter how many qudits are involved, which significantly reduces experimental difficulty. In a nonresonant case, the tunable phase gate can be achieved readily, while under the resonant condit…
We construct a universal set of high fidelity quantum gates to be used on a sparse bipartite lattice with always-on Ising couplings. The gates are based on dynamical decoupling sequences using shaped pulses, they protect against low-frequency phase noise, and can be run in parallel on non-neighboring qubits. This makes them suitable for implementing quantum error correction with low-density parity check codes like the surface codes and their finite-rate generalizations. We illustrate the construction by simulating quantum Zeno effect with the $[[4,2,2]]$ toric code on a spin chain.
Benefiting from the excellent control of single photons realized by the emitter-photon-chiral couplings, we propose a novel potential photonic-quantum-computation scheme to perform the supervised learning tasks. The gates for photonic quantum computation are realized by properly designed atom-photon-chiral couplings. The quantum algorithm of supervised learning, composed by integrating the realized gates, is implemented by the tunable gate parameters. The learning ability is demonstrated by numerically simulating the performance of regression and classification tasks.
In ion traps, entangling gate operations can be realized by a bichromatic pair of laser beams that collectively interact with the ions. In this paper, a new method of modelling the laser-ion interaction is introduced that turns out to be superior to standard techniques for the description of gate operations on optical qubits. The treatment allows for a comparison of the performance of gates based on $σ_z\otimesσ_z$ and Mølmer-Sørensen interactions on optical transitions where the bichromatic laser field can be realized by an amplitude-modulated laser resonant with the qubit transition. Shaping…
We put forward a strategy to encode a quantum operation into the unmodulated dynamics of a quantum network without the need of external control pulses, measurements or active feedback. Our optimization scheme, inspired by supervised machine learning, consists in engineering the pairwise couplings between the network qubits so that the target quantum operation is encoded in the natural reduced dynamics of a network section. The efficacy of the proposed scheme is demonstrated by the finding of uncontrolled four-qubit networks that implement either the Toffoli gate, the Fredkin gate, or remote lo…
Nonadiabatic holonomic quantum computation has received increasing attention due to its robustness against control errors. However, all the previous schemes have to use at least two sequentially implemented gates to realize a general one-qubit gate. Based on two recent works, we construct two Hamiltonians and experimentally realized nonadiabatic holonomic gates by a single-shot implementation in a two-qubit nuclear magnetic resonance (NMR) system. Two noncommuting one-qubit holonomic gates, rotating along $\hat{x}$ and $\hat{z}$ axes respectively, are implemented by evolving a work qubit and a…
We re--investigate a plausible proposal for universal quantum gates in Kane's model, in which the authors assumed that electron spin is always downward under a background magnetic field and the value of controlling parameters is varied instantaneously. We demonstrate that a considerable error appears, for example, in the X rotation. As result, the controlled operations don't work. Such a failure is caused by improper choice of the computational bases; actually, the electron spin is not always downward over time during quantum operations.
Nonadiabatic geometric phases are only dependent on the evolution path of a quantum system but independent of the evolution details, and therefore quantum computation based on nonadiabatic geometric phases is robust against control errors. To realize nonadiabatic geometric quantum computation, it is necessary to ensure that the quantum system undergoes a cyclic evolution and the dynamical phases are removed from the total phases. To satisfy these conditions, the evolution paths in previous schemes are usually restricted to some special forms, e.g, orange-slice-shaped loops, which make the path…
We investigate an approach to universal quantum computation based on the modulation of longitudinal qubit-oscillator coupling. We show how to realize a controlled-phase gate by simultaneously modulating the longitudinal coupling of two qubits to a common oscillator mode. In contrast to the more familiar transversal qubit-oscillator coupling, the magnitude of the effective qubit-qubit interaction does not rely on a small perturbative parameter. As a result, this effective interaction strength can be made large, leading to short gate times and high gate fidelities. We moreover show how the gate …
We describe how a universal set of dynamically-corrected quantum gates can be implemented using sequences of shaped decoupling pulses on any qubit network forming a sparse bipartite graph with always-on Ising interactions. These interactions are constantly decoupled except when they are needed for two-qubit gates. We analytically study the error operators associated with the constructed gates up to third order in the Magnus expansion, analyze these errors numerically in the unitary time evolution of small qubit clusters, and give a bound on high-order errors for qubits on a large square lattic…
Topological quantum computation (TQC) is one of the most striking architectures that can realize fault-tolerant quantum computers. In TQC, the logical space and the quantum gates are topologically protected, i.e., robust against local disturbances. The topological protection, however, requires rather complicated lattice models and hard-to-manipulate dynamics; even the simplest system that can realize universal TQC--the Fibonacci anyon system--lacks a physical realization, let alone braiding the non-Abelian anyons. Here, we propose a disk model that can realize the Fibonacci anyon system, and c…
Nonadiabatic holonomic quantum computation provides the means to perform fast and robust quantum gates by utilizing the resilience of non-Abelian geometric phases to fluctuations of the path in state space. While the original scheme [New J. Phys. {\bf 14}, 103035 (2012)] needs two loops in the Grassmann manifold (i.e., the space of computational subspaces of the full state space) to generate an arbitrary holonomic one-qubit gate, we propose single-loop one-qubit gates that constitute an efficient universal set of holonomic gates when combined with an entangling holonomic two-qubit gate. Our on…
Nonadiabatic holonomic quantum computation uses non-Abelian geometric phases to implement a universal set of quantum gates that are robust against control imperfections and decoherence. Until now, a number of three-level-based schemes of nonadiabatic holonomic computation have been put forward, and several of them have been experimentally realized. However, all these works are based on the same class of nonadiabatic paths, which originates from the first nonadiabatic holonomic proposal. Here, we propose a universal set of nonadiabatic holonomic gates based on an extended class of nonadiabatic …
Microwave cavities coupled to superconducting qubits have been demonstrated to be a promising platform for quantum information processing. A major challenge in this setup is to realize universal control over the cavity. A promising approach are selective number-dependent arbitrary phase (SNAP) gates combined with cavity displacements. It has been proven that this is a universal gate set, but a central question remained open so far: how can a given target operation be realized efficiently with a sequence of these operations. In this work, we present a practical scheme to address this problem. I…
The big challenge in quantum computing is to realize scalable multi-qubit systems with cross-talk free addressability and efficient coupling of arbitrarily selected qubits. Quantum networks promise a solution by integrating smaller qubit modules to a larger computing cluster. Such a distributed architecture, however, requires the capability to execute quantum-logic gates between distant qubits. Here we experimentally realize such a gate over a distance of 60m. We employ an ancillary photon that we successively reflect from two remote qubit modules, followed by a heralding photon detection whic…
Quantum computation has attracted much attention, among other things, due to its potentialities to solve classical NP problems in polynomial time. For this reason, there has been a growing interest to build a quantum computer. One of the basic steps is to implement the quantum circuit able to realize a given unitary operation. This task has been solved using decomposition of unitary matrices in simpler ones till reach quantum circuits having only single-qubits and CNOTs gates. Usually the goal is to find the minimal quantum circuit able to solve a given problem. In this paper we go in a differ…
Nonadiabatic geometric quantum computation is dedicated to the realization of high-fidelity and robust quantum gates, which are necessary for fault-tolerant quantum computation. However, it is limited by cyclic and mutative evolution path, which usually requires longer gate-time and abrupt pulse control, weakening the gate performance. Here, we propose a scheme to realize geometric quantum gates with noncyclic and nonadiabatic evolution via invariant-based shortcuts, where universal quantum gates can be induced in one step without path mutation and the gate time is also effectively shortened. …
Nonadiabatic holonomic quantum computation in decoherence-free subspaces has attracted increasing attention recently, as it allows for high-speed implementation and combines both the robustness of holonomic gates and the coherence stabilization of decoherence-free subspaces. Since the first protocol of nonadiabatic holonomic quantum computation in decoherence-free subspaces, a number of schemes for its physical implementation have been put forward. However, all previous schemes require two noncommuting gates to realize an arbitrary one-qubit gate, which doubles the exposure time of gates to er…
We introduce a scheme for realizing arbitrary controlled-unitary operations in a two qubit system. If the 2 \times 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 val…
We show that a beam splitter of reflectivity one-third can be used to realize a quantum phase gate operation if only the outputs conserving the number of photons on each side are post-selected.
High-fidelity manipulation is the key for the physical realization of fault-tolerant quantum computation. Here, we present a protocol to realize universal nonadiabatic geometric gates for silicon-based spin qubits. We find that the advantage of geometric gates over dynamical gates depends crucially on the evolution loop for the construction of the geometric phase. Under appropriate evolution loops, both the geometric single-qubit gates and the CNOT gate can outperform their dynamical counterparts for both systematic and detuning noises. We also perform randomized benchmarking using noise ampli…
Geometric gates that use the global property of the geometric phase is believed to be a powerful tool to realize fault-tolerant quantum computation. However, for singlet-triplet qubits in semiconductor quantum dot, the low Rabi frequency of the microwave control leads to overly long gating time, and thus the constructing geometric gate suffers more from the decoherence effect. Here we investigate the key issue of whether the fast geometric gate can be realized for singlet-triplet qubits without introducing an extra microwave-driven pulse, while maintaining the high-fidelity gate operation at t…
We present a model to realize a probabilistic conditional sign flip gate using only linear optics. The gate operates in the space of number state qubits and is obtained by a nonconventional use of the teleportation protocol. Both a destructive and a nondestructive version of the gate are presented. In the former case an Hadamard gate on the control qubit is combined with a projective teleportation scheme mixing control and target. The success probability is 1/2. In the latter case we need a quantum encoder realized via the interaction of the control qubit with an ancillary state composed of tw…
We propose an experimentally feasible scheme to realize the nonlocal gate between two different quantum network nodes. With an entanglement-qubit (ebit) acts as a quantum channel, our scheme is resistive to actual environment noise and can get high fidelity in current cavity quantum electrodynamics (C-QED) system.
We generalize nonadiabatic holonomic quantum computation in a resonant $Λ$ configuration proposed in [New J. Phys. 14 (2012) 103035] to the case of off-resonant driving lasers. We show that any single-qubit holonomic gate can be realized by separately varying the detuning, amplitude, and phase of the lasers.
We propose a scheme to implement quantum controlled SWAP gates by directing single-photon pulses to a two-sided cavity with a single trapped atom. The resultant gates can be used to realize quantum fingerprinting and universal photonic quantum computation. The performance of the scheme is characterized under realistic experimental noise with the requirements well within the reach of the current technology.
We demonstrate the presence of genuine multipartite entanglement between the modes of quantum fields in non-uniformly moving cavities. The transformations generated by the cavity motion can be considered as multipartite quantum gates. We present two setups for which multi-mode entanglement can be generated for bosons and fermions. As a highlight we show that the bosonic genuine multipartite correlations can be resonantly enhanced. Our results provide fundamental insights into the structure of Bogoliubov transformations and suggest strong links between quantum information, quantum fields in cur…
We theoretically propose an alternative method to realize a deterministic SWAP gate using shortcuts to adiabatic passage based on the approach of Lewis- Riesenfeld invariants in cavity quantum electronic dynamics (QED). By combining Lewis-Riesenfeld invariants with quantum Zeno dynamics, the SWAP gate can be achieved deterministically. The strict numerical results show that our scheme is a fast and robust approach to achieve SWAP gate.
Unitary operations are expressed in the quantum circuit model as a finite sequence of elementary gates, such as controlled-not gates and single qubit gates. We prove that the simplified Toffoli gate by Margolus, which coincides with the Toffoli gate up to a single change of sign, cannot be realized with less than three controlled-not gates. If the circuit is implemented with three controlled-not gates, then at least four additional single qubit gates are necessary. This proves that the implementation suggested by Margolus is optimal.
In order to realize a Quantum CPU some schemes for executing fundamental mathematical tasks are needed. In this paper we present some quantum circuits which, using elementary arithmetic operations, allow an approximated calculation of continuous functions. Furthermore, we give an explicit example of our procedure applied to the exponential function.
We propose a method to achieve strong coupling between a spin ensemble and a large Josephson junctions (LJJ). Then, the strong coupling between two spin ensembles can be induced by a LJJ. A non-adiabatic holonomic single-qubit quantum gates is realized. Moreover, with the dispersive interaction between the spin ensembles and the LJJ, the high-fidelity two-qubit phase gate can be implemented with two spin ensembles within an operation time 0.41 ns and $π$ phase-swap gate can be realized within an operation time 103.11 ns with a high fidelity greater than 99%.
Quantum gates, which are the essential building blocks of quantum computers, are very fragile. Thus, to realize robust quantum gates with high fidelity is the ultimate goal of quantum manipulation. Here, we propose a nonadiabatic geometric quantum computation scheme on superconducting circuits to engineer arbitrary quantum gates, which share both the robust merit of geometric phases and the capacity to combine with optimal control technique to further enhance the gate robustness. Specifically, in our proposal, arbitrary geometric single-qubit gates can be realized on a transmon qubit, by a res…
High-fidelity quantum gates are essential for large-scale quantum computation, which can naturally be realized in a noise-resilient way. Geometric manipulation and decoherence-free subspace encoding are promising ways toward robust quantum computation. Here, by combining the advantages of both strategies, we propose and experimentally realize universal holonomic quantum gates in both a singleloop scheme and a composite scheme, based on nonadiabatic and non-Abelian geometric phases, in a decoherence-free subspace with nuclear magnetic resonance. Our experiment uses only two-body resonant spin-s…
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 controlled-U gate can be realized with two controlled-not gates and four single qubit gates. We prove that this implementation is optimal if and only if the matrix U satisfies the conditions tr U != 0, tr UX != 0, and det U != 1. We also derive optimal implementations in the non-generic cases.
