scholarly journals On the Definition of Quantum Programming Modules

2021 ◽  
Vol 11 (13) ◽  
pp. 5843
Author(s):  
Pedro Sánchez ◽  
Diego Alonso
Keyword(s):  
Quantum Computing ◽  
Software Engineering ◽  
Programming Languages ◽  
Programming Approach ◽  
Quantum Computers ◽  
Programming Paradigm ◽  
Engineering Discipline ◽  
Quantum Programming ◽  
Definition Of ◽  
Key Aspects

There are no doubts that quantum programming and, in general, quantum computing, is one of the most promising areas within computer science and one of the areas where most expectations are being placed in recent years. Although the days when reliable and affordable quantum computers will be available is still a long way off, the explosion of programming languages for quantum programming has grown exponentially in recent years. The software engineering community has been quick to react to the need to adopt and adapt well-known tools and methods for software development, and for the design of new ones tailored to this new programming paradigm. However, many key aspects for its success depend on the establishment of an appropriate conceptual framework for the conception and design of quantum programs. This article discusses the concept of module, key in the software engineering discipline, and establishes initial criteria for determining the cohesion and coupling levels of a module in the field of quantum programming as a first step towards a sound quantum software engineering. As detailed in the article, the conceptual differences between classical and quantum computing are so pronounced that the translation of classical concepts to the new programming approach is not straightforward.

scholarly journals Tools for Performing and Emulating Quantum Computing

2020 ◽  
Vol 18 (2) ◽  
pp. 43-53
Author(s):  
Pavel E. Baskakov ◽  
Yuri Yu. Khabovets ◽  
Irina A. Pilipenko ◽  
Veronika O. Kravchenko ◽  
Larisa V. Cherkesova
Keyword(s):  
Quantum Computing ◽  
Programming Languages ◽  
Quantum Computer ◽  
Individual Characteristics ◽  
Computer Work ◽  
Quantum Computers ◽  
Web Interface ◽  
Advantages And Disadvantages ◽  
Quantum Programming ◽  
Main Language

Currently, quantum technologies are at the forefront of scientific thought. Large corporations are creating their own quantum supercomputers, developing quantum analogues of classical algorithms, and research is being conducted in the field of quantum cryptography. But since quantum computers have not yet become widespread, the question becomes relevant: how can ordinary users, scientists and researchers keep up with the development of science? One possible solution is to use various kinds of tools to emulate quantum computing on a local non-quantum computer. In addition, there is also the opportunity to have several qubits of IBM's quantum supercomputer available. As a rule, such tools are implemented in the form of libraries for various programming languages. Due to the fact that working with real quantum computers is available only to a narrow circle of researchers, emulators are simply necessary to test hypotheses or algorithms. This article examined the most popular quantum emulators used for quantum computing and allowing emulating the process of a quantum computer. Work was carried out to study quantum emulators, to identify and describe their individual characteristics, to make recommendations for a more convenient start to work with them, as well as to describe their advantages and disadvantages. A review of several libraries for the JavaScript, Python, C / C ++ languages was made, as well as a tool with a web interface (Quantum Programming Studio) and a set of tools from Microsoft (Microsoft Quantum Development Kit), the main language of which is Q #, is examined. At the end of the article, a conclusion is made regarding the considered tools.

scholarly journals Quantum Turing Machines: Computations and Measurements

2020 ◽  
Vol 10 (16) ◽  
pp. 5551
Author(s):  
Stefano Guerrini ◽  
Simone Martini ◽  
Andrea Masini
Keyword(s):  
Programming Languages ◽  
Classical Case ◽  
Turing Machines ◽  
Quantum Programming Languages ◽  
Quantum Programming ◽  
Definition Of ◽  
Observation Protocol ◽  
Class Of Functions ◽  
Computable Functions ◽  
Arbitrary Quantum

Contrary to the classical case, the relation between quantum programming languages and quantum Turing Machines (QTM) has not been fully investigated. In particular, there are features of QTMs that have not been exploited, a notable example being the intrinsic infinite nature of any quantum computation. In this paper, we propose a definition of QTM, which extends and unifies the notions of Deutsch and Bernstein & Vazirani. In particular, we allow both arbitrary quantum input, and meaningful superpositions of computations, where some of them are “terminated” with an “output”, while others are not. For some infinite computations an “output” is obtained as a limit of finite portions of the computation. We propose a natural and robust observation protocol for our QTMs, which does not modify the probability of the possible outcomes of the machines. Finally, we use QTMs to define a class of quantum computable functions—any such function is a mapping from a general quantum state to a probability distribution of natural numbers. We expect that our class of functions, when restricted to classical input-output, will not be different from the set of the recursive functions.

