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.     

Quantum insights from null-strut geometrodynamics

We discuss quantum insights due to the null-strut formalism. These insights deal primarily with two topics: the formalism of a theory of canonical simplicial quantum gravity based on the geometrodynamic duality of null-strut calculus, and the natural implementation of spinors and spin networks in null-strut calculus.     

Quantum spin dynamics as a model for quantum computer operation

We study effects of the physical realization of quantum computers on their logical operation. Through simulation of physical models of quantum computer hardware, we analyze the difficulties that are encountered in programming physical realizations of quantum computers. Examples of logically identical implementations of the controlled-NOT operation and Grover's database search algorithm are used to demonstrate that the results of a quantum computation are unstable with respect to the physical realization of the quantum computer. We discuss the origin of these instabilities and discuss possibilities to overcome this, for practical purposes, fundamental limitation of quantum computers. Received 5 November 2001 and Received in final form 8 February 2002     

Quantum theory of continuous measurements and its applications in quantum optics

We present an overview of the quantum theory of continuous measurements and discuss some of its important applications in quantum optics. Quantum theory of continuous measurements is the appropriate generalization of the conventional formulation of quantum theory, which is adequate to deal with counting experiments where a detector monitors a system continuously over an interval of time and records the times of occurrence of a given type of event, such as the emission or arrival of a particle. We first discuss the classical theory of counting processes and indicate how one arrives at the celebrated photon counting formula of Mandel for classical optical fields. We then discuss the inadequacies of the so called quantum Mandel formula. We explain how the unphysical results that arise from the quantum Mandel formula are due to the fact that the formula is obtained on the basis of an erroneous identification of the coincidence probability densities associated with a continuous measurement situation. We then summarize the basic framework of the quantum theory of continuous measurements as developed by Davies. We explain how a complete characterization of the counting process can be achieved by specifying merely the measurement transformation associated with the change in the state of the system when a single event is observed in an infinitesimal interval of time. In order to illustrate the applications of the quantum theory of continuoius measurements in quantum optics, we first derive the photon counting probabilities of a single-mode free field and also of a single-mode field in interaction with an external source. We then discuss the general quantum counting formula of Chmara for a multi-mode electromagnetic field coupled to an external source. We explain how the Chmara counting formula is indeed the appropriate quantum generalization of the classical Mandel formula. To illustrate the fact that the quantum theory of continuous measurements has other diverse applications in quantum optics, besides the theory of photodetection, we summarize the theory of ‘quantum jumps’ developed by Zoller, Marte and Walls and Barchielli, where the continuous measurements framework is employed to evaluate the statistics of photon emission events in the resonance fluorescence of an atomic system.     

Quantum cellular automaton theory of light

We present a quantum theory of light based on the recent derivation of Weyl and Dirac quantum fields from general principles ruling the interactions of a countable set of abstract quantum systems, without using space–time and mechanics (D’Ariano and Perinotti, 2014). In a Planckian interpretation of the discreteness, the usual quantum field theory corresponds to the so-called relativistic regime of small wave-vectors. Within the present framework the photon is a composite particle made of an entangled pair of free Weyl Fermions, and the usual Bosonic statistics is recovered in the low photon density limit, whereas the Maxwell equations describe the relativistic regime. We derive the main phenomenological features of the theory in the ultra-relativistic regime, consisting in a dispersive propagation in vacuum, and in the occurrence of a small longitudinal polarization, along with a saturation effect originated by the Fermionic nature of the photon. We then discuss whether all these effects can be experimentally tested, and observe that only the dispersive effects are accessible to the current technology via observations of gamma-ray bursts.     

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.     

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.     

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.     

Transition Effect Matrices and Quantum Markov Chains

A transition effect matrix (TEM) is a quantum generalization of a classical stochastic matrix. By employing a TEM we obtain a quantum generalization of a classical Markov chain. We first discuss state and operator dynamics for a quantum Markov chain. We then consider various types of TEMs and vector states. In particular, we study invariant, equilibrium and singular vector states and investigate projective, bistochastic, invertible and unitary TEMs.     

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 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.     

Quantum Mechanics: Myths and Facts

A common understanding of quantum mechanics (QM) among students and practical users is often plagued by a number of “myths”, that is, widely accepted claims on which there is not really a general consensus among experts in foundations of QM. These myths include wave-particle duality, time-energy uncertainty relation, fundamental randomness, the absence of measurement-independent reality, locality of QM, nonlocality of QM, the existence of well-defined relativistic QM, the claims that quantum field theory (QFT) solves the problems of relativistic QM or that QFT is a theory of particles, as well as myths on black-hole entropy. The fact is that the existence of various theoretical and interpretational ambiguities underlying these myths does not yet allow us to accept them as proven facts. I review the main arguments and counterarguments lying behind these myths and conclude that QM is still a not-yet-completely-understood theory open to further fundamental research.     

Quantum turbulence: Theoretical and numerical problems

