Quantum walks: Decoherence and coin-flipping games

We investigate the global chirality distribution of the quantum walk on the line when decoherence is introduced either through simultaneous measurements of the chirality and particle position, or as a result of broken links. The first mechanism drives the system towards a classical diffusive behavior. This is used to build new quantum games, similar to the spin-flip game. The second mechanism involves two different possibilities: (a) All the quantum walk links have the same probability of being broken. (b) Only the quantum walk links on a half-line are affected by random breakage. In case (a) the decoherence drives the system to a classical Markov process, whose master equation is equivalent to the dynamical equation of the quantum density matrix. This is not the case in (b) where the asymptotic global chirality distribution unexpectedly maintains some dependence with the initial condition. Explicit analytical equations are obtained for all cases.     

Quantum games entropy

We propose the study of quantum games from the point of view of quantum information theory and statistical mechanics. Every game can be described by a density operator, the von Neumann entropy and the quantum replicator dynamics. There exists a strong relationship between game theories, information theories and statistical physics. The density operator and entropy are the bonds between these theories. The analysis we propose is based on the properties of entropy, the amount of information that a player can obtain about his opponent and a maximum or minimum entropy criterion. The natural trend of a physical system is to its maximum entropy state. The minimum entropy state is a characteristic of a manipulated system, i.e., externally controlled or imposed. There exist tacit rules inside a system that do not need to be specified or clarified and search the system equilibrium based on the collective welfare principle. The other rules are imposed over the system when one or many of its members violate this principle and maximize its individual welfare at the expense of the group.     

Quantum Game of Two Discriminable Coins

In some recent letters, it was reported that quantum strategies are more successful than classical ones for coin-tossing and roulette game. In this paper, we will solve the quantum game of two discriminable coins. And we develop two methods, analogy method and isolation method, to study this problem.     

Hadamard NMR spectroscopy for two-dimensional quantum information processing and parallel search algorithms

Hadamard spectroscopy has earlier been used to speed-up multi-dimensional NMR experiments. In this work, we speed-up the two-dimensional quantum computing scheme, by using Hadamard spectroscopy in the indirect dimension, resulting in a scheme which is faster and requires the Fourier transformation only in the direct dimension. Two and three qubit quantum gates are implemented with an extra observer qubit. We also use one-dimensional Hadamard spectroscopy for binary information storage by spatial encoding and implementation of a parallel search algorithm.     

Quantum strategies win in a defector-dominated population

Quantum strategies are introduced into evolutionary games. The agents using quantum strategies are regarded as invaders, whose fraction generally is 1% of a population, in contrast to the 50% of the population that are defectors. In this paper, the evolution of strategies on networks is investigated in a defector-dominated population, when three networks (square lattice, Newman–Watts small-world network, and scale-free network) are constructed and three games (Prisoners’ Dilemma, Snowdrift, and Stag-Hunt) are employed. As far as these three games are concerned, the results show that quantum strategies can always invade the population successfully. Comparing the three networks, we find that the square lattice is most easily invaded by agents that adopt quantum strategies. However, a scale-free network can be invaded by agents adopting quantum strategies only if a hub is occupied by an agent with a quantum strategy or if the fraction of agents with quantum strategies in the population is significant.     

Quantum search via superconducting quantum interference devices in a cavity

We propose a scheme for implementing the Grover search algorithm with two superconducting quantum interference devices (SQUIDs) in a cavity. Our scheme only requires single resonant interaction of the SQUID-cavity system and the required interaction time is very short. The simplicity of the process and the reduction of the interaction time are important for restraining decoherence.     

量子相关词汇搜索

本文讨论了基于量子并行计算和叠加态原理的量子搜索算法,并结合概率论,给出了从无结构的海量数据(库)中搜索相关词汇(组)的方法,并说明该方法远远优越于经典搜索算法。     

An Approach to Quantum Mechanics via Conditional Probabilities

The well-known proposal to consider the Lüders-von Neumann measurement as a non-classical extension of probability conditionalization is further developed. The major results include some new concepts like the different grades of compatibility, the objective conditional probabilities which are independent of the underlying state and stem from a certain purely algebraic relation between the events, and an axiomatic approach to quantum mechanics. The main axioms are certain postulates concerning the conditional probabilities and own intrinsic probabilistic interpretations from the very beginning. A Jordan product is derived for the observables, and the consideration of composite systems leads to operator algebras on the Hilbert space over the complex numbers, which is the standard model of quantum mechanics. The paper gives an expository overview of the results presented in a series of recent papers by the author. For the first time, the complete approach is presented as a whole in a single paper. Moreover, since the mathematical proofs are already available in the original papers, the present paper can dispense with the mathematical details and maximum generality, thus addressing a wider audience of physicists, philosophers or quantum computer scientists.     

Quantum M-P Neural Network

Quantum Neural Network (QNN) is a young and outlying science built upon the combination of classical neural network and quantum computing. Making use of quantum linear superposition, this paper presents a quantum M-P neural network based on the analysis of the conventional M-P neural network. Moreover, the working principle of this proposed network and its corresponding weight updating algorithm are expatiated in the two cases of input state being in the orthogonal and non-orthogonal basic set, respectively. In addition, this paper not only validates that this quantum M-P network can realize some network functions, such as “XOR”, but also verifies the feasibility and validity of its weight learning algorithm by some simple examples.     

Quantum algorithm for total least squares data fitting

