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.     

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.     

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.     

The Role of Quantum Interference in Quantum Computing

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

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

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

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

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

Duality for Coloured Quantum Groups

Duality between the coloured quantum group and the coloured quantum algebra corresponding to GL(2) is established. The coloured L ^± functionals are constructed and the dual algebra is derived explicitly. These functionals are then employed to give a coloured generalisation of the differential calculus on quantum GL(2) within the framework of the R-matrix approach.     

Foundation for Quantum Computing

In this paper we introduce a minimal formal intuitionistic propositional Gentzen sequent calculus for handling quantum types, quantum storage being introduced syntactically along the lines of Girard's of course operator !. The intuitionistic fragment of orthologic is found to be translatable into this calculus by means of a quantum version of the Heyting paradigm. When realized in the category of finite dimensional Hilbert spaces, the familiar qubit arises spontaneously as the irreducible storage capable quantum computational unit, and the necessary involvement of quantum entanglement in the quantum duplication process is plainly and explicitly visible. Quantum computation is modelled by a single extra axiom, and reproduces the standard notion when interpreted in a larger category.     

Foundation for Quantum Computing II

In this continuation of an earlier paper we develop further the theme of quantum logical specification and derive from it some apparently physically viable instantiations of potential quantum computing devices. Specifically, in the case of a one-parameter set of terms (or labels)—read as instants of time—we find, emerging quite naturally from the algebraic setup, the paradigm for a single qubit epitomized by the case of a two-state fermion interacting with an external single mode boson. This covers the cases: cavity QED, trapped ions, and, when the qubits are multiplexed appropriately, NMR based systems. (This case degenerates to one in which only bosons are relevant as in the case of pure bosonic harmonic oscillator models in the “dual rail” representation. Such models fly in the face of the logic itself, thus clearly revealing even at this level their well-known shortcomings as practical quantum computing devices. Here as elsewhere logical constraints apparently dominate physical ones.) In a final section we indicate briefly how this process exactly generalizes, in the case of a manifold of terms more general than the one-parameter case, to yield the notion of holonomic quantum computation. In the course of this investigation we find an interpretation of path integrals as limits of sequences of logical CUTS, thus establishing a link—though still tenuous—between ensembles of acts of quantum computation and Lagrangians.     

Quantum Mechanical Nature in Liquid NMR Quantum Computing

The quantum nature of bulk ensemble NMR quantum computing the center of recent heated debate,is addressed. Concepts of the mixed state and entanglement are examined, and the data in a two-qubit liquid NMRquantum computation are analyzed. The main points in this paper are: i) Density matrix describes the “state“ of anaverage particle in an ensemble. It does not describe the state of an individual particle in an ensemble; ii) Entanglementis a property of the wave function of a microscopic particle (such as a molecule in a liquid NMR sample), and separabilityof the density matrix cannot be used to measure the entanglement of mixed ensemble; iii) The state evolution in bulk-ensemble NMRquantum computation is quantum-mechanical; iv) The coefficient before the effective pure state densitymatrix, e, is a measure of the simultaneity of the molecules in an ensemble. It reflects the intensity of the NMR signaland has no significance in quantifying the entanglement in the bulk ensemble NMR system. The decomposition of thedensity matrix into product states is only an indication that the ensemble can be prepared by an ensemble with theparticles unentangled. We conclude that effective-pure-state NMR quantum computation is genuine, not just classicalsimulations.     

Duality Quantum Computers and Quantum Operations

We present a mathematical theory for a new type of quantum computer called a duality quantum computer that is similar to one that has recently been proposed. We discuss the nonunitarity of certain circuits of a duality quantum computer. We then discuss the relevance of this work to quantum operations and their convexity theory. This discussion is based upon isomorphism theorems for completely positive maps.     

Towards Quantum Control with Advanced Quantum Computing: A Perspective

We propose the combination of digital quantum simulation and variational quantum algorithms as an alternative approach to numerical methods for solving quantum control problems. As a hybrid quantum–classical framework, it provides an efficient simulation of quantum dynamics compared to classical algorithms, exploiting the previous achievements in digital quantum simulation. We analyze the trainability and the performance of such algorithms based on our preliminary works. We show that specific quantum control problems, e.g., finding the switching time for bang-bang control or the digital quantum annealing schedule, can already be studied in the noisy intermediate-scale quantum era. We foresee that these algorithms will contribute even more to quantum control of high precision if the hardware for experimental implementation is developed to the next level.     

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.     

Feature Selection for Recommender Systems with Quantum Computing

The promise of quantum computing to open new unexplored possibilities in several scientific fields has been long discussed, but until recently the lack of a functional quantum computer has confined this discussion mostly to theoretical algorithmic papers. It was only in the last few years that small but functional quantum computers have become available to the broader research community. One paradigm in particular, quantum annealing, can be used to sample optimal solutions for a number of NP-hard optimization problems represented with classical operations research tools, providing an easy access to the potential of this emerging technology. One of the tasks that most naturally fits in this mathematical formulation is feature selection. In this paper, we investigate how to design a hybrid feature selection algorithm for recommender systems that leverages the domain knowledge and behavior hidden in the user interactions data. We represent the feature selection as an optimization problem and solve it on a real quantum computer, provided by D-Wave. The results indicate that the proposed approach is effective in selecting a limited set of important features and that quantum computers are becoming powerful enough to enter the wider realm of applied science.     

Universal Distributed Quantum Computing on Superconducting Qutrits with Dark Photons

A one‐step scheme is presented to construct the controlled‐phase gate deterministically on remote transmon qutrits coupled to different resonators connected by a superconducting transmission line for an universal distributed quantum computing. Different from previous work on remote superconducting qubits, the present gate is implemented with coherent evolutions of the entire system in the all‐resonance regime assisted by the dark photons to robust against the transmission line loss, which allows the possibility of the complex designation of a long‐length transmission line to link lots of circuit QEDs. The length of the transmission line can reach the scale of several meters, which makes this scheme suitable for large‐scale distributed quantum computing. This gate is a fast quantum entangling operation with a high fidelity of about 99%. Compared with previous work in other quantum systems for a distributed quantum computing, under the all‐resonance regime, the present proposal does not require classical pulses and ancillary qubits, which relaxes the difficulty of its implementation largely.     

Prime Factorization in the Duality Computer

We give algorithms to factorize large integers in the duality computer.We provide three duality algorithms for factorization based on a naive factorization method,the Shor algorithm in quantum computing,and the Fermat's method in classical computing.All these algorithms may be polynomial in the input size.     

Efficient Scheme for One-Way Quantum Computing with Radiofrequency SQUID Qubits byAdiabatic Passage

We proposed an efficient scheme for constructing a quantum controlled phase-shift gate and generating the cluster states with rf superconducting quantum interference devices (SQUIDs) coupled to a microwave cavity through adiabatic evolution of dark eigenstates. During the operation, the spontaneous emission is suppressed since the rf SQUIDs are always in the three lowest flux states. Considering the influence from the cavity decay with achievable
experimental parameters, we numerically analyze the success probability and the fidelity for generating the two-SQUID maximally entangled state and the controlled phase-shift gate by adiabatic passage.