Toward an architecture for quantum programming

It is becoming increasingly clear that, if a useful device for quantum computation will ever be built, it will be embodied by a classical computing machine with control over a truly quantum subsystem, this apparatus performing a mixture of classical and quantum computation. This paper investigates a possible approach to the problem of programming such machines: a template high level quantum language is presented which complements a generic general purpose classical language with a set of quantum primitives. The underlying scheme involves a run-time environment which calculates the byte-code for the quantum operations and pipes it to a quantum device controller or to a simulator. This language can compactly express existing quantum algorithms and reduce them to sequences of elementary operations; it also easily lends itself to automatic, hardware independent, circuit simplification. A publicly available preliminary implementation of the proposed ideas has been realised using the language.Received: 25 June 2002, Published online: 30 July 2003PACS: 03.67.Lx Quantum computation     

A compact program code for simulations of quantum algorithms in classical computers

A general quantum simulation language on a classical computer provides the opportunity to compare an experiential result from the development of quantum computers with mathematical theory. The intention of this research is to develop a program language that is able to make simulations of all quantum algorithms in same framework. This study examines the simulation of quantum algorithms on a classical computer with a symbolic programming language. We use the language Mathematica to make simulations of well-known quantum algorithms. The program code implemented on a classical computer will be a straight connection between the mathematical formulation of quantum mechanics and computational methods. This gives us an uncomplicated and clear language for the implementations of algorithms. The computational language includes essential formulations such as quantum state, superposition and quantum operator. This symbolic programming language provides a universal framework for examining the existing as well as future quantum algorithms. This study contributes with an implementation of a quantum algorithm in a program code where the substance is applicable in other simulations of quantum algorithms.     

How to utilize a Grover search in general programming

It is widely believed that quantum computers (if realized) will be more powerful than today’s computers from the viewpoint of computational complexity. However, it is not obvious how to utilize quantum computers in practical situations. For practical purposes, a Grover search may be one of the most promising quantum algorithms known so far. Thus, in this paper, we propose an efficient framework where we can use Grover search for general programming. Our framework has the following steps. (1) A programmer writes a program by using standard C++ programming language. (2) Some if expressions within for loops in the C++ source code are chosen as candidates to be performed as a Grover search on a quantum computer. (3) The framework automatically generates a corresponding quantum circuit for each Grover search chosen in (2). Unlike the existing quantum circuit design methods, we can treat large problems in our quantum circuit design. (4) By evaluating the number of primitive quantum gates in the quantum circuit generated in (3), the framework determines whether the processing time of the quantum circuit is faster than the processing time of the corresponding if expression on a classical computer. If the framework determines that the quantum circuit is faster, it generates some interface source codes for a classical computer. Thus, in our framework, a programmer can use a Grover search with almost no effort.     

实时图像处理系统性能及处理效果的软件仿真

本文以一种典型的相关识别图像处理系统为模型，提供了一套在系统方案论证过程中，对系统效能进行精确仿真的数字图像处理计算机软件。该软件采用高级语言编译和ＯＯＰ程序设计方法，可实现模拟系统硬件对输入的数字化图像进行滤波，二值化，锐化，相关等大量的处理，并通过与计算机显示卡的接口，利用显示器随时监视处理后的图像效果。     

Towards Implementation of a Generalized Architecture for High-Level Quantum Programming Language

This paper investigates a novel architecture to the problem of quantum computer programming. A generalized architecture for a high-level quantum programming language has been proposed. Therefore, the programming evolution from the complicated quantum-based programming to the high-level quantum independent programming will be achieved. The proposed architecture receives the high-level source code and, automatically transforms it into the equivalent quantum representation. This architecture involves two layers which are the programmer layer and the compilation layer. These layers have been implemented in the state of the art of three main stages; pre-classification, classification, and post-classification stages respectively. The basic building block of each stage has been divided into subsequent phases. Each phase has been implemented to perform the required transformations from one representation to another. A verification process was exposed using a case study to investigate the ability of the compiler to perform all transformation processes. Experimental results showed that the efficacy of the proposed compiler achieves a correspondence correlation coefficient about R ≈ 1 between outputs and the targets. Also, an obvious achievement has been utilized with respect to the consumed time in the optimization process compared to other techniques. In the online optimization process, the consumed time has increased exponentially against the amount of accuracy needed. However, in the proposed offline optimization process has increased gradually.     

Lieb-Robinson bounds and the generation of correlations and topological quantum order

The Lieb-Robinson bound states that local Hamiltonian evolution in nonrelativistic quantum mechanical theories gives rise to the notion of an effective light cone with exponentially decaying tails. We discuss several consequences of this result in the context of quantum information theory. First, we show that the information that leaks out to spacelike separated regions is negligible and that there is a finite speed at which correlations and entanglement can be distributed. Second, we discuss how these ideas can be used to prove lower bounds on the time it takes to convert states without topological quantum order to states with that property. Finally, we show that the rate at which entropy can be created in a block of spins scales like the boundary of that block.     

