Quantum computing with trapped ions

Quantum computers hold the promise of solving certain computational tasks much more efficiently than classical computers. We review recent experimental advances towards a quantum computer with trapped ions. In particular, various implementations of qubits, quantum gates and some key experiments are discussed. Furthermore, we review some implementations of quantum algorithms such as a deterministic teleportation of quantum information and an error correction scheme.     

Quantum Fourier Transform-Based Arithmetic Logic Unit on a Quantum Processor

This study proposes and construct a primitive quantum arithmetic logic unit (qALU) based on the quantum Fourier transform (QFT). The qALU is capable of performing arithmetic ADD (addition) and logic NAND gate operations. It designs a scalable quantum circuit and presents the circuits for driving ADD and NAND operations on two-input and four-input quantum channels, respectively. By comparing the required number of quantum gates for serial and parallel architectures in executing arithmetic addition, it evaluates the performance. It also execute the proposed quantum Fourier transform-based qALU design on real quantum processor hardware provided by IBM. The results demonstrate that the proposed circuit can perform arithmetic and logic operations with a high success rate. Furthermore, it discusses in detail the potential implementations of the qALU circuit in the field of computer science, highlighting the possibility of constructing a soft-core processor on a quantum processing unit.     

Implementation of a Quantum Conditional Phase Gate for the Quantum Fourier Transform in Circuit QED

It is well known that multiple superconducting charge qubits coupled to a transmission line resonator can be controlled to achieve quantum logic gates between two arbitrary qubits. We propose a scheme to realize a quantum conditional phase gate with a geometric property by circuit electrodynamics, and it is applied naturally to reaJize the quantum Fourier transform with high fidelity. It is also demonstrated that the application is feasible and considerable under the present experimental technology.     

Deterministic implementations of fermionic quantum SWAP and Fredkin gates for spin qubits based on charge detection

We propose a scheme to implement fermionic quantum SWAP and Fredkin gates for spin qubits with the aid of charge detection. The scheme is deterministic without the need of qubit–qubit interaction, and the proposed setups consist of simple polarizing beam splitters, single-spin rotations, and charge detectors. Compared with linear optics quantum computation, this charge-measurement-based qubit scheme greatly enhances the success probability for im- plementing quantum SWAP and Fredkin gates and greatly simplifies the experimental realization of scalable quantum computers with noninteracting electrons.     

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

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

A Spatial Domain Quantum Watermarking Scheme

This paper presents a spatial domain quantum watermarking scheme. For a quantum watermarking scheme, a feasible quantum circuit is a key to achieve it. This paper gives a feasible quantum circuit for the presented scheme. In order to give the quantum circuit, a new quantum multi-control rotation gate, which can be achieved with quantum basic gates, is designed. With this quantum circuit, our scheme can arbitrarily control the embedding position of watermark images on carrier images with the aid of auxiliary qubits. Besides reversely acting the given quantum circuit, the paper gives another watermark extracting algorithm based on quantum measurements. Moreover, this paper also gives a new quantum image scrambling method and its quantum circuit. Differ from other quantum watermarking schemes, all given quantum circuits can be implemented with basic quantum gates. Moreover, the scheme is a spatial domain watermarking scheme, and is not based on any transform algorithm on quantum images. Meanwhile, it can make sure the watermark be secure even though the watermark has been found. With the given quantum circuit, this paper implements simulation experiments for the presented scheme. The experimental result shows that the scheme does well in the visual quality and the embedding capacity.     

Quantum computers on multiatomic ensembles in quantum electrodynamic cavity

Schemes for the construction of quantum computers on multiatomic ensembles in quantum electrodynamic cavity are considered. With that, both encoding of physical qubits on each separate multiatomic ensemble and logical encoding of qubits on the pairs of ensembles are introduced. Possible constructions of swapping (SWAP, \(\sqrt {SWAP} \)) and controlled swapping gates (CSWAP) are analyzed. Mechanism of collective blockade and dynamical elimination procedure are proposed for realization of these gates. The comparison of the scheme solutions is carried out for the construction of quantum computer at using of physical and logical qubits.     

Quantum computation and simulation with superconducting qubits

Superconducting circuits based on Josephson junctions are regarded as one of the most promising technologies for the implementation of scalable quantum computers. This review presents the basic principles of superconducting qubits and shows the progress of quantum computing and quantum simulation based on superconducting qubits in recent years.The experimental realization of gate operations, readout, error correction codes, as well as some quantum algorithms are summarized, followed by an introduction of quantum simulation. And then some important applications in fields including condensed matter physics, quantum annealing, and quantum chemistry are discussed.     

Polarization-Dependent Mode Analyzer and Controlled-Z Gate in Ti:LiNbO3 Quantum Photonic Circuits

Abstract

On-chip integrated photonic circuits are crucial for further progress toward quantum technologies and in the science of quantum optics. The quantum controlled-Z gate is an example of the maximally entangling gate, which is universal for quantum computing when coupled with single-qubit gates. This article demonstrates a deterministic controlled-Z photonic quantum gate based on titanium in-diffused channel waveguides in which polarization and modal degrees of freedom of a single photon are used for encoding the control and target qubits, respectively.     

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

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

Robust Quantum Gates in Decoherence-Free Subspaces with Josephson Charge Qubits

We propose a new and feasible scheme to implement quantum gates in decoherence-free subspaces (DFSs) with Josephson charge qubits situated in a circuit QED architecture. Based on the resonator-assisted interaction, the controllable interqubit couplings occur only by tuning the individual flux biases, by which we obtain the DFS-encoded universal quantum gates. Compared with the non-DFS situation, we numerically consider the robustness of the DFS-encoded scheme that can be insensitive to the collective noises. Thus the protocol may perform the fault-tolerant quantum computing with Josephson charge qubits.     