The total least squares (TLS) method is widely used in data-fitting. Compared with the least squares fitting method, the TLS fitting takes into account not only observation errors, but also errors from the measurement matrix of the variables. In this work, the TLS problem is transformed to finding the ground state of a Hamiltonian matrix. We propose quantum algorithms for solving this problem based on quantum simulation of resonant transitions. Our algorithms can achieve at least polynomial speedup over the known classical algorithms.     

Quantum repeated games with continuous-variable strategies

By the Li-Du-Massar method, we investigate the quantization of a two-stage repeated duopoly game. By solving the quantum repeated game with continuous-variable strategies, we analyze the effect of two stages' entanglement levels, and give some numerical evidences to describe our model.     

Quantum key distribution via fiber optic, fidelity and error corrections

We propose an interesting scheme on photon states generation using a fiber optic Mach Zehnder interferometer incorporating a fiber optic ring resonator without any optical pumping parts including in the system, which is available for long-distance link. In principle, the state of a quantum bit, it is known, unknown, or entangled to other systems. The desired quantum states are generated and transmitted in the link via a fiber optic. The transmission quality in terms of quantum fidelity is analyzed, where a high fidelity to the noiseless quantum channel is achieved by adding an ancillary photon after the signal photon within the correlation time of the fiber noise and by performing the quantum parity checking method. The error correction is also analyzed. For simplicity, feature and robustness against path-length mismatches among the nodes make our scheme suitable for multi-user quantum communication networks.     

Role of coherence in adiabatic search algorithms

We systematically investigate the role of coherence in adiabatic search algorithms by using the relative entropy measure of coherence. Both in the ideal case (adiabatic evolution) and the non-ideal case (nonadiabatic evolution), the success probability increases with the decreases of coherence. In addition, the coherence depletion in global adiabatic search algorithm, local adiabatic search algorithm and an adiabatic search algorithm with constant evolution time was discussed. The results show that the coherence decreases faster in more efficient algorithm and an exponential decaying of coherence is necessary to achieve fast search (constant evolution time) in the adiabatic search algorithm. More importantly, we demonstrate that the efficiency of adiabatic search algorithm can be improved by utilizing appropriate method to speed up the coherence depletion.     

Quantum game theory and open access publishing

The digital revolution of the information age and in particular the sweeping changes of scientific communication brought about by computing and novel communication technology, potentiate global, high grade scientific information for free. The arXiv, for example, is the leading scientific communication platform, mainly for mathematics and physics, where everyone in the world has free access on. While in some scientific disciplines the open access way is successfully realized, other disciplines (e.g. humanities and social sciences) dwell on the traditional path, even though many scientists belonging to these communities approve the open access principle. In this paper we try to explain these different publication patterns by using a game theoretical approach. Based on the assumption, that the main goal of scientists is the maximization of their reputation, we model different possible game settings, namely a zero sum game, the prisoners’ dilemma case and a version of the stag hunt game, that show the dilemma of scientists belonging to “non-open access communities”. From an individual perspective, they have no incentive to deviate from the Nash equilibrium of traditional publishing. By extending the model using the quantum game theory approach it can be shown, that if the strength of entanglement exceeds a certain value, the scientists will overcome the dilemma and terminate to publish only traditionally in all three settings.     

Quantum Parrondo game based on a quantum ratchet effect

A Parrondo game is a counterintuitive game where two losing games can be combined to form a winning game. We construct a quantum version of a Parrondo game based on a quantum ratchet effect for a delta-kicked model, which can be realized in optical lattices. A game set is presented and a quantum anti-Parrondo game is also investigated.     

Quantum algorithms and the genetic code

Replication of DNA and synthesis of proteins are studied from the view-point of quantum database search. Identification of a base-pairing with a quantum query gives a natural (and first ever!) explanation of why living organisms have 4 nucleotide bases and 20 amino acids. It is amazing that these numbers arise as solutions to an optimisation problem. Components of the DNA structure which implement Grover’s algorithm are identified, and a physical scenario is presented for the execution of the quantum algorithm. It is proposed that enzymes play a crucial role in maintaining quantum coherence of the process. Experimental tests that can verify this scenario are pointed out.     

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.     

量子算法的NMR实现方法

量子计算机是一种以量子耦合方式进行信息处理的装置[1 ] 。原则上 ,它能利用量子相干干涉方法以比传统计算机更快的速度进行诸如大数的因式分解、未排序数据库中的数据搜索等工作[2 ] 。建造大型量子计算机的主要困难是噪音、去耦和制造工艺。一方面 ,虽然离子陷阱和光学腔实验方法大有希望 ,但这些方法都还没有成功实现过量子计算。另一方面 ,因为隔离于自然环境 ,核自旋可以成为很好的“量子比特” ,可能以非传统方式使用核磁共振 (NMR)技术实现量子计算。本文介绍一种用NMR方法实现量子计算的方法 ,该方法能够用比传统方法少的步骤解决一个纯数学问题。基于该方法的简单量子计算机使用比传统计算机使用更少的函数“调用”判断一未知函数的类别。     

Information Between Quantum Systems via POVMs

The concepts of conditional entropy and information between subsystems of a composite quantum system are generalized to include arbitrary indirect measurements (POVMs). Some properties of those quantities differ from those of their classical counterparts; certain equalities and inequalities of classical information theory may be violated. PACS: 03.67.-a.