Journal of Advance Research in Computer Science & Engineering

Computing Capabilities of Crystals

Aleksey A. Demidov

Published Dec 31, 2015• 0 citations

Abstract

The work is devoted to investigation from the standpoint of quantum physics the possibility of using the scattering of a beam of light on crystals for calculations. There is proposed a model of computation, corresponding the transformation of the light beam as it passes through the crystal, and provided the necessary formulas for the calculation of the model. It is necessary to emphasize the abstract nature of the research, which is aimed at creation of the theoretical basis for further study of the produced algebraic structures, rather than the construction of a real device – a quantum computer or the like. The work carried out by the program of creation of algebraic computer.

DOI: 10.53555/nncse.v2i12.437

Related papers

Quantum Mechanics and physical calculations

Hamlet Karayan

We suggest to realize the computer simulation and calculation by the algebraic structure built on the basis of the logic inherent to processes in physical systems (called physical computing). We suggest a principle for the construction of quantum algorithms of neuroinformatics of quantum neural networks. The role of academician Sahakyan is emphasized in the development of quantum physics in Armenia.

Journal of Physics Conference SeriesMar 25, 20142 citations

Fermionic coherent states

Monique Combescure, Didier Robert

The aim of this paper is to give a self-contained and unified presentation of a fermionic coherent state theory with the necessary mathematical details, discussing their definition, properties and some applications. After defining Grassmann algebras, it is possible to get a classical analog for the fermionic degrees of freedom in a quantum system. Following the basic work of Berezin (1966 The Method of Second Quantization (New York: Academic); 1987 Introduction to Superanalysis (Dordrecht: Reidel Publishing Company)), we show that we can compute with Grassmann numbers as we do with complex numbers: derivation, integration, Fourier transform. After that we show that we have quantization formulas for fermionic observables. In particular, there exists a Moyal product formula. As an application, we consider explicit computations for propagators with quadratic Hamiltonians in annihilation and creation operators. We prove a Mehler formula for the propagator and Mehlig–Wilkinson-type formulas for the covariant and contravariant symbols of ‘metaplectic’ transformations for fermionic states. This article is part of a special issue of Journal of Physics A: Mathematical and Theoretical devoted to ‘Coherent states: mathematical and physical aspects’.

Journal of Physics A Mathematical and TheoreticalMay 30, 201215 citations

Possible schemes of calculation modeling in a quantum computer

Vladimir Kirillivich Voronov

In the present work a possibility of computation modeling, which should be realized in a real quantum computer, is discussed. In this connection two models of a device, which work is determined by the structure and dynamics of real molecular systems are reported.

Natural ScienceJan 1, 20106 citations

Quantum Calculations to Transforming Dante into Recursive Algebra for Enhanced NLG

Javier Julián Enríquez

This research explores the frontier of Quantum Natural Language Processing (QNLP) by investigating the application of quantum computation to enhancing Natural Language Generation (NLG). Specifically, it proposes a novel approach to transforming complex literary texts, exemplified by Dante Alighieri's Divine Comedy, into recursive algebraic structures suitable for quantum processing. By leveraging category theory and tensor algebra, this methodology aims to model grammatical and semantic structures, enabling quantum computers to better handle context and ambiguity than classical methods. The core objective is to develop a framework for quantum-informed recursive optimization algorithms that can be applied to NLG tasks, thereby improving text generation capabilities.

Jun 18, 20260 citations

Implementation of Operations of a Quantum Computer in the Language of the Algebra of Multidimensional Matrices

Galina Grigoryeva, Valerii Khodchenkov

This paper describes the possibility of representing the operations of a quantum computer in the language of the algebra of multidimensional matrices, which in turn can lead to the possibility of creating a matrix adder based on quantum computations. This will create a processor that implements quantum linear algebra of multidimensional matrices.

IEEE Conference of Russian Young Researchers in Electrical and Electronic EngineeringJan 26, 20210 citations

Towards quantum program calculation

Ana Neri

Based on the similarity between the categorial derivation of classical programs from their specification and the category theory approach to quantum physics, this dissertation aims at extending the laws of classical program algebra to quantum programming. In this context, the principles of the algebra of classical programs are applied to quantum programming, in order to verify the feasibility of creating correct-by-construction quantum circuits that can run on quantum devices available in the IBM Q Experience. The reversibility restrictions of quantum circuits are ensured by minimal complements. Moreover, measurements are postponed to the end of recursive computations called “quantamorphisms” to avoid the collapse of quantum states. Quantamorphisms are classical catamorphisms extended to ensure quantum reversibility. The derived quantamorphisms implement quantum cycles (vulg. for-loops) and quantum folds on lists. By Kleisli correspondence, quantamorphisms can be written as monadic functional programs with quantum parameters. This enables the use of Haskell, a monadic functional programming language, to perform the experimental work. The examples of the calculated quantum programs are simulated in Haskell, Quipper and QISKit and run on the quantum computers of the IBM Q Experience. The main conclusions of this work are that, while all the simulations produced correspond to the predicted results, running these programs on real quantum devices results in a significant amount of errors. As quantum devices are constantly evolving, it is likely that in the near future these devices will increase their reliability, allowing programs to run more accurately. The extension of the quantamorphism concept to more general input structures, such as finite trees, remains a challenge that is left for future work. Also relevant will be the study of conditional quantum control without measurements, which will extend the scope of quantamorphisms as quantum circuit specifications.

Jan 1, 20181 citation