Allowable Generalized Quantum Gates Using Nonlinear Quantum Optics

In this paper, we give an efficient physical realization of a double-slit duality quantum gate. Weak cross- Kerr nonlinearity is exploited here. The probability of success can reach 1/2. Asymmetrical slit duality control gate also can be constructed conveniently. The special quantum control gate could be realized easily in optical system by our current experimental technology.     

Duality Computing in Quantum Computers

In this letter, we propose a duality computing mode, which resembles particle-wave duality property when a quantum system such as a quantum computer passes through a double-slit. In this mode, computing operations are not necessarily unitary. The duality mode provides a natural link between classical computing and quantum computing. In addition, the duality mode provides a new tool for quantum algorithm design.     

Duality Computing in Quantum Computers

In this letter, we propose a duality computing mode, which resembles particle-wave duality property when a quantum system such as a quantum computer passes through a double-slit. In this mode, computing operations are not necessarily unitary. The duality mode provides a natural link between classical computing and quantum computing. In addition, the duality mode provides a new tool for quantum algorithm design.     

Information Complexity of Quantum Gates

This paper considers the realizability of quantum gates from the perspective of information complexity. Since the gate is a physical device that must be controlled classically, it is subject to random error. We define the complexity of gate operation in terms of the difference between the entropy of the variables associated with initial and final states of the computation. We argue that the gate operations are irreversible if there is a difference in the accuracy associated with input and output variables. It is shown that under some conditions the gate operation may be associated with unbounded entropy, implying impossibility of implementation. PACS number: 03.65     

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

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

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

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

Adiabatic Quantum Gates

We discuss the logic implementation of quantum gates in the framework of the quantum adiabatic method, which uses the language of ground states, spectral gaps and Hamiltonians instead of the standard unitary transformation language.     

High-Fidelity and Low-Cost Hyperparallel Quantum Gates for Photon Systems via Λ-Type Systems

Quantum gates designed with minimized resources overhead have a crucial role in quantum information processing. Here, based on the degrees of freedom (DoFs) of photons and Λ-type atom systems, two high-fidelity and low-cost protocols are presented for realizing polarization-spatial hyperparallel controlled-not (CNOT) and Toffoli gates on photon systems with only two and four two-qubit polarization–polarization swap (P-P-SWAP) gates in each DoF, respectively. Moreover, the quantum gates can be extended feasibly to construct 2m-target-qubit hyperparallel CNOT and 2n-control-qubit Toffoli gates required only 4m and 4n P-P-SWAP gates on $(m+1)$- and $(n+1)$-photon systems, respectively, which dramatically lower the costs and bridge the divide between the theoretical lower bounds and the current optimal syntheses for the photonic quantum computing. Further, the unique auxiliary atom of these quantum gates can be regarded as a temporary quantum memory that requires no initialization and measurement, and is reused within the coherence time, as the state of the atom remains unchanged after the hyperparallel quantum computing.     

Quantum Logic Gates and Nuclear Magnetic Resonance Pulse Sequences

There has recently been considerable interest in the use of nuclear magnetic resonance (NMR) as a technology for the implementation of small quantum computers. These computers operate by the laws of quantum mechanics, rather than classical mechanics and can be used to implement new quantum algorithms. Here we describe how NMR in principle can be used to implement all the elements required to build quantum computers, and draw comparisons between the pulse sequences involved and those of more conventional NMR experiments.     

General Quantum Interference Principle and Duality Computer

In this article, we propose a general principle of quantum interference for quantum system, and based on this we propose a new type of computing machine, the duality computer, that may outperform in principle both classical computer and the quantum computer. According to the general principle of quantum interference, the very essence of quantum interference is the interference of the sub-waves of the quantum system itself. A quantum system considered here can be any quantum system: a single microscopic particle, a composite quantum system such as an atom or a molecule, or a loose collection of a few quantum objects such as two independent photons. In the duality computer, the wave of the duality computer is split into several sub-waves and they pass through different routes, where different computing gate operations are performed. These sub-waves are then re-combined to interfere to give the computational results. The quantum computer, however, has only used the particle nature of quantum object. In a duality computer, it may be possible to find a marked item from an unsorted database using only a single query, and all NP-complete problems may have polynomial algorithms. Two proof-of-the-principle designs of the duality computer are presented: the giant molecule scheme and the nonlinear quantum optics scheme. We also propose thought experiment to check the related fundamental issues, the measurement efficiency of a partial wave function.     