The term “quantum turbulence” (QT) unifies the wide class of phenomena where the chaotic set of one dimensional quantized vortex filaments (vortex tangles) appear in quantum fluids and greatly influence various physical features. Quantum turbulence displays itself differently depending on the physical situation, and ranges from quasi-classical turbulence in flowing fluids to a near equilibrium set of loops in phase transition. The statistical configurations of the vortex tangles are certainly different in, say, the cases of counterflowing helium and a rotating bulk, but in all the physical situations very similar theoretical and numerical problems arise. Furthermore, quite similar situations appear in other fields of physics, where a chaotic set of one dimensional topological defects, such as cosmic strings, or linear defects in solids, or lines of darkness in nonlinear light fields, appear in the system. There is an interpenetration of ideas and methods between these scientific topics which are far apart in other respects. The main purpose of this review is to bring together some of the most commonly discussed results on quantum turbulence, focusing on analytic and numerical studies. We set out a series of results on the general theory of quantum turbulence which aim to describe the properties of the chaotic vortex configuration, starting from vortex dynamics. In addition we insert a series of particular questions which are important both for the whole theory and for the various applications. We complete the article with a discussion of the hot topic, which is undoubtedly mainstream in this field, and which deals with the quasi-classical properties of quantum turbulence. We discuss this problem from the point of view of the theoretical results stated in the previous sections. We also included section, which is devoted to the experimental and numerical suggestions based on the discussed theoretical models.     

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

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

Quantum gravity on the lattice

I review the lattice approach to quantum gravity, and how it relates to the non-trivial ultraviolet fixed point scenario of the continuum theory. After a brief introduction covering the general problem of ultraviolet divergences in gravity and other non-renormalizable theories, I discuss the general methods and goals of the lattice approach. An underlying theme is the attempt at establishing connections between the continuum renormalization group results, which are mainly based on diagrammatic perturbation theory, and the recent lattice results, which apply to the strong gravity regime and are inherently non-perturbative. A second theme in this review is the ever-present natural correspondence between infrared methods of strongly coupled non-abelian gauge theories on the one hand, and the low energy approach to quantum gravity based on the renormalization group and universality of critical behavior on the other. Towards the end of the review I discuss possible observational consequences of path integral quantum gravity, as derived from the non-trivial ultraviolet fixed point scenario. I argue that the theoretical framework naturally leads to considering a weakly scale-dependent Newton’s constant, with a scaling violation parameter related to the observed scaled cosmological constant (and not, as naively expected, to the Planck length). Invited lecture presented at the conference “Quantum Gravity: Challenges and Perspectives”, Bad Honnef, 14–16 April 2008. To appear in the proceedings edited by Hermann Nicolai.     

Quantum correlation dynamics in photosynthetic processes assisted by molecular vibrations

During the long course of evolution, nature has learnt how to exploit quantum effects. In fact, recent experiments reveal the existence of quantum processes whose coherence extends over unexpectedly long time and space ranges. In particular, photosynthetic processes in light-harvesting complexes display a typical oscillatory dynamics ascribed to quantum coherence. Here, we consider the simple model where a dimer made of two chromophores is strongly coupled with a quasi-resonant vibrational mode. We observe the occurrence of wide oscillations of genuine quantum correlations, between electronic excitations and the environment, represented by vibrational bosonic modes. Such a quantum dynamics has been unveiled through the calculation of the negativity of entanglement and the discord, indicators widely used in quantum information for quantifying the resources needed to realize quantum technologies. We also discuss the possibility of approximating additional weakly-coupled off-resonant vibrational modes, simulating the disturbances induced by the rest of the environment, by a single vibrational mode. Within this approximation, one can show that the off-resonant bath behaves like a classical source of noise.     

Quantum knitting

We analyze the connections between the mathematical theory of knots and quantum physics by addressing a number of algorithmic questions related to both knots and braid groups. Knots can be distinguished by means of “knot invariants,” among which the Jones polynomial plays a prominent role, since it can be associated with observables in topological quantum field theory. Although the problem of computing the Jones polynomial is intractable in the framework of classical complexity theory, it has been recently recognized that a quantum computer is capable of approximating it in an efficient way. The quantum algorithms discussed here represent a breakthrough for quantum computation, since approximating the Jones polynomial is actually a “universal problem,” namely, the hardest problem that a quantum computer can efficiently handle.     

Quantum point contacts as heat engines

The efficiency of macroscopic heat engines is restricted by the second law of thermodynamics. They can reach at most the efficiency of a Carnot engine. In contrast, heat currents in mesoscopic heat engines show fluctuations. Thus, there is a small probability that a mesoscopic heat engine exceeds Carnot's maximum value during a short measurement time. We illustrate this effect using a quantum point contact as a heat engine. When a temperature difference is applied to a quantum point contact, the system may be utilized as a source of electrical power under steady state conditions. We first discuss the optimal working point of such a heat engine that maximizes the generated electrical power and subsequently calculate the statistics for deviations of the efficiency from its most likely value. We find that deviations surpassing the Carnot limit are possible, but unlikely.