Quantum Circuit Synthesis using a New Quantum Logic Gate Library of NCV Quantum Gates

Since Controlled-Square-Root-of-NOT (CV, CV^?) gates are not permutative quantum gates, many existing methods cannot effectively synthesize optimal 3-qubit circuits directly using the NOT, CNOT, Controlled-Square-Root-of-NOT quantum gate library (NCV), and the key of effective methods is the mapping of NCV gates to four-valued quantum gates. Firstly, we use NCV gates to create the new quantum logic gate library, which can be directly used to get the solutions with smaller quantum costs efficiently. Further, we present a novel generic method which quickly and directly constructs this new optimal quantum logic gate library using CNOT and Controlled-Square-Root-of-NOT gates. Finally, we present several encouraging experiments using these new permutative gates, and give a careful analysis of the method, which introduces a new idea to quantum circuit synthesis.     

High‐Fidelity Hybrid Quantum Gates between a Flying Photon and Diamond Nitrogen‐Vacancy Centers Assisted by Low‐Q Single‐Sided Cavities

High‐fidelity universal quantum gates are crucial in quantum computing. Three high‐fidelity universal quantum gates, namely the hybrid controlled NOT gate, the hybrid Toffoli gate, and the hybrid Fredkin gate, on a flying photon qubit and diamond nitrogen‐vacancy (NV) centers, assisted by low‐Q single‐sided cavities, are presented. Errors due to the imperfection of the practical input–output process are detected to improve the fidelity of these quantum gates, which therefore relaxes the requirement on their implementation, since strong coupling is no longer mandatory. In addition, quantum gates have the advantage that they can work faithfully even when the resonant condition among the NV center, the photon, and the cavity is not strictly satisfied, or the NV centers are not identical. The performance and success probability of these quantum gates are analyzed, finding that these schemes are feasible with current technology.     

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

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

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.     

Noncyclic nonadiabatic holonomic quantum gates via shortcuts to adiabaticity

High-fidelity quantum gates are essential for large-scale quantum computation. However, any quantum manipulation will inevitably affected by noises, systematic errors and decoherence effects, which lead to infidelity of a target quantum task. Therefore, implementing high-fidelity, robust and fast quantum gates is highly desired. Here, we propose a fast and robust scheme to construct high-fidelity holonomic quantum gates for universal quantum computation based on resonant interaction of three-level quantum systems via shortcuts to adiabaticity. In our proposal, the target Hamiltonian to induce noncyclic non-Abelian geometric phases can be inversely engineered with less evolution time and demanding experimentally, leading to high-fidelity quantum gates in a simple setup. Besides, our scheme is readily realizable in physical system currently pursued for implementation of quantum computation. Therefore, our proposal represents a promising way towards fault-tolerant geometric quantum computation.     

Scaling ion trap quantum computation through fast quantum gates

We propose a method to achieve scalable quantum computation based on fast quantum gates on an array of trapped ions, without the requirement of ion shuttling. Conditional quantum gates are obtained for any neighboring ions through spin-dependent acceleration of the ions from periodic photon kicks. The gates are shown to be robust to influence all the other ions in the array and insensitive to the ions' temperature.     

Braid topologies for quantum computation

In topological quantum computation, quantum information is stored in states which are intrinsically protected from decoherence, and quantum gates are carried out by dragging particlelike excitations (quasiparticles) around one another in two space dimensions. The resulting quasiparticle trajectories define world lines in three-dimensional space-time, and the corresponding quantum gates depend only on the topology of the braids formed by these world lines. We show how to find braids that yield a universal set of quantum gates for qubits encoded using a specific kind of quasiparticle which is particularly promising for experimental realization.     

Ballistic Aharonov–Bohm quantum bits and quantum gates

We propose an architecture to perform quantum computation, using ballistic electrons as qubits and coupled quantum rings as quantum gates. In the proposed architecture two adjacent one-dimensional wires, creating a single qubit, are connected to two coupled quantum rings, where the required magnetic flux is provided by enclosed nano-sized magnets. The phase modulation of the wave function of the ballistic electrons under the Aharonov–Bohm effect is carefully designed to facilitate reprogrammable and dynamically controllable quantum gates. Arbitrary single-qubit quantum gates with high fidelity can be constructed on the basis of this architecture.     