Quaternary Quantum/Reversible Half-Adder,Full-Adder,Parallel Adder and Parallel Adder/Subtractor Circuits

Multiple valued quantum logic is a promising research area in quantum computing technology having several advantages over binary quantum logic. Adder circuits as well as subtractor circuits are the major components of various computational units in computers and other complex computational systems. In this paper, we propose a quaternary quantum reversible half-adder circuit using quaternary 1-qudit gates, 2-qudit Feynman and Muthukrishnan-Stroud gates. Then we propose a quaternary quantum reversible full adder and a quaternary quantum parallel adder circuit. In addition, we propose a quaternary quantum reversible parallel adder/subtractor circuit. The proposed designs are compared with existing designs and improvements in terms of hardware complexity, quantum cost, number of constant inputs and garbage outputs are reported.

     

Allowable Generalized Quantum Gates

In this paper, we give the most general duality gates, or generalized quantum gates in duality quantum computers. Here we show by explicit construction that a n-bit duality quantum computer with d slits can be simulated perfectly with an ordinary quantum computer with n qubits and one auxiliary qudit. Using this model, we give the most general form of duality gates which is of the form ∑i=0^d-1piUi,and the pi ＇s are complex numbers with module less or equal to 1 and constrained by｜∑iPi｜≤1.     

Quantum teleportation of optical quantum gates

We show that a universal set of gates for quantum computation with optics can be quantum teleported through the use of EPR entangled states, homodyne detection, and linear optics and squeezing operations conditioned on measurement outcomes. This scheme may be used for fault-tolerant quantum computation in any optical scheme (qubit or continuous-variable). The teleportation of nondeterministic nonlinear gates employed in linear optics quantum computation is discussed.     

Quantum computing methods for electronic states of the water molecule

ABSTRACT

We compare recently proposed methods to compute the electronic state energies of the water molecule on a quantum computer. The methods include the phase estimation algorithm based on Trotter decomposition, the phase estimation algorithm based on the direct implementation of the Hamiltonian, direct measurement based on the implementation of the Hamiltonian and a specific variational quantum eigensolver, Pairwise VQE. After deriving the Hamiltonian using STO-3G basis, we first explain how each method works and then compare the simulation results in terms of gate complexity and the number of measurements for the ground state of the water molecule with different O–H bond lengths. Moreover, we present the analytical analyses of the error and the gate-complexity for each method. While the required number of qubits for each method is almost the same, the number of gates and the error vary a lot. In conclusion, among methods based on the phase estimation algorithm, the second-order direct method provides the most efficient circuit implementations in terms of the gate complexity. Moreover, Pairwise VQE serves the most practical method for near-term applications on the current available quantum computers. Finally the possibility of extending the calculation to excited states and resonances is discussed.     

Quantum two-level systems in Josephson junctions as naturally formed qubits

The two-level systems (TLSs) naturally occurring in Josephson junctions constitute a major obstacle for the operation of superconducting phase qubits. Since these TLSs can possess remarkably long decoherence times, we show that such TLSs can themselves be used as qubits, allowing for a well controlled initialization, universal sets of quantum gates, and readout. Thus, a single current-biased Josephson junction can be considered as a multiqubit register. It can be coupled to other junctions to allow the application of quantum gates to an arbitrary pair of qubits in the system. Our results indicate an alternative way to realize superconducting quantum information processing.     

Quantum phase estimation algorithm in presence of static imperfections

We study numerically the effects of static imperfections and residual couplings between qubits for the quantum phase estimation algorithm with two qubits. We show that the success probability of the algorithm is affected significantly more by static imperfections than by random noise errors in quantum gates. An improvement of the algorithm accuracy can be reached by application of the Pauli-random-error-correction method (PAREC).     

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.     

A (<Emphasis Type="Italic">t</Emphasis>,<Emphasis Type="Italic">n</Emphasis>)-Threshold Scheme of Multi-party Quantum Group Signature with Irregular Quantum Fourier Transform

A novel (t,n)-threshold scheme for the multi-party quantum group signature is proposed based on the irregular quantum Fourier transform, in which every t-qubit quantum message needs n participants to generate the quantum group signature. All the quantum operation gates in the quantum circuit can be distributed and arranged randomly in the irregular QFT algorithm, which can increase the von Neumann entropy of the signed quantum message and the randomicity of the quantum signature generation significantly. The generation and verification of the quantum group signature can be both performed in quantum circuits with the parallel algorithm. Security analysis shows that an available and legal quantum (t,n)-threshold group signature can be achieved.     

Shortcut-based quantum gates on superconducting qubits in circuit QED

Construction of optimal gate operations is significant for quantum computation. Here an efficient scheme is proposed for performing shortcut-based quantum gates on superconducting qubits in circuit quantum electrodynamics (QED). Two four-level artificial atoms of Cooper-pair box circuits, having sufficient level anharmonicity, are placed in a common quantized field of circuit QED and are driven by individual classical microwaves. Without the effect of cross resonance, one-qubit NOT gate and phase gate in a decoupled atom can be implemented using the invariant-based shortcuts to adiabaticity. With the assistance of cavity bus, a one-step SWAP gate can be obtained within a composite qubit-photon-qubit system by inversely engineering the classical drivings. We further consider the gate realizations by adjusting the microwave fields. With the accessible decoherence rates, the shortcut-based gates have high fidelities. The present strategy could offer a promising route towards fast and robust quantum computation with superconducting circuits experimentally.