A Comparative Study of Quantum and Classical Deletion

Here in this letter, we study the difference between quantum and classical deletion. We point out that the linear mapping deletion operation used in the impossibility proof for quantum systems applies also to classical system. The general classical deletion operation is a combined operation of measurement and transformation, i.e., first read the state and then transfer the state to the standard blank state. Though both quantum information and classical information can be deleted in an open system, quantum information cannot be recovered while classical information can be recovered.     

The Role of Quantum Interference in Quantum Computing

Quantum interference is proposed as a tool to augment Quantum Computation.     

Variational Quantum Chemistry Programs in JaqalPaq

We present example quantum chemistry programs written with JaqalPaq, a python meta-programming language used to code in Jaqal (Just Another Quantum Assembly Language). These JaqalPaq algorithms are intended to be run on the Quantum Scientific Computing Open User Testbed (QSCOUT) platform at Sandia National Laboratories. Our exemplars use the variational quantum eigensolver (VQE) quantum algorithm to compute the ground state energies of the H2, HeH+, and LiH molecules. Since the exemplars focus on how to program in JaqalPaq, the calculations of the second-quantized Hamiltonians are performed with the PySCF python package, and the mappings of the fermions to qubits are obtained from the OpenFermion python package. Using the emulator functionality of JaqalPaq, we emulate how these exemplars would be executed on an error-free QSCOUT platform and compare the emulated computation of the bond-dissociation curves for these molecules with their exact forms within the relevant basis.     

Quantum quicksands

In this tutorial we review the basic building blocks of Quantum Information Processing with cold trapped atomic ions. We mainly focus on methods to implement single-qubit rotations and two-qubit entangling gates, which form a universal set of quantum gates. Different ion qubit choices and their respective gate implementations are described.     

“Quantum” Beats in Classical Physics

We present an analysis of (and a classical model for) atomic decays that do (do not) exhibit what has been denoted “quantum beats.” The model shows that the appearance of beats is dependent on implicit (but not necessarily the extent of) phase coherence of the excitation signals. The significance of the existence of this model for arguments on the tenability of neoclassical electromagnetic theory as an alternate theory to quantum electrodynamics is discussed.     

Information Complexity of Quantum Gates

This paper considers the realizability of quantum gates from the perspective of information complexity. Since the gate is a physical device that must be controlled classically, it is subject to random error. We define the complexity of gate operation in terms of the difference between the entropy of the variables associated with initial and final states of the computation. We argue that the gate operations are irreversible if there is a difference in the accuracy associated with input and output variables. It is shown that under some conditions the gate operation may be associated with unbounded entropy, implying impossibility of implementation. PACS number: 03.65     

Classical Mechanics and Quantum Mechanics

The Newton equation of motion is derived from quantummechanics.     

Electron Spins in Quantum Dots as Quantum Bits

The creation, coherent manipulation, and measurement of spins in nanostructures open up completely new possibilities for electronics and information processing, among them quantum computing and quantum communication. We review our theoretical proposal for using electron spins in quantum dots as quantum bits, explaining why this scheme satisfies all the essential requirements for quantum computing. We include a discussion of the recent measurements of surprisingly long spin coherence times in semiconductors. Quantum gate mechanisms in laterally and vertically tunnel-coupled quantum dots and methods for single-spin measurements are introduced. We discuss detection and transport of electronic EPR pairs in normal and superconducting systems.     

Classical Versus Quantum Probability in Sequential Measurements

We demonstrate in this paper that the probabilities for sequential measurements have features very different from those of single-time measurements. First, they cannot be modelled by a classical stochastic process. Second, they are contextual, namely they depend strongly on the specific measurement scheme through which they are determined. We construct Positive-Operator-Valued measures (POVM) that provide such probabilities. For observables with continuous spectrum, the constructed POVMs depend strongly on the resolution of the measurement device, a conclusion that persists even if we consider a quantum mechanical measurement device or the presence of an environment. We then examine the same issues in alternative interpretations of quantum theory. We first show that multi-time probabilities cannot be naturally defined in terms of a frequency operator. We next prove that local hidden variable theories cannot reproduce the predictions of quantum theory for sequential measurements, even when the degrees of freedom of the measuring apparatus are taken into account. Bohmian mechanics, however, does not fall in this category. We finally examine an alternative proposal that sequential measurements can be modeled by a process that does not satisfy the Kolmogorov axioms of probability. This removes contextuality without introducing non-locality, but implies that the empirical probabilities cannot be always defined (the event frequencies do not converge). We argue that the predictions of this hypothesis are not ruled out by existing experimental results (examining in particular the “which way” experiments); they are, however, distinguishable in principle.     

Classical and Quantum Coherent States

p-Mechanics is a consistent physical theory which describes both quantum and classical mechanics simultaneously (V. V. Kisil, p-Mechanics as a physical theory. An Introduction, E-print:arXiv:quant-ph/0212101, 2002; International Journal of Theoretical Physics 41(1), 63–77, 2002). We continue the development of p-mechanics by introducing the concept of states. The set of coherent states we introduce allows us to evaluate classical observables at any point of phase space and simultaneously to evaluate quantum probability amplitudes. The example of the forced harmonic oscillator is used to demonstrate these concepts.     