几何量子计算

实现可集成的量子计算的关键步骤是实现保真度足够高的一组普适量子逻辑门，最近几年发展的几何量子计算使用几何位相来实现量子逻辑门，其特点是利用几何位相的整体几何性质来避免某些局域的无规噪声的影响，从而实现较高保真度的量子门，文章先简要介绍常规几何量子逻辑门的概念，然后重点介绍最近提出的非常规几何量子计算：量子计算中使用的逻辑门的总位相既包含有几何位相，又包含有动力学位相，但它仅依赖于一些几何特征，而且，对于任意的量子位输入态，在量子门操作过程中积累的位相要么是零，要么是仅依赖几何特征的位相。     

量子过程神经网络模型算法及应用

为提高过程神经网络的逼近和泛化能力, 从研究过程神经元信息处理的量子计算实现机理入手, 提出基于量子旋转门及多位受控非门的物理意义构造量子过程神经元的新思想. 将离散化后的过程式输入信息作为受控非门的控制位, 经过量子旋转门作用后控制目标量子位的状态, 以目标量子位处于状态|1>概率幅作为量子过程神经元的输出. 以量子过程神经元为隐层, 普通神经元为输出层, 可构成量子过程神经网络. 基于量子计算机理推导了该模型的学习算法. 将该模型用于太阳黑子数年均值预测, 应用结果表明, 所提方法与普通过程神经网络相比, 预测精度有所提高, 对于复杂预测问题具有一定理论意义和实用价值.     

Practical scheme for quantum computation with any two-qubit entangling gate

Which gates are universal for quantum computation? Although it is well known that certain gates on two-level quantum systems (qubits), such as the controlled-not, are universal when assisted by arbitrary one-qubit gates, it has only recently become clear precisely what class of two-qubit gates is universal in this sense. We present an elementary proof that any entangling two-qubit gate is universal for quantum computation, when assisted by one-qubit gates. A proof of this result for systems of arbitrary finite dimension has been provided by Brylinski and Brylinski; however, their proof relies on a long argument using advanced mathematics. In contrast, our proof provides a simple constructive procedure which is close to optimal and experimentally practical.     

Universal quantum computation with qudits

Quantum circuit model has been widely explored for various quantum applications such as Shors algorithm and Grovers searching algorithm. Most of previous algorithms are based on the qubit systems. Herein a proposal for a universal circuit is given based on the qudit system, which is larger and can store more information. In order to prove its universality for quantum applications, an explicit set of one-qudit and two-qudit gates is provided for the universal qudit computation. The one-qudit gates are general rotation for each two-dimensional subspace while the two-qudit gates are their controlled extensions. In comparison to previous quantum qudit logical gates, each primitive qudit gate is only dependent on two free parameters and may be easily implemented. In experimental implementation, multilevel ions with the linear ion trap model are used to build the qudit systems and use the coupling of neighbored levels for qudit gates. The controlled qudit gates may be realized with the interactions of internal and external coordinates of the ion.     

Complete characterization of the directly implementable quantum gates used in the IBM quantum processors

Quantum process tomography (QPT) of each directly implementable quantum gate used in the IBM quantum processors is performed to compute gate error in order to check viability of complex quantum operations in the superconductivity-based quantum computers introduced by IBM. QPT of C-NOT gates is performed for three configurations available in IBM QX4. For the other allowed gates QPT have been performed for every allowed position (i.e., by placing the gates in different qubit lines) for IBM QX4 architecture, and thus, gate fidelities are obtained. Gate fidelities are observed to be lower than the corresponding values obtained in the other technologies, like NMR. Further, gate fidelities for all the single-qubit gates are obtained for IBM QX2 architecture by placing the gates in the third qubit line (q[2]). It's observed that the IBM QX4 architecture yields better gate fidelity compared to IBM QX2 in all cases except Y gate.     

