Weakly Regular Quantum Grammars and Asynchronous Quantum Automata

In this paper, we define weakly regular quantum grammars (WRQG), regular quantum grammars (RQG), asynchronous quantum automata (AQA) and synchronous quantum automata (SQA). Moreover, we investigate the relationships between quantum languages generated by weakly quantum regular grammars and by asynchronous quantum automata. At the mean time, we discuss the relationships between regular quantum grammars and synchronous quantum automata. This work is supported by National Science Foundation of China (Grant No. 10571112) and 973 Program of China (No. 2002CB312200).     

Quantum Pushdown Automata

Quantum automata are mathematical models for quantum computing. We analyze the existing quantum pushdown automata, propose a q quantum pushdown automata (qQPDA), and partially clarify their connections. We emphasize some advantages of our qQPDA over others. We demonstrate the equivalence between qQPDA and another QPDA. We indicate that qQPDA are at least as powerful as the QPDA of Moore and Crutchfield with accepting words by empty stack. We introduce the quantum languages accepted by qQPDA and prove that every -q quantum context-free language is also an -q quantum context-free language for any (0, 1) and (0, 1).     

Parrondo Games as Lattice Gas Automata

Parrondo games are coin flipping games with the surprising property that alternating plays of two losing games can produce a winning game. We show that this phenomenon can be modelled by probabilistic lattice gas automata. Furthermore, motivated by the recent introduction of quantum coin flipping games, we show that quantum lattice gas automata provide an interesting definition for quantum Parrondo games.     

Pumping Lemma for Quantum Automata

Not all lattice-valued quantum automata possess the pumping property in its strict form. However the pumping lemma can be generalized, and all lattice-valued quantum automata possess the generalized pumping property.     

Quantum Tunneling of Two-Species Cold Bosonic Atoms in Optical Lattices

In this letter, we have studied quantum tunneling of two-species cold bosonic atoms in an optical lattices. When the optical lattice is not infinitely long and the spin excitations are not in the long-wavelength limit, quantum tunnelings are presented.     

Quantum Tunneling of Two-Species Cold Bosonic Atoms in Optical Lattices

In this letter, we have studied quantum tunneling of two-species cold bosonic atoms in an optical lattices. When the optical lattice is not infinitely long and the spin excitations are not in the long-wavelength limit, quantum tunnelings are presented.     

Finite State and Finite Stop Quantum Languages

We propose the concept of finite stop quantum automata (ftqa) based on Hilbert space and compare it with the finite state quantum automata (fsqa) proposed by Moore and Crutchfield (Theoretical Computer Science 237(1–2), 2000, 275–306). The languages accepted by fsqa form a proper subset of the languages accepted by ftqa. In addition, the fsqa form an infinite hierarchy of language inclusion with respect to the dimensionality of unitary matrices. We introduce complex-valued acceptance degrees and two types of finite stop quantum automata based on them: the invariant ftqa (icftq) and the variant ftqa (vcftq). The languages accepted by icftq form a proper subset of the languages accepted by vcftq. In addition, the icftq form an infinite hierarchy of language inclusion with respect to the dimensionality of unitary matrices. In this way, we establish two proper inclusion relations (fsqa) ⊂ (ftqa) and (icftq) ⊂ (vcftq), where the symbol means languages, and two infinite language hierarchies (fsqa) ⊂ (fsqa), (icftq) (icftq).     

Properties of Quantum Languages

The class of quantum languages Q() over an alphabet is the class of languages accepted by quantum automata. We study properties of Q() and compare Q() with the class of regular languages R(). It is shown that Q() is closed under union, intersection, and reversal but is not closed under complementation, concatenation, or Kleene star. It is also shown that Q() and R() are incomparable. Finally, we prove that L Q() if and only if L admits a transition amplitude function satisfying a certain property and a similar characterization is given for R().     

Grammar Theory Based on Quantum Logic

Motivated by Ying' work on automata theory based on quantum logic (Ying, M. S. (2000). International Journal of Therotical Physics, 39(4): 985–996; 39(11): 2545–2557) and inspired by the close relationship between the automata theory and the theory of formal grammars, we have established a basic framework of grammar theory on quantum logic and shown that the set of l-valued quantum regular languages generated by l-valued quantum regular grammars coincides with the set of l-valued quantum languages recognized by l-valued quantum automata.     

Automata Theory Based on Quantum Logic: Recognizability and Accessibility

Inspired by Ying’s work on automata theory based on quantum logic and classical automata theory, we introduce the concepts of reversal, accessible, coaccessible and complete part of finite state automata based on quantum logic. Some properties of them are discussed. More importantly we investigate the recognizability and accessibility properties of these types on the framework of quantum logic by employing the approach of semantic analysis. Foundation: supported by the National Natural Science Foundation of China (No. 10671030).     