Quantum Gates and Hamilton Operators

Quantum gates are described by unitary operators. We discuss the construction of Hamilton operators from the unitary operators. Different techniques are applied.     

The Role of Quantum Interference in Quantum Computing

Quantum interference is proposed as a tool to augment Quantum Computation.     

量子Generalized Reed-Solomon码

构造出了一族量子纠错码,这族码具有参数［［n,n-2k,k+1］］_q,是q维量子系统上的码,q是任意素数的幂.这族码的最小距离达到了理论上限,因此,以码距来说,它是最优的.证明了当2≤n≤q或者q²-q+2≤n≤q²时,码都是存在的. 关键词： 量子Generalized Reed-Solomon码 量子MDS码 量子纠错码 量子信息     

Elementary Quantum Gates Based on Intrinsic Interaction Hamiltonian

A kind of new operators, the generalized pseudo-spin operators are introduced and a universad intrinsic Hamiltonian of two-qubit interaction is studied in terms of the generalized pseudo-spin operators. A fundamental quantum gate U（θ） is constructed based on the universal Hamiltonian and shown that the roles of the new quantum gate U （θ） is equivalent, functionally, to the joint operation of Hadamard and C-Not gates.     

Elementary Quantum Gates Based on Intrinsic Interaction Hamiltonian

A kind of new operators, the generalized pseudo-spin operators are introduced and a universal intrinsic Hamiltonian of two-qubit interaction is studied in terms of the generalized pseudo-spin operators. A fundamental quantum gate U(θ) is constructed based on the universal Hamiltonian and shown that the roles of the new quantum gate U(θ) is equivalent, functionally, to the joint operation of Hadamard and C-Not gates.     

Quantum quicksands

In this tutorial we review the basic building blocks of Quantum Information Processing with cold trapped atomic ions. We mainly focus on methods to implement single-qubit rotations and two-qubit entangling gates, which form a universal set of quantum gates. Different ion qubit choices and their respective gate implementations are described.     

Fuzzy Propositional Logic Associated with Quantum Computational Gates

We apply residuated structures associated with fuzzy logic to develop certain aspects of information processing in quantum computing from a logical perspective. For this purpose, we introduce an axiomatic system whose natural interpretation is the irreversible quantum Poincaré structure.     

Variational Quantum Chemistry Programs in JaqalPaq

We present example quantum chemistry programs written with JaqalPaq, a python meta-programming language used to code in Jaqal (Just Another Quantum Assembly Language). These JaqalPaq algorithms are intended to be run on the Quantum Scientific Computing Open User Testbed (QSCOUT) platform at Sandia National Laboratories. Our exemplars use the variational quantum eigensolver (VQE) quantum algorithm to compute the ground state energies of the H2, HeH+, and LiH molecules. Since the exemplars focus on how to program in JaqalPaq, the calculations of the second-quantized Hamiltonians are performed with the PySCF python package, and the mappings of the fermions to qubits are obtained from the OpenFermion python package. Using the emulator functionality of JaqalPaq, we emulate how these exemplars would be executed on an error-free QSCOUT platform and compare the emulated computation of the bond-dissociation curves for these molecules with their exact forms within the relevant basis.     

New Design for Quantum Dots Cellular Automata to obtain Fault Tolerant Logic Gates

In this paper, we analyze fault tolerance properties of the Majority Gate, as the main logic gate for implementation with Quantum dots Cellular Automata (QCA), in terms of fabrication defect. Our results demonstrate the poor fault tolerance properties of the conventional design of Majority Gate and thus the difficulty in its practical application. We propose a new approach to the design of QCA-based Majority Gate by considering two-dimensional arrays of QCA cells rather than a single cell for the design of such a gate. We analyze fault tolerance properties of such Block Majority Gates in terms of inputs misalignment and irregularity and defect (missing cells) in assembly of the array. We present simulation results based on semiconductor implementation of QCA with an intermediate dimensional dot of about 5 nm in size as opposed to magnetic dots of greater than 100 nm or molecular dots of 2–5Å. Our results clearly demonstrate the superior fault tolerance properties of the Block Majority Gate and its greater potential for a practical realization. We also show the possibility of designing fault tolerant QCA circuits by using Block Majority Gates.