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.     

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 Computational Logics and Possible Applications

In quantum computational logics meanings of formulas are identified with quantum information quantities: systems of qubits or, more generally, mixtures of systems of qubits. We consider two kinds of quantum computational semantics: (1) a compositional semantics, where the meaning of a compound formula is determined by the meanings of its parts; (2) a holistic semantics, which makes essential use of the characteristic “holistic” features of the quantum-theoretic formalism. The compositional and the holistic semantics turn out to characterize the same logic. In this framework, one can introduce the notion of quantum-classical truth table, which corresponds to the most natural way for a quantum computer to calculate classical tautologies. Quantum computational logics can be applied to investigate different kinds of semantic phenomena where holistic, contextual and gestaltic patterns play an essential role (from natural languages to musical compositions).     

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.     

The Algebraic Structure of an Approximately Universal System of Quantum Computational Gates

Shi and Aharonov have shown that the Toffoli gate and the Hadamard gate give rise to an approximately universal set of quantum computational gates. We study the basic algebraic properties of this system by introducing the notion of Shi-Aharonov quantum computational structure. We show that the quotient of this structure is isomorphic to a structure based on a particular set of complex numbers (the closed disc with center and radius ). Dedicated to Pekka Lahti.     

Ambiguous Discrimination of General Quantum Operations

We consider the problem of discriminating general quantum operations. Using the definition of mapping operator to vector, and by some calculating skills, we derive an explicit formulation as a new bound on the minimum-error probability for ambiguous discrimination between arbitrary m quantum operations. This formulation consists only of Kraus-operators, the dimension, and the priori probabilities of the discriminated quantum operations, and is independent of input states. To some extent, we further generalize the bounds on the minimum-error probability for discriminating mixed states to quantum operations.     

Mathematical Theory of Generalized Duality Quantum Computers Acting on Vector-States

Following the idea of duality quantum computation, a generalized duality quantum computer (GDQC) acting on vector-states is defined as a tuple consisting of a generalized quantum wave divider (GQWD) and a finite number of unitary operators as well as a generalized quantum wave combiner (GQWC). It is proved that the GQWD and GQWC of a GDQC are an isometry and a co-isometry, respectively, and mutually dual. It is also proved that every GDQC gives a contraction, called a generalized duality quantum gate (GDQG). A classification of GDQCs is given and the properties of GDQGs are discussed. Some applications are obtained, including two orthogonal duality quantum computer algorithms for unsorted database search and an understanding of the Mach-Zehnder interferometer.     

Quantum computation in continuous time using dynamic invariants

We introduce an approach for quantum computing in continuous time based on the Lewis-Riesenfeld dynamic invariants. This approach allows, under certain conditions, for the design of quantum algorithms running on a nonadiabatic regime. We show that the relaxation of adiabaticity can be achieved by processing information in the eigenlevels of a time dependent observable, namely, the dynamic invariant operator. Moreover, we derive the conditions for which the computation can be implemented by time independent as well as by adiabatically varying Hamiltonians. We illustrate our results by providing the implementation of both Deutsch-Jozsa and Grover algorithms via dynamic invariants.     

Unknowability of Quantum State forbids perfectly quantum operations

We analyze the connection between quantum operations and accessible information. And we find that the accessible information decreases under quantum operations. We show that it is impossible to perfectly manipulate an unknown state in an open quantum system. That the accessible information decreases under quantum operations gives a fundamental limitation in the microscopic world.     

Quantum superposition of localized and delocalized phases of photons

Based on a variant of 2-site Jaynes–Cummings–Hubbard model constructed using superconducting circuits, we propose a method to coherently superpose the localized and delocalized phases of microwave photons, which makes it possible to engineer the collective features of multiple photons in the quantum way using an individual two-level system. Our proposed architecture is also a promising candidate for implementing distributed quantum computation since it is capable of coupling remote qubits in separate resonators in a controllable way.     

A Macroscopic Device for Quantum Computation

We show how a compound system of two entangled qubits in a non-product state can be described in a complete way by extracting entanglement into an internal constraint between the two qubits. By making use of a sphere model representation for the spin 1/2, we derive a geometric model for entanglement. We illustrate our approach on 2-qubit algorithms proposed by Deutsch, respectively Arvind. One of the advantages of the 2-qubit case is that it allows for a nice geometrical representation of entanglement, which contributes to a more intuitive grasp of what is going on in a 2-qubit quantum computation.     

A Note of Coherence for Duality Quantum Computers Acting on Pure States

In this paper, we discuss the coherence for duality quantum computers under taking different unitary operators acting on pure states. Firstly, for arbitrary unitary operators, we give some general quantitative results of the coherence of output states. Secondly, for incoherence unitary operators, we obtain that the coherence of output states satisfies an inequality. In addition, we also give a conclusion of the coherence of output states under unitary permutation operators.     

Quantum computation with Turaev-Viro codes

For a 3-manifold with triangulated boundary, the Turaev-Viro topological invariant can be interpreted as a quantum error-correcting code. The code has local stabilizers, identified by Levin and Wen, on a qudit lattice. Kitaev’s toric code arises as a special case. The toric code corresponds to an abelian anyon model, and therefore requires out-of-code operations to obtain universal quantum computation. In contrast, for many categories, such as the Fibonacci category, the Turaev-Viro code realizes a non-abelian anyon model. A universal set of fault-tolerant operations can be implemented by deforming the code with local gates, in order to implement anyon braiding. We identify the anyons in the code space, and present schemes for initialization, computation and measurement. This provides a family of constructions for fault-tolerant quantum computation that are closely related to topological quantum computation, but for which the fault tolerance is implemented in software rather than coming from a physical medium.     

法拉第镜不完善对连续变量量子密钥分发系统的影响（英文）

采用连续变量量子密钥分发的纠缠模型,在反向协商情况下,研究法拉第镜不完善对系统安全密钥速率的影响.结果表明,不完善的法拉第镜会降低系统实际的密钥速率,并且降低安全通信距离,且随着法拉第镜失偏角度的增大而增大.此外,使用大的调制方差,可以降低法拉第镜不完善对系统的影响.     

Quantum Mechanics on Finite Groups

Although a few new results are presented, this is mainly a review article on the relationship between finite-dimensional quantum mechanics and finite groups. The main motivation for this discussion is the hidden subgroup problem of quantum computation theory. A unifying role is played by a mathematical structure that we call a Hilbert ^*-algebra. After reviewing material on unitary representations of finite groups we discuss a generalized quantum Fourier transform. We close with a presentation concerning position-momentum measurements in this framework.