Literate programming in quantum chemistry: a collaborative approach to the development of theory and computer code

Literate programming has not so far found widespread application in quantum chemistry. Here we suggest that literate programming would do much to enhance the communication of the methods and algorithms of computational quantum chemistry. We argue that literate programming can foster a collaborative approach to the development of theory and code in quantum chemistry. We consider a collaborative approach to computational quantum chemistry via a collaborative virtual environment involving literate programming methods and contrast this with the more traditional approaches, such as the UK's Collaborative Computational Project 1. A sample literate program for the evaluation of the incomplete gamma function is presented using C and the literate programming conventions introduced by Knuth. This demonstrates the application of literate programming methodology to the heart of the molecular integral problem when Gaussian basis sets are employed. We briefly indicate how literate programming techniques may prove useful more generally in other computational sciences.     

Quantum groups on fibre bundles

It is shown that the principle of locality and noncommutative geometry can be connected by a sheaf theoretical method. In this framework quantum spaces are introduced and examples in mathematical physics are given. Within the language of quantum spaces noncommutative principal and vector bundles are defined and their properties are studied. Important constructions in the classical theory of principal fibre bundles like associated bundles and differential calculi are carried over to the quantum case. At the endq-deformed instanton models are introduced for every integral index.     

Analytical scheme calculations of angular momentum coupling and recoupling coefficients

We investigate the Scheme programming language opportunities to analytically calculate the Clebsch-Gordan coefficients, Wigner 6j and 9j symbols, and general recoupling coefficients that are used in the quantum theory of angular momentum. The considered coefficients are calculated by a direct evaluation of the sum formulas. The calculation results for large values of quantum angular momenta were compared with analogous calculations with FORTRAN and Java programming languages. The text was submitted by the authors in English.     

Logical foundation of quantum mechanics

The subject of this article is the reconstruction of quantum mechanics on the basis of a formal language of quantum mechanical propositions. During recent years, research in the foundations of the language of science has given rise to adialogic semantics that is adequate in the case of a formal language for quantum physics. The system ofsequential logic which is comprised by the language is more general than classical logic; it includes the classical system as a special case. Although the system of sequential logic can be founded without reference to the empirical content of quantum physical propositions, it establishes an essential part of the structure of the mathematical formalism used in quantum mechanics. It is the purpose of this paper to demonstrate the connection between the formal language of quantum physics and its representation by mathematical structures in a self-contained way.     

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     

Dimensional Reduction in Vector Space Methods for Natural Language Processing: Products and Projections

We introduce vector space based approaches to natural language processing and some of their similarities with quantum theory when applied to information retrieval. We explain how dimensional reduction is called for from both a practical and theoretical point of view and how this can be achieved through choice of product or through projectors onto subspaces.     

Are Words the Quanta of Human Language? Extending the Domain of Quantum Cognition

In previous research, we showed that ‘texts that tell a story’ exhibit a statistical structure that is not Maxwell–Boltzmann but Bose–Einstein. Our explanation is that this is due to the presence of ‘indistinguishability’ in human language as a result of the same words in different parts of the story being indistinguishable from one another, in much the same way that ’indistinguishability’ occurs in quantum mechanics, also there leading to the presence of Bose–Einstein rather than Maxwell–Boltzmann as a statistical structure. In the current article, we set out to provide an explanation for this Bose–Einstein statistics in human language. We show that it is the presence of ‘meaning’ in ‘texts that tell a story’ that gives rise to the lack of independence characteristic of Bose–Einstein, and provides conclusive evidence that ‘words can be considered the quanta of human language’, structurally similar to how ‘photons are the quanta of electromagnetic radiation’. Using several studies on entanglement from our Brussels research group, we also show, by introducing the von Neumann entropy for human language, that it is also the presence of ‘meaning’ in texts that makes the entropy of a total text smaller relative to the entropy of the words composing it. We explain how the new insights in this article fit in with the research domain called ‘quantum cognition’, where quantum probability models and quantum vector spaces are used in human cognition, and are also relevant to the use of quantum structures in information retrieval and natural language processing, and how they introduce ‘quantization’ and ‘Bose–Einstein statistics’ as relevant quantum effects there. Inspired by the conceptuality interpretation of quantum mechanics, and relying on the new insights, we put forward hypotheses about the nature of physical reality. In doing so, we note how this new type of decrease in entropy, and its explanation, may be important for the development of quantum thermodynamics. We likewise note how it can also give rise to an original explanatory picture of the nature of physical reality on the surface of planet Earth, in which human culture emerges as a reinforcing continuation of life.     

CPU vs. GPU - Performance comparison for the Gram-Schmidt algorithm

