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.     

Experimental Hamiltonian Learning of an 11-Qubit Solid-State Quantum Spin Register

Learning the Hamiltonian of a quantum system is indispensable for prediction of the system dynamics and realization of high fidelity quantum gates.However,it is a significant challenge to efficiently characterize the Hamiltonian which has a Hilbert space dimension exponentially growing with the system size.Here,we develop and implement an adaptive method to learn the effective Hamiltonian of an 11-qubit quantum system consisting of one electron spin and ten nuclear spins associated with a single nitrogen-vacancy center in a diamond.We validate the estimated Hamiltonian by designing universal quantum gates based on the learnt Hamiltonian and implementing these gates in the experiment.Our experimental result demonstrates a well-characterized 11-qubit quantum spin register with the ability to test quantum algorithms,and shows our Hamiltonian learning method as a useful tool for characterizing the Hamiltonian of the nodes in a quantum network with solid-state spin qubits.     

Efficient Construction of High-Dimensional Cluster State

We present a scheme for efficiently constructing high-dimensional cluster state using probabilistic entangling quantum gates. It is shown that the required computational overhead scales efficiently both with lip and n even if all the entangling quantum gates only succeed with an arbitrary small probability, where p is the success probability of the entangling quantum gate and n is the number of qubits in the computation.     

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.     

Quantum computational gates with radiation free couplings

We examine a generic three level mechanism of quantum computation in which all fundamental single and double qubit quantum logic gates are operating under the effect of adiabatically controllable static (radiation free) bias couplings between the states. Under the time evolution imposed by these bias couplings the quantum state cycles between the two degenerate levels in the ground state and the quantum gates are realized by changing Hamiltonian at certain time intervals when the system collapses to a two state subspace. We propose a physical implementation of the mechanism using Aharonov-Bohm persistent-current loops in crossed electric and magnetic fields, with the output of the loop read out by using a quantum Hall effect aided mechanism. Received 26 March 2002 / Received in final form 8 July 2002 Published online 19 November 2002     

Generation of a two-photon KLM quantum channel

As demonstrated by E. Knill et al. [Nature 409, 46 (2001)], quantum teleportation and quantum logic gates with a success probability close to one can be implemented using only linear optical elements, additional photons, and post-selection. To do this, it is desirable to have special quantum channels in sight before quantum teleportation performance. Here, we propose an experimental arrangement to generate a two-photon KLM state different from the well-known Bell states. This two-photon KLM state can be used to enhance the success probability of the quantum teleportation of a one-mode quantum qubit from 0.5 up to 2/3.     

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.     

One-way gates based on EPR, GHZ and decoherence-free states of W class

The logical gates using quantum measurement as a primitive of quantum computation are considered. It is found that these gates achieved with EPR, GHZ and W entangled states have the same structure, allow encoding the classical information into states of quantum system and can perform any calculations. A particular case of decoherence-free W states is discussed as in this very case the logical gate is decoherence-free.     

Implementing logic gates and the Deutsch-Jozsa quantum algorithm by two-dimensional NMR using spin- and transition-selective pulses

Quantum logical operations using two-dimensional NMR have recently been described using the scalar coupling evolution technique [J. Chem. Phys. 109, 10603 (1998)]. In the present paper, we describe the implementation of quantum logical operations using two-dimensional NMR, with the help of spin- and transition-selective pulses. A number of logic gates are implemented using two and three qubits with one extra observer spin. Some many-in-one gates (or Portmanteau gates) are also implemented. Toffoli gate (or AND/NAND gate) and OR/NOR gates are implemented on three qubits. The Deutsch-Jozsa quantum algorithm for one and two qubits, using one extra work qubit, has also been implemented using spin- and transition-selective pulses after creating a coherent superposition state in the two-dimensional methodology.     

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.     

Progress of quantum entanglement in a trapped-ion based quantum computer

In recent years, there have been significant progress toward building a practical quantum computer, demonstrating key ingredients such as single-qubit gates and a two-qubit entangling gate. Among various physical platforms for a potential quantum computing processor, a trapped-ion system has been one of the most promising platforms due to long coherence times, high-fidelity quantum gates, and qubit connectivity. However, scaling up the number of qubits for a practical quantum computing faces a core challenge in operating high-fidelity quantum gates under influence from neighboring qubits. In particular, for the trapped-ion system, unwanted quantum crosstalk between qubits and ions’ quantum motional states hinder performing high-fidelity entanglement as the number of ions increases. In this review, we introduce a trapped-ion system and explain how to perform single-qubit gates and a two-qubit entanglement. Moreover, we mainly address theoretical and experimental approaches to achieve high-fidelity and scalable entanglement toward a trapped-ion based quantum computer.     

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.     

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.     

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.     

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.     