scholarly journals Invited Lecture: Notions of 'Theory' and their Practical Consequences in the Discipline of Software 'Engineering' (including Information Systems Design)

2020 ◽  
Vol 32 (2) ◽  
Author(s):  
Stefan Gruner
Keyword(s):  
Information Systems ◽  
Software Engineering ◽  
General Theory ◽  
Full Text ◽  
Systems Design ◽  
Information Systems Design ◽  
Domain Specific ◽  
Engineering Discipline ◽  
Definition Of

This contribution provides the full text to the invited lecture which I gave at the Annual Seminar of the Southern African Chapter of the Association for Information Systems (AISSAC), September the 14th, 2020. In this contribution, which thoroughly elaborates some of my earlier thoughts on this topic, I argue science-philosophically that the quest for a so-called 'general theory of software engineering' (GTSE) is, all-in-all, not feasible. More positively I also argue that software 'engineering' (which includes information systems design) might well become a 'proper' engineering discipline via the development and appropriate application of a multitude of domain-specific micro theories, by which successful engineering disciplines are typically characterized. Since different meta-theoretical opinions can be found even about what is a 'micro theory', I also explicate which definition of the notion of 'micro theory' is most appropriate in (and for) this particular domain of discourse.

scholarly journals QJava: A Monadic Java Library for Quantum Programming

2015 ◽  
Vol 22 (1) ◽  
pp. 242
Author(s):  
Juliana Kaizer Vizzotto ◽  
Bruno Crestani Calegaro
Keyword(s):  
Quantum Computing ◽  
Computer Science ◽  
Programming Languages ◽  
Programming Language ◽  
Quantum Algorithms ◽  
Quantum Circuit ◽  
Semantic Models ◽  
Quantum Programming ◽  
High Level ◽  
Java Library

To help the understanding and development of quantum algorithms there is an effort focused on the investigation of new semantic models and programming languages for quantum computing. Researchers in computer science have the challenge of deve loping programming languages to support the creation, analysis, modeling and simulation of high level quantum algorithms. Based on previous works that use monads inside the programming language Haskell to elegantly explain the odd characteristics of quantum computation (like superposition and entanglement), in this work we present a monadic Java library for quantum programming. We use the extension of the programming language Java called BGGA Closure, that allow the manipulation of anonymous functions (closures) inside Java. We exemplify the use of the library with an implementation of the Toffoli quantum circuit.

scholarly journals Learning programs for the quantum computer

2021 ◽  
Author(s):  
Olivia-Linda Enciu
Keyword(s):  
Genetic Programming ◽  
Optimization Problem ◽  
Quantum Computer ◽  
Optimal Solution ◽  
Programming Approach ◽  
Quantum Computers ◽  
Learning Programs ◽  
Estimation Of Distribution ◽  
Evolutionary Technique ◽  
Quantum Programming

Manual quantum programming is generally diffcult for humans, due to the often hard-to-grasp properties of quantum mechanics and quantum computers. By outlining the target (or desired) behaviour of a particular quantum program, the task of programming can be turned into a search and optimization problem. A flexible evolutionary technique known as genetic programming may then be used as an aid in the search for quantum programs. In this work a genetic programming approach uses an estimation of distribution algorithm (EDA) to learn the probability distribution of optimal solution(s), given some target behaviour of a quantum program.

scholarly journals Learning programs for the quantum computer

2021 ◽  
Author(s):  
Olivia-Linda Enciu
Keyword(s):  
Genetic Programming ◽  
Optimization Problem ◽  
Quantum Computer ◽  
Optimal Solution ◽  
Programming Approach ◽  
Quantum Computers ◽  
Learning Programs ◽  
Estimation Of Distribution ◽  
Evolutionary Technique ◽  
Quantum Programming

Manual quantum programming is generally diffcult for humans, due to the often hard-to-grasp properties of quantum mechanics and quantum computers. By outlining the target (or desired) behaviour of a particular quantum program, the task of programming can be turned into a search and optimization problem. A flexible evolutionary technique known as genetic programming may then be used as an aid in the search for quantum programs. In this work a genetic programming approach uses an estimation of distribution algorithm (EDA) to learn the probability distribution of optimal solution(s), given some target behaviour of a quantum program.

scholarly journals Expressibility of the alternating layered ansatz for quantum computation