The Gram-Schmidt method is a classical method for determining QR decompositions, which is commonly used in many applications in computational physics, such as orthogonalization of quantum mechanical operators or Lyapunov stability analysis. In this paper, we discuss how well the Gram-Schmidt method performs on different hardware architectures, including both state-of-the-art GPUs and CPUs. We explain, in detail, how a smart interplay between hardware and software can be used to speed up those rather compute intensive applications as well as the benefits and disadvantages of several approaches. In addition, we compare some highly optimized standard routines of the BLAS libraries against our own optimized routines on both processor types. Particular attention was paid to the strong hierarchical memory of modern GPUs and CPUs, which requires cache-aware blocking techniques for optimal performance. Our investigations show that the performance strongly depends on the employed algorithm, compiler and a little less on the employed hardware. Remarkably, the performance of the NVIDIA CUDA BLAS routines improved significantly from CUDA 3.2 to CUDA 4.0. Still, BLAS routines tend to be slightly slower than manually optimized code on GPUs, while we were not able to outperform the BLAS routines on CPUs. Comparing optimized implementations on different hardware architectures, we find that a NVIDIA GeForce GTX580 GPU is about 50% faster than a corresponding Intel X5650 Westmere hexacore CPU. The self-written codes are included as supplementary material.     

Information in asset pricing: a wave function approach

This paper introduces a quantum‐like wave function as an information wave function. We show how the option pricing partial differential equation can be re‐written when we account for such information wave function. We use two stochastic differential equations, one of which relates to Nelson's hypothesis of Universal Brownian motion. We also provide for two examples which further highlight the proposed theory.     

虚拟仪器在大学物理实验中的应用

大学物理实验向来是本科教学中的重要环节,将计算机技术与大学物理实验的演示和教学结合起来是未来教学的必然趋势．本文基于Labwindows／CVI开发环境,配合NI-6009数据采集卡,以“非平衡电桥应用”等实验为例,用虚拟仪器来实现大学物理实验的数据采集、处理过程,不仅使开发物理实验软件的过程相对简单,而且可以使大学物理实验更加生动、直观,从而提高大学物理实验教学质量．     

Quantum nature of cosmological bounces

Several examples are known where quantum gravity effects resolve the classical big bang singularity by a bounce. The most detailed analysis has probably occurred for loop quantum cosmology of isotropic models sourced by a free, massless scalar. Once a bounce has been realized under fairly general conditions, the central questions are how strongly quantum it behaves, what influence quantum effects can have on its appearance, and what quantum space-time beyond the bounce may look like. This, then, has to be taken into account for effective equations which describe the evolution properly and can be used for further phenomenological investigations. Here, we provide the first analysis with interacting matter with new effective equations valid for weak self-interactions or small masses. They differ from the free scalar equations by crucial terms and have an important influence on the bounce and the space-time around it. Especially the role of squeezed states, which have often been overlooked in this context, is highlighted. The presence of a bounce is proven for uncorrelated states, but as squeezing is a dynamical property and may change in time, further work is required for a general conclusion.     

Quantum information,oscillations and the psyche

In this paper, taking the theory of quantum information as a model, we consider the human unconscious, pre-consciousness and consciousness as sets of quantum bits (qubits). We view how there can be communication between these various qubit sets. In doing this we are inspired by the theory of nuclear magnetic resonance. In this way we build a model of handling a mental qubit with the help of pulses of a mental field. Starting with an elementary interaction between two qubits we build two-qubit quantum logic gates that allow information to be transferred from one qubit to the other. In this manner we build a quantum process that permits consciousness to “read” the unconscious and vice versa. The elementary interaction, e.g. between a pre-consciousness qubit and a consciousness one, allows us to predict the time evolution of the pre-consciousness + consciousness system in which pre-consciousness and consciousness are quantum entangled. This time evolution exhibits Rabi oscillations that we name mental Rabi oscillations. This time evolution shows how for example the unconscious can influence consciousness. In a process like mourning the influence of the unconscious on consciousness, as the influence of consciousness on the unconscious, are in agreement with what is observed in psychiatry.     

A further link(s) with inequivalent representations in quantum field theory

In recent years it has become more apparent how useful inequivalent representations of the CCR and CAR in quantum field theory may be in describing and explaining physical phenomena, and several properties and concepts have been stated, referred to, and/or developed in the literature on these ideas. In this paper, some of these are reviewed, and some further properties and concepts are developed as further links in understanding these inequivalent representations in quantum field theory. One of these is a statement as to what actually breaks down in some field theories in the transformation between representations which are unitarily inequivalent. This is developed using the language and ideas of point quantum mechanical invariance, since this should be more familiar to a much larger number of physicists. Also, a statement on state expectation values is developed which can be used as a criterion for the occurrence of inequivalent representations of the CCR and CAR in field theories.