Quantum Mechanical Histories and the Berry Phase

We elaborate on the distinction between geometric and dynamical phase in quantum theory and we show that the former is intrinsically linked to the quantum mechanical probabilistic structure. In particular, we examine the appearance of the Berry phase in the consistent histories scheme and establish that it is the basic building block of the decoherence functional. These results are consequences of the novel temporal structure of histories-based theories.     

On the consistent histories approach to quantum mechanics

We review the consistent histories formulations of quantum mechanics developed by Griffiths, Omnès, and Gell-Mann and Hartle, and describe the classification of consistent sets. We illustrate some general features of consistent sets by a few simple lemmas and examples. We consider various interpretations of the formalism, and examine the new problems which arise in reconstructing the past and predicting the future. It is shown that Omnès' characterization of true statements—statements which can be deduced unconditionally in his interpretation—is incorrect. We examine critically Gell-Mann and Hartle's interpretation of the formalism, and in particular their discussions of communication, prediction, and retrodiction, and conclude that their explanation of the apparent persistence of quasiclassicality relies on assumptions about an as-yetunknown theory of experience. Our overall conclusion is that the consistent histories approach illustrates the need to supplement quantum mechanics by some selection principle in order to produce a fundamental theory capable of unconditional predictions.     

Consistent histories,robust histories,and verifiable histories

A distinction is made among consistent histories in general, and those that are robustly consistent, and finally those that are classically verifiable. In the case of an individual system, the Copenhagen view would regard only its verifiable history to have actually taken place. We analyze the consequences if instead one associates reality with a finer and yet robust history. There are distinct disadvantages. In general one should probabilistically sum over the fine-grained consistent histories, even when the events have already happened.     

Quantum computing based on space states without charge transfer

An implementation of a quantum computer based on space states in double quantum dots is discussed. There is no charge transfer in qubits during a calculation, therefore, uncontrolled entanglement between qubits due to long-range Coulomb interaction is suppressed. Encoding and processing of quantum information is merely performed on symmetric and antisymmetric states of the electron in double quantum dots. Other plausible sources of decoherence caused by interaction with phonons and gates could be substantially suppressed in the structure as well. We also demonstrate how all necessary quantum logic operations, initialization, writing, and read-out could be carried out in the computer.     

Time Translation of Quantum Properties

Based on the notion of time translation, we develop a formalism to deal with the logic of quantum properties at different times. In our formalism it is possible to enlarge the usual notion of context to include composed properties involving properties at different times. We compare our results with the theory of consistent histories.     

Quantum group blind signature scheme without entanglement

In this paper we propose a quantum group blind signature scheme designed for distributed e-voting system. Our scheme combines the properties of group signature and blind signature to provide anonymity of voters in an e-voting system. The unconditional security of our scheme is ensured by quantum mechanics. Without employing entanglement, the proposed scheme is easier to be realized comparing with other quantum signature schemes.     

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.     

基于(2m+1)粒子纠缠态的任意m粒子态量子可控离物传态(英文)

提出了一个基于高维2m+1粒子纠缠态的任意m粒子态量子可控离物传态方案,发送方Alice对需传送的未知态量子系统和手中的纠缠粒子执行m个广义Bell基测量,控制方执行广义X基测量,依据预先共享量子纠缠态非定域相关性,接收方对手中的粒子执行相应的幺正操作就可以重建原来未知量子态.与其他方案相比,方案减少了任意高维多粒子态可控离物传送所需传送粒子数.我们进一步讨论了基于纯纠缠信道的概率量子可控离物传态方案,通过与发送方和控制方合作,接收方只需对手中的纠缠粒子和引入的附加粒子执行联合幺正演化和投影测量,就可以在他的粒子上概率的重建原来的未知量子态,最后,方案计算讨论了基于纯纠缠态量子可控离物传态成功概率与信道纠缠度之间的关系.     

Quantum dating market

We consider the dating market decision problem under the quantum mechanics point of view. Quantum states whose associated amplitudes are modified by men strategies are used to represent women. The Grover quantum search algorithm is used as a playing strategy. Success is more frequently obtained by playing quantum than playing classic.     

Quantum computers and quantum coherence

If the states of spins in solids can be created, manipulated, and measured at the single-quantum level, an entirely new form of information processing, quantum computing, will be possible. We first give an overview of quantum information processing, showing that the famous Shor speedup of integer factoring is just one of a host of important applications for qubits, including cryptography, counterfeit protection, channel capacity enhancement, distributed computing, and others. We review our proposed spin-quantum dot architecture for a quantum computer, and we indicate a variety of first generation materials, optical, and electrical measurements which should be considered. We analyze the efficiency of a two-dot device as a transmitter of quantum information via the propagation of qubit carriers (i.e. electrons) in a Fermi sea.     

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.     

双光子过程耦合腔系统中光场的量子特性

本文研究了双光子过程原子与耦合腔相互作用系统中腔场的压缩效应和反聚束效应.考虑系统总激发数等于2的情况,利用数值计算方法讨论了腔场间的耦合强度变化和原子与腔场间耦合强度变化对反聚束效应的影响.研究结果表明:腔场不呈现出压缩效应;腔场的反聚束效应与原子与腔场的耦合系数之间,以及与腔场间的耦合系数之间都存在着非线性关系.     

Quantum Computer Algorithm for Parity Determination Based on Quantum Counting

A new quantum computer algorithm is proposed for determining the parity of function f(x) by using quantum counting algorithm. The parity of function f(x) can be determined by counting exactly the number of satisfying f(x)=−1, which is equivalent to determine the number of solutions, M, to an N item search problem. The algorithm can be accomplished in time of order .     

Phase transitions and relaxation characteristics of Quantum Magnets and Quantum Glasses

An overview is presented of the phase changes as well as certain relaxation characteristics of model quantum magnets, magnetic glasses and proton glasses. Although the systems considered are quite varied, they are connected by the common themes of tunneling, transverse Ising model, long-ranged interactions and above all, the occurrence of quantum phase transitions. Because the interactions are long-ranged, mean-field theory is eminently suitable for analyzing both the equilibrium and nonequilibrium properties. Wherever pertinent, detailed comparisons with experimental data have been presented.     

Quantum Interference Computation

Quantum speed-up has been conjectured but not proven for a general computation. Quantum interference computation (QUIC) provides a general speed-up. It is a form of ground-mode computation that reinforces the ground mode in a beam of mostly non-ground modes by quantum superposition. It solves the general Boolean problem in the square root of the number of operations that a classical computer would need for the same problem. For example a typical 80-bit problem would take about 10²⁴ cycles (10⁷ years at 1 GHz) of classical computation and about 10¹² cycles (20 minutes at 1 GHz) of QUIC.     

Quantum games via search algorithms

We build new quantum games, similar to the spin flip game, where as a novelty the players perform measurements on a quantum system associated to a continuous time search algorithm. The measurements collapse the wave function into one of the two possible states. These games are characterized by a continuous space of strategies and the selection of a particular strategy is determined by the moments when the players measure.     

Quantum computation with programmable connections between gates

A new model of quantum computation is considered, in which the connections between gates are programmed by the state of a quantum register. This new model of computation is shown to be more powerful than the usual quantum computation, e.g. in achieving the programmability of permutations of N different unitary channels with 1 use instead of N uses per channel. For this task, a new elemental resource is needed, the quantum switch, which can be programmed to switch the order of two channels with a single use of each one.