Quantum ◽  
2021 ◽  
Vol 5 ◽  
pp. 434
Author(s):  
Kouhei Nakaji ◽  
Naoki Yamamoto
Keyword(s):  
Quantum Computing ◽  
Quantum Computation ◽  
Critical Issue ◽  
Quantum Circuits ◽  
Quantum Computers ◽  
Intermediate Scale ◽  
State Generation ◽  
Proper Definition ◽  
Definition Of ◽  
Designing Method

The hybrid quantum-classical algorithm is actively examined as a technique applicable even to intermediate-scale quantum computers. To execute this algorithm, the hardware efficient ansatz is often used, thanks to its implementability and expressibility; however, this ansatz has a critical issue in its trainability in the sense that it generically suffers from the so-called gradient vanishing problem. This issue can be resolved by limiting the circuit to the class of shallow alternating layered ansatz. However, even though the high trainability of this ansatz is proved, it is still unclear whether it has rich expressibility in state generation. In this paper, with a proper definition of the expressibility found in the literature, we show that the shallow alternating layered ansatz has almost the same level of expressibility as that of hardware efficient ansatz. Hence the expressibility and the trainability can coexist, giving a new designing method for quantum circuits in the intermediate-scale quantum computing era.

scholarly journals Special issue on quantum programming languages

2006 ◽  
Vol 16 (3) ◽  
pp. 373-374
Author(s):  
PETER SELINGER
Keyword(s):  
Quantum Computing ◽  
Computer Science ◽  
Programming Languages ◽  
Quantum Computation ◽  
International Workshop ◽  
Special Issue ◽  
Mathematical Structures ◽  
Quantum Programming Languages ◽  
Quantum Programming

This special issue of Mathematical Structures in Computer Science grew out of the 2nd International Workshop on Quantum Programming Languages (QPL 2004), which was held July 12–13, 2004 in Turku, Finland. The purpose of the workshop was to bring together researchers working on mathematical formalisms and programming languages for quantum computing. It was the second in a series of workshops aimed at addressing a growing interest in logical tools, languages, and semantical methods for analysing quantum computation.

scholarly journals Twist: sound reasoning for purity and entanglement in Quantum programs

2022 ◽  
Vol 6 (POPL) ◽  
pp. 1-32
Author(s):  
Charles Yuan ◽  
Christopher McNally ◽  
Michael Carbin
Keyword(s):  
Programming Languages ◽  
Quantum Algorithms ◽  
First Language ◽  
Type System ◽  
Runtime Verification ◽  
Quantum Computers ◽  
Programming Patterns ◽  
Quantum Programming Languages ◽  
Quantum Programming ◽  
Central Tool

Quantum programming languages enable developers to implement algorithms for quantum computers that promise computational breakthroughs in classically intractable tasks. Programming quantum computers requires awareness of entanglement , the phenomenon in which measurement outcomes of qubits are correlated. Entanglement can determine the correctness of algorithms and suitability of programming patterns. In this work, we formalize purity as a central tool for automating reasoning about entanglement in quantum programs. A pure expression is one whose evaluation is unaffected by the measurement outcomes of qubits that it does not own, implying freedom from entanglement with any other expression in the computation. We present Twist, the first language that features a type system for sound reasoning about purity. The type system enables the developer to identify pure expressions using type annotations. Twist also features purity assertion operators that state the absence of entanglement in the output of quantum gates. To soundly check these assertions, Twist uses a combination of static analysis and runtime verification. We evaluate Twist’s type system and analyses on a benchmark suite of quantum programs in simulation, demonstrating that Twist can express quantum algorithms, catch programming errors in them, and support programs that existing languages disallow, while incurring runtime verification overhead of less than 3.5%.

The Essence of Quantum Computing

2018 ◽  
Author(s):  
Rajendra K. Bera
Keyword(s):  
Hilbert Space ◽  
Quantum Computing ◽  
Quantum Physics ◽  
Quantum Algorithms ◽  
Quantum Computers ◽  
Turing Machines ◽  
Classical Physics ◽  
Core Set ◽  
The World ◽  
Subordinate Role

It now appears that quantum computers are poised to enter the world of computing and establish its dominance, especially, in the cloud. Turing machines (classical computers) tied to the laws of classical physics will not vanish from our lives but begin to play a subordinate role to quantum computers tied to the enigmatic laws of quantum physics that deal with such non-intuitive phenomena as superposition, entanglement, collapse of the wave function, and teleportation, all occurring in Hilbert space. The aim of this 3-part paper is to introduce the readers to a core set of quantum algorithms based on the postulates of quantum mechanics, and reveal the amazing power of quantum computing.

Sign in / Sign up

Export Citation Format

Share Document