飞秒激光直写光量子逻辑门

量子比特在同一时刻可处于所有可能状态上的叠加特性使得量子计算机具有天然的并行计算能力,在处理某些特定问题时具有超越经典计算机的明显优势.飞秒激光直写技术因其具有单步骤高效加工真三维光波导回路的能力,在制备通用型集成光量子计算机的基本单元—量子逻辑门中发挥着越来越重要的作用.本文综述了飞秒激光直写由定向耦合器构成的光量子比特逻辑门的进展.主要包括定向耦合器的功能、构成、直写和性能表征,集成波片、哈达玛门和泡利交换门等单量子比特逻辑门、受控非门和受控相位门等两量子比特逻辑门的直写加工,并对飞秒激光加工三量子比特逻辑门进行了展望.     

Exact two-qubit universal quantum circuit

We provide an analytic way to implement any arbitrary two-qubit unitary operation, given an entangling two-qubit gate together with local gates. This is shown to provide explicit construction of a universal quantum circuit that exactly simulates arbitrary two-qubit operations in SU(4). Each block in this circuit is given in a closed form solution. We also provide a uniform upper bound of the applications of the given entangling gates, and find that exactly half of all the controlled-unitary gates satisfy the same upper bound as the CNOT gate. These results allow for the efficient implementation of operations in SU(4) required for both quantum computation and quantum simulation.     

Realization of arbitrary two-qubit quantum gates based on chiral Majorana fermions

Quantum computers are in hot-spot with the potential to handle more complex problems than classical computers can.Realizing the quantum computation requires the universal quantum gate set {T,H,CNOT} so as to perform any unitary transformation with arbitrary accuracy.Here we first briefly review the Majorana fermions and then propose the realization of arbitrary two-qubit quantum gates based on chiral Majorana fermions.Elementary cells consist of a quantum anomalous Hall insulator surrounded by a topological superconductor with electric gates and quantum-dot structures,which enable the braiding operation and the partial exchange operation.After defining a qubit by four chiral Majorana fermions,the singlequbit T and H quantum gates are realized via one partial exchange operation and three braiding operations,respectively.The entangled CNOT quantum gate is performed by braiding six chiral Majorana fermions.Besides,we design a powerful device with which arbitrary two-qubit quantum gates can be realized and take the quantum Fourier transform as an example to show that several quantum operations can be performed with this space-limited device.Thus,our proposal could inspire further utilization of mobile chiral Majorana edge states for faster quantum computation.     

Experimental realization of single-shot nonadiabatic holonomic gates in nuclear spins

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 reports,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 x?and z?axes respectively,are implemented by evolving a work qubit and an ancillary qubit nonadiabatically following a quantum circuit designed.Using a sequence compiler developed for NMR quantum information processor,we optimize the whole pulse sequence,minimizing the total error of the implementation.Finally,all the nonadiabatic holonomic gates reach high unattenuated experimental fidelities over 98%.     

Quantum logic gates for coupled superconducting phase qubits

Based on a quantum analysis of two capacitively coupled current-biased Josephson junctions, we propose two fundamental two-qubit quantum logic gates. Each of these gates, when supplemented by single-qubit operations, is sufficient for universal quantum computation. Numerical solutions of the time-dependent Schr?dinger equation demonstrate that these operations can be performed with good fidelity.     

Virtual qubits: Multilevels instead of multiparticles

The possibility of using multilevel quantum systems with a discrete nonequidistant spectrum for the physical implementation of a universal collection of quantum gates, which is required for constructing an arbitrary algorithm for a quantum computer, is studied on the basis of the proposed virtual-spin formalism. It is shown that such a set of gates, including two-qubit gates, can be constructed on a single spin-3/2 nucleus. The assertion that three-qubit gates can also be realized on a single spin-7/2 quantum particle is substantiated.     

Programmable networks for quantum algorithms

The implementation of a quantum computer requires the realization of a large number of N-qubit unitary operations which represent the possible oracles or which are part of the quantum algorithm. Until now there have been no standard ways to uniformly generate whole classes of N-qubit gates. We develop a method to generate arbitrary controlled phase-shift operations with a single network of one-qubit and two-qubit operations. This kind of network can be adapted to various physical implementations of quantum computing and is suitable to realize the Deutsch-Jozsa algorithm as well as Grover's search algorithm.     

Fast holonomic quantum computation based on solid-state spins with all-optical control

Holonomic quantum computation is a quantum computation strategy that promises some built-in noise-resilience features. Here, we propose a scheme for nonadiabatic holonomic quantum computation with nitrogen-vacancy center electron spins, which are characterized by fast quantum gates and long qubit coherence times. By varying the detuning, amplitudes, and phase difference of lasers applied to a nitrogen-vacancy center, one can directly realize an arbitrary single-qubit holonomic gate on the spin. Meanwhile, with the help of cavity-assisted interactions, a nontrivial two-qubit holonomic quantum gate can also be induced. The distinct merit of this scheme is that all the quantum gates are obtained via an all-optical geometric manipulation of the solid-state spins. Therefore, our scheme opens the possibility for robust quantum computation using solid-state spins in an all-optical way.     

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.     

Two-qubit pure state tomography by five product orthonormal bases

In this paper, we focus on two-qubit pure state tomography. For an arbitrary unknown two-qubit pure state, separable or entangled, it has been found that the measurement probabilities of 16 projections onto the tensor products of Pauli eigenstates are enough to uniquely determine the state. Moreover, these corresponding product states are arranged into five orthonormal bases. We design five quantum circuits, which are decomposed into the common gates in universal quantum computation, to simulate the five projective measurements onto these bases. At the end of each circuit, we measure each qubit with the projective measurement {|00 |,|1,1| }. Then, we consider the open problem whether three orthonormal bases are enough to distinguish all two-qubit pure states. A necessary condition is given. Suppose that there are three orthonormal bases {B_1,B_2,B_3}. Denote the unitary transition matrices from B_1 to {B_2,B_3 } as U1 and U2. All 32 elements of matrices U_1 and U_2 should not be zero. If not, these three bases cannot distinguish all two-qubit pure states.     

Nonadiabatic geometric quantum computation with optimal control on superconducting circuits

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 resonant microwave field driving, with both the amplitude and phase of the driving being timedependent. Meanwhile, nontrivial two-qubit geometric gates can be implemented by two capacitively coupled transmon qubits, with one of the transmon qubits’ frequency being modulated to obtain effective resonant coupling between them. Therefore, our scheme provides a promising step towards fault-tolerant solid-state quantum computation.     

State-Independent Geometric Quantum Gates via Nonadiabatic and Noncyclic Evolution

Geometric phases are robust to local noises and the nonadiabatic ones can reduce the evolution time, thus nonadiabatic geometric gates have strong robustness and can approach high fidelity. However, the advantage of geometric phase has not been fully explored in previous investigations. Here,a scheme is proposed for universal quantum gates with pure nonadiabatic and noncyclic geometric phases from smooth evolution paths. In the scheme, only geometric phase can be accumulated in a fast way, and thus it not only fully utilizes the local noise resistant property of geometric phase but also reduces the difficulty in experimental realization. Numerical results show that the implemented geometric gates have stronger robustness than dynamical gates and the geometric scheme with cyclic path. Furthermore, it proposes to construct universal quantum gate on superconducting circuits, with the fidelities of single-qubit gate and nontrivial two-qubit gate can achieve 99.97% and 99.87%, respectively. Therefore, these high-fidelity quantum gates are promising for large-scale fault-tolerant quantum computation.     

Minimum construction of two-qubit quantum operations

Optimal construction of quantum operations is a fundamental problem in the realization of quantum computation. We here introduce a newly discovered quantum gate, B, that can implement any arbitrary two-qubit quantum operation with minimal number of both two- and single-qubit gates. We show this by giving an analytic circuit that implements a generic nonlocal two-qubit operation from just two applications of the B gate. Realization of the B gate is illustrated with an example of charge-coupled superconducting qubits for which the B gate is seen to be generated in shorter time than the CNOT gate.     