Deduction, Ordering, and Operations in Quantum Logic

We show that in quantum logic of closed subspaces of Hilbert space one cannot substitute quantum operations for classical (standard Hilbert space) ones and treat them as primitive operations. We consider two possible ways of such a substitution and arrive at operation algebras that are not lattices what proves the claim. We devise algorithms and programs which write down any two-variable expression in an orthomodular lattice by means of classical and quantum operations in an identical form. Our results show that lattice structure and classical operations uniquely determine quantum logic underlying Hilbert space. As a consequence of our result, recent proposals for a deduction theorem with quantum operations in an orthomodular lattice as well as a, substitution of quantum operations for the usual standard Hilbert space ones in quantum logic prove to be misleading. Quantum computer quantum logic is also discussed.     

Quantum computation with two-dimensional graphene quantum dots

We study an array of graphene nano sheets that form a two-dimensional S=1/2 Kagome spin lattice used for quantum computation. The edge states of the graphene nano sheets are used to form quantum dots to confine electrons and perform the computation. We propose two schemes of bang-bang control to combat decoherence and realize gate operations on this array of quantum dots. It is shown that both schemes contain a great amount of information for quantum computation. The corresponding gate operations are also proposed.     

Quantum computation with two-dimensional graphene quantum dots

We study an array of graphene nano sheets that form a two-dimensional S=1/2 Kagome spin lattice used for quantum computation.The edge states of the graphene nano sheets are used to form quantum dots to confine electrons and perform the computation.We propose two schemes of bang-bang control to combat decoherence and realize gate operations on this array of quantum dots.It is shown that both schemes contain a great amount of information for quantum computation.The corresponding gate operations are also proposed.     

Quantum Lattice-Gas Model for the Burgers Equation

A quantum algorithm is presented for modeling the time evolution of a continuous field governed by the nonlinear Burgers equation in one spatial dimension. It is a microscopic-scale algorithm for a type-II quantum computer, a large lattice of small quantum computers interconnected in nearest neighbor fashion by classical communication channels. A formula for quantum state preparation is presented. The unitary evolution is governed by a conservative quantum gate applied to each node of the lattice independently. Following each quantum gate operation, ensemble measurements over independent microscopic realizations are made resulting in a finite-difference Boltzmann equation at the mesoscopic scale. The measured values are then used to re-prepare the quantum state and one time step is completed. The procedure of state preparation, quantum gate application, and ensemble measurement is continued ad infinitum. The Burgers equation is derived as an effective field theory governing the behavior of the quantum computer at its macroscopic scale where both the lattice cell size and the time step interval become infinitesimal. A numerical simulation of shock formation is carried out and agrees with the exact analytical solution.     

Quantum diffusion in semi-infinite periodic and quasiperiodic systems

This paper studies quantum diffusion in semi-infinite one-dimensional periodic lattice and quasiperiodic Fibonacci lattice. It finds that the quantum diffusion in the semi-infinite periodic lattice shows the same properties as that for the infinite periodic lattice. Different behaviour is found for the semi-infinite Fibonacci lattice. In this case, there are still C（t） - t^-δ and d（t） - t^β. However, it finds that 0 〈δ 〈 1 for smaller time, and δ = 0 for larger time due to the influence of surface localized states. Moreover, β for the semi-infinite Fibonacci lattice is much smaller than that for the infinite Fibonacci lattice. Effects of disorder on the quantum diffusion are also discussed.     

固态格点自旋体系中的量子关联

量子态的关联特性是量子通信和量子计算的重要资源。文章首先回顾了经典关联、量子关联的概念以及常用的度量方法,随后简要介绍了作者最近对固态格点自旋体系中量子关联的研究成果。最后对未来量子关联的研究指出了几个方向。     

固态格点自旋体系中的量子关联*

量子态的关联特性是量子通信和量子计算的重要资源。文章首先回顾了经典关联、量子关联的概念以及常用的度量方法,随后简要介绍了作者最近对固态格点自旋体系中量子关联的研究成果。最后对未来量子关联的研究指出了几个方向。     

Quantum Dialogue by Using Non-Symmetric Quantum Channel

A protocol for quantum dialogue is proposed to exchange directly the communicator＇s secret messages by using a three-dimensional Bell state and a two-dimensional Bell state as quantum channel with quantum superdence coding, local collective unitary operations, and entanglement swapping. In this protocol, during the process of trans- mission of particles, the transmitted particles do not carry any secret messages and are transmitted only one time. The protocol has higher source capacity than protocols using symmetric two-dimensional states. The security is ensured by the unitary operations randomly performed on all checking groups before the particle sequence is transmitted and the application of entanglement swapping.