Foundation for Quantum Computing

In this paper we introduce a minimal formal intuitionistic propositional Gentzen sequent calculus for handling quantum types, quantum storage being introduced syntactically along the lines of Girard's of course operator !. The intuitionistic fragment of orthologic is found to be translatable into this calculus by means of a quantum version of the Heyting paradigm. When realized in the category of finite dimensional Hilbert spaces, the familiar qubit arises spontaneously as the irreducible storage capable quantum computational unit, and the necessary involvement of quantum entanglement in the quantum duplication process is plainly and explicitly visible. Quantum computation is modelled by a single extra axiom, and reproduces the standard notion when interpreted in a larger category.     

Scalable Arbitrated Quantum Signature of Classical Messages withMulti-Signers

Unconditionally secure signature is an important part of quantum cryptography. Usually, a signature scheme only provides an environment for asingle signer. Nevertheless, in real applications, many signers maycollaboratively send a message to the verifier and convince the verifierthat the message is actually transmitted by them. In this paper, we give ascalable arbitrated signature protocol of classical messages with multi-signers. Its security is analyzed and proved to be secure even with a compromised arbitrator.     

Gravity,Quantum Fields and Quantum Information: Problems with Classical Channel and Stochastic Theories

In recent years an increasing number of papers have attempted to mimic or supplant quantum field theory in discussions of issues related to gravity by the tools and through the perspective of quantum information theory, often in the context of alternative quantum theories. In this article, we point out three common problems in such treatments. First, we show that the notion of interactions mediated by an information channel is not, in general, equivalent to the treatment of interactions by quantum field theory. When used to describe gravity, this notion may lead to inconsistencies with general relativity. Second, we point out that in general one cannot replace a quantum field by a classical stochastic field, or mock up the effects of quantum fluctuations by that of classical stochastic sources (noises), because in so doing important quantum features such as coherence and entanglement will be left out. Third, we explain how under specific conditions semi-classical and stochastic theories indeed can be formulated from their quantum origins and play a role at certain regimes of interest.     

Classical Limit of Quantum Dissipative Systems

We discuss the Lindblad equation for the density matrix where the dissipation is linear in the position operator. We consider a potential which is a bounded perturbation of the harmonic oscillator. We show that the perturbation of the potential leads to an analytic perturbation of the Wigner distribution. Then the Wigner distribution of the quantum dissipative system tends (uniformly in time) to the classical phase space distribution of the classical dissipative system (if the initial distribution converges when 0).     

二维形变谐振子系统中的量子经典对应

通过引入等效普朗克常数,将量子系统中基本动力学变量的期望值和经典系统中基本动力学变量的精确值的时间演化行为相比较,分析了两者产生差异的因素,规则运动主要是和量子效应有关,而混沌运动则是和动力学效应有关,即与系统的动力学对称性破坏相联系.在此基础上,比较了量子相空间测不准度和李雅谱诺夫指数,给出了令人满意的说明.     

Scalable Arbitrated Quantum Signature of Classical Messages with Multi-Signers

Unconditionally secure signature is an important part of quantum cryptography. Usually, a signature scheme only provides an environment for a single signer. Nevertheless, in real applications, many signers may collaboratively send a message to the verifier and convince the verifier that the message is actually transmitted by them. In this paper, we give a scalable arbitrated signature protocol of classical proved to be secure even with a compromised arbitrator. messages with multi-signers. Its security is analyzed and proved to be secure even with a compromised arbitrator.     

Quantum Coherences and Classical Inhomogeneities as Equivalent Thermodynamics Resources

Quantum energy coherences represent a thermodynamic resource, which can be exploited to extract energy from a thermal reservoir and deliver that energy as work. We argue that there exists a closely analogous classical thermodynamic resource, namely, energy-shell inhomogeneities in the phase space distribution of a system’s initial state. We compare the amount of work that can be obtained from quantum coherences with the amount that can be obtained from classical inhomogeneities, and find them to be equal in the semiclassical limit. We thus conclude that coherences do not provide a unique thermodynamic advantage of quantum systems over classical systems, in situations where a well-defined semiclassical correspondence exists.     

Gaussian Amplitude Amplification for Quantum Pathfinding

We study an oracle operation, along with its circuit design, which combined with the Grover diffusion operator boosts the probability of finding the minimum or maximum solutions on a weighted directed graph. We focus on the geometry of sequentially connected bipartite graphs, which naturally gives rise to solution spaces describable by Gaussian distributions. We then demonstrate how an oracle that encodes these distributions can be used to solve for the optimal path via amplitude amplification. And finally, we explore the degree to which this algorithm is capable of solving cases that are generated using randomized weights, as well as a theoretical application for solving the Traveling Salesman problem.