广义量子干涉原理及对偶量子计算机

我们综述最近提出的广义量子干涉原理及其在量子计算中的应用。广义量子干涉原理是对狄拉克单光子干涉原理的具体化和多光子推广,不但对像原子这样的紧致的量子力学体系适用,而且适用于几个独立的光子这样的松散量子体系。利用广义量子干涉原理,许多引起争议的问题都可以得到合理的解释,例如两个以上的单光子的干涉等问题。从广义量子干涉原理来看双光子或者多光子的干涉就是双光子和双光子自身的干涉,多光子和多光子自身的干涉。广义量子干涉原理可以利用多组分量子力学体系的广义Feynman积分表示,可以定量地计算。基于这个原理我们提出了一种新的计算机,波粒二象计算机,又称为对偶计算机。在原理上对偶计算机超越了经典的计算机和现有的量子计算机。在对偶计算机中,计算机的波函数被分成若干个子波并使其通过不同的路径,在这些路径上进行不同的量子计算门操作,而后这些子波重新合并产生干涉从而给出计算结果。除了量子计算机具有的量子平行性外,对偶计算机还具有对偶平行性。形象地说,对偶计算机是一台通过多狭缝的运动着的量子计算机,在不同的狭缝进行不同的量子操作,实现对偶平行性。目前已经建立起严格的对偶量子计算机的数学理论,为今后的进一步发展打下了基础。本文着重从物理的角度去综述广义量子干涉原理和对偶计算机。现在的研究已经证明,一台d狭缝的n比特的对偶计算机等同与一个n比特+一个d比特(qudit)的普通量子计算机,证明了对偶计算机具有比量子计算机更强大的能力。这样,我们可以使用一台具有n+log2d个比特的普通量子计算机去模拟一个d狭缝的n比特对偶计算机,省去了研制运动量子计算机的巨大的技术上的障碍。我们把这种量子计算机的运行模式称为对偶计算模式,或简称为对偶模式。利用这一联系反过来可以帮助我们理解广义量子干涉原理,因为在量子计算机中一切计算都是普通的量子力学所允许的量子操作,因此广义量子干涉原理就是普通的量子力学体系所允许的原理,而这个原理只是是在多体量子力学体系中才会表现出来。对偶计算机是一种新式的计算机,里面有许多问题期待研究和发展,同时也充满了机会。在对偶计算机中,除了幺正操作外,还可以允许非幺正操作,几乎包括我们可以想到的任何操作,我们称之为对偶门操作或者广义量子门操作。目前这已经引起了数学家的注意,并给出了广义量子门操作的一些数学性质。此外,利用量子计算机和对偶计算机的联系,可以将许多经典计算机的算法移植到量子计算机中,经过改造成为量子算法。由于对偶计算机中的演化是非幺正的,对偶量子计算机将可能在开放量子力学的体系的研究中起到重要的作用。     

Nongeometric conditional phase shift via adiabatic evolution of dark eigenstates: a new approach to quantum computation

We propose a new approach to quantum phase gates via the adiabatic evolution. The conditional phase shift is neither of dynamical nor geometric origin. It arises from the adiabatic evolution of the dark state itself. Taking advantage of the adiabatic passage, this kind of quantum logic gates is robust against moderate fluctuations of experimental parameters. In comparison with the geometric phase gates, it is unnecessary to drive the system to undergo a desired cyclic evolution to obtain a desired solid angle. Thus, the procedure is simplified, and the fidelity may be further improved since the errors in obtaining the required solid angle are avoided. We illustrate such a kind of quantum logic gates in the ion trap system. The idea can also be realized in other systems, opening a new perspective for quantum information processing.     

Quantization of the double-qubit structure and quantum computation

The quantization scheme of a double-qubit structure with superconducting quantum interference devices (SQUIDs) is given. By introducing unitary matrices and using spectral decompositions, the Hamiltonian operator of the system is exactly formulated in compact forms in spin-1/2 notation. A scheme of designing controlled-phase-shift (CPS) gates is also proposed by using this circuit system.     

Implementation of Quantum Controlled-Not Gates via Singly Charged Quantum Dots in Cavity QED

The CNOT gates for photon-photon and photon-electron are constructed in quantum dot-cavity system based on the properties of singly charged dots in strong and weak-coupling cavities. The fidelities of these gates can reach relatively high values even if the cavity decay and leakage are considered. These types of gate plays an important role in hybrid quantum information systems. By using the wavelength division multiplexer (WDM) and polarization maintaining fiber circulator (PMFC) in the setup the success probabilities of the schemes are improved.     

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.