高维辅助的普适量子线路优化

受到Lanyon等(Lanyon B P et al 2008 Nature Physics. 5 134)利用高维Hilbert空间成功简化Toffoli门的启发, 本文将辅助维度应用到普适量子线路中, 结合Cosine-Sine Decomposition(CSD), Quantum Shannon Decomposition(QSD)等矩阵分解方法, 优化了两比特和三比特普适幺正量子线路, 给出了计算n比特普适量子线路复杂度的公式, 并利用线性光学和腔QED系统设计了实验方案. 结果表明, 两比特和三比特量子线路的复杂度已分别接近和优于目前最优结果, 且随着比特数的增加, 本方案的优势愈加明显.     

Quantum computation in a decoherence-free subspace with superconducting devices

We propose a scheme to implement quantum computation in decoherence-free subspace with superconducting devices inside a cavity by unconventional geometric manipulation. Universal single-qubit gates in encoded qubit can be achieved with cavity assisted interaction. A measurement-based two-qubit Controlled-Not gate is produced with parity measurements assisted by an auxiliary superconducting device and followed by prescribed single-qubit gates. The measurement of currents on two parallel devices can realize a projective measurement, which is equivalent to the parity measurement on the involved devices.     

Scheme for realizing quantum computation and quantum information transfer with superconducting qubits coupling to a 1D transmission line resonator

This paper proposes a simple scheme for realizing one-qubit and two-qubit quantum gates as well as multiqubit entanglement based on dc-SQUID charge qubits through the control of their coupling to a 1D transmission line resonator (TLR). The TLR behaves effectively as a quantum data-bus mode of a harmonic oscillator, which has several practical advantages including strong coupling strength, reproducibility, immunity to 1/f noise, and suppressed spontaneous emission. In this protocol, the data-bus does not need to stay adiabatically in its ground state, which results in not only fast quantum operation, but also high-fidelity quantum information processing. Also, it elaborates the transfer process with the 1D transmission line.     

A Scheme for Simulation of Quantum Gates byAbelian Anyons

Anyons can be used to realize quantum computation, because they are two-level systems in two dimensions. In this paper, we propose a scheme to simulate single-qubit gates and CNOT gate using Abelian anyons in the Kitaev model. Two pairs of anyons (six spins) are used to realize single-qubit gates, while ten spins are needed for the CNOT gate. Based on these quantum gates, we show how to realize the Grover algorithm in a two-qubit system.     

Modified Khaneja--Glaser Decomposition and Realization of Three-Qubit Quantum Gate

Optimal implementation of quantum gates is crucial for realization of quantum computation. We slightly modify the Khaneja-Glaser decomposition （KGD） for n-qubits and give a new Cartan subalgbra in the second step of the decomposition. Based on this modified KGD, we investigate the realization of three-qubit logic gate and obtain the result that a general three-qubit quantum logic gate can be implemented using at most 73 one-qubit gates rotations with respect to the y and z axes and 26 CNOT gates.     

Cavity-assisted quantum computing in a silicon nanostructure

We present a scheme of quantum computing with charge qubits corresponding to one excess electron shared between dangling-bond pairs of surface silicon atoms that couple to a microwave stripline resonator on a chip. By choosing a certain evolution time, we propose the realization of a set of universal single-and two-qubit logical gates. Due to its intrinsic stability and scalability, the silicon dangling-bond charge qubit can be regarded as one of the most promising candidates for quantum computation. Compared to the previous schemes on quantum computing with silicon bulk systems, our scheme shows such advantages as a long coherent time and direct control and readout.     

A scheme for realizing a distant two-qubit controlled-U gate with nearest qubit-qubit interaction

We propose a new scheme for realizing a distant two-qubit controlled-U gate with nearest qubit-qubit interaction. The present scheme does not need measurement. Furthermore, it is noted that the two-qubit CNOT gates required by the scheme are greatly reduced when compared with the conventional method based on SWAP operations. The scheme is useful in quantum computing with solid-state systems where only interaction between nearest systems is available.