Efficient decomposition of quantum gates

Optimal implementation of quantum gates is crucial for designing a quantum computer. We consider the matrix representation of an arbitrary multiqubit gate. By ordering the basis vectors using the Gray code, we construct the quantum circuit which is optimal in the sense of fully controlled single-qubit gates and yet is equivalent with the multiqubit gate. In the second step of the optimization, superfluous control bits are eliminated, which eventually results in a smaller total number of the elementary gates. In our scheme the number of controlled NOT gates is O(4(n)) which coincides with the theoretical lower bound.     

Efficient quantum arithmetic operation circuits for quantum image processing

Efficient quantum circuits for arithmetic operations are vital for quantum algorithms. A fault-tolerant circuit is required for a robust quantum computing in the presence of noise. Quantum circuits based on Clifford+T gates are easily rendered faulttolerant. Therefore, reducing the T-depth and T-Count without increasing the qubit number represents vital optimization goals for quantum circuits. In this study, we propose the fault-tolerant implementations for TR and Peres gates with optimized T-depth and T-Count. Next, we design fault-tolerant circuits for quantum arithmetic operations using the TR and Peres gates. Then,we implement cyclic and complete translations of quantum images using quantum arithmetic operations, and the scalar matrix multiplication. Comparative analysis and simulation results reveal that the proposed arithmetic and image operations are efficient.For instance, cyclic translations of a quantum image produce 50% T-depth reduction relative to the previous best-known cyclic translation.     

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.     

Quantum computation with trapped ions in an optical cavity

Two-qubit logical gates are proposed on the basis of two atoms trapped in a cavity setup and commonly addressed by laser fields. Losses in the interaction by spontaneous transitions are efficiently suppressed by employing adiabatic transitions and the quantum Zeno effect. Dynamical and geometrical conditional phase gates are suggested. This method provides fidelity and a success rate of its gates very close to unity. Hence, it is suitable for performing quantum computation.     

Erratum to: Measuring the tilt of primordial gravitational-wave power spectrum from observations

Geometric phases are only dependent on evolution paths but independent of evolution details so that they possess some intrinsic noise-resilience features. Based on different geometric phases, various quantum gates have been proposed, such as nonadiabatic geometric gates based on nonadiabatic Abelian geometric phases and nonadiabatic holonomic gates based on nonadiabatic nonAbelian geometric phases. Up to now, nonadiabatic holonomic one-qubit gates have been experimentally demonstrated with superconducting transmons, where the three lowest levels are all utilized in operation. However, the second excited state of transmons has a relatively short coherence time, which results in a decreased fidelity of quantum gates. Here, we experimentally realize Abelian-geometric-phase-based nonadiabatic geometric one-qubit gates with a superconducting Xmon qubit. The realization is performed on the two lowest levels of an Xmon qubit and thus avoids the influence from the short coherence time of the second excited state. The experimental result indicates that the average fidelities of single-qubit gates can be up to 99.6% and 99.7% characterized by quantum process tomography and randomized benchmarking.     

A proposal for the realization of universal quantum gates via superconducting qubits inside a cavity

A family of quantum logic gates is proposed via superconducting (SC) qubits coupled to a SC-cavity. The Hamiltonian for SC-charge qubits inside a single mode cavity is considered. Three- and two-qubit operations are generated by applying a classical magnetic field with the flux. Therefore, a number of quantum logic gates are realized. Numerical simulations and calculation of the fidelity are used to prove the success of these operations for these gates.     

High fidelity quantum gates via dynamical decoupling

Realizing the theoretical promise of quantum computers will require overcoming decoherence. Here we demonstrate numerically that high fidelity quantum gates are possible within a framework of quantum dynamical decoupling. Orders of magnitude improvement in the fidelities of a universal set of quantum gates, relative to unprotected evolution, is achieved over a broad range of system-environment coupling strengths, using recursively constructed (concatenated) dynamical decoupling pulse sequences.