scholarly journals OpenQL: A Portable Quantum Programming Framework for Quantum Accelerators

2022 ◽  
Vol 18 (1) ◽  
pp. 1-24
Author(s):  
N. Khammassi ◽  
I. Ashraf ◽  
J. V. Someren ◽  
R. Nane ◽  
A. M. Krol ◽  
...  
Keyword(s):  
Programming Language ◽  
Quantum Algorithms ◽  
Quantum Circuit ◽  
Quantum Operations ◽  
Programming Framework ◽  
Quantum Processor ◽  
Control Electronics ◽  
Quantum Programming ◽  
High Level ◽  
Programming Interface

With the potential of quantum algorithms to solve intractable classical problems, quantum computing is rapidly evolving, and more algorithms are being developed and optimized. Expressing these quantum algorithms using a high-level language and making them executable on a quantum processor while abstracting away hardware details is a challenging task. First, a quantum programming language should provide an intuitive programming interface to describe those algorithms. Then a compiler has to transform the program into a quantum circuit, optimize it, and map it to the target quantum processor respecting the hardware constraints such as the supported quantum operations, the qubit connectivity, and the control electronics limitations. In this article, we propose a quantum programming framework named OpenQL, which includes a high-level quantum programming language and its associated quantum compiler. We present the programming interface of OpenQL, we describe the different layers of the compiler and how we can provide portability over different qubit technologies. Our experiments show that OpenQL allows the execution of the same high-level algorithm on two different qubit technologies, namely superconducting qubits and Si-Spin qubits. Besides the executable code, OpenQL also produces an intermediate quantum assembly code, which is technology independent and can be simulated using the QX simulator.

Towards a quantum programming language

2004 ◽  
Vol 14 (4) ◽  
pp. 527-586 ◽  
Author(s):  
PETER SELINGER
Keyword(s):  
Programming Language ◽  
Quantum Algorithms ◽  
Denotational Semantics ◽  
Quantum Circuit ◽  
Structured Data ◽  
Data Types ◽  
Simple Quantum ◽  
Recursive Procedures ◽  
Quantum Programming ◽  
High Level

We propose the design of a programming language for quantum computing. Traditionally, quantum algorithms are frequently expressed at the hardware level, for instance in terms of the quantum circuit model or quantum Turing machines. These approaches do not encourage structured programming or abstractions such as data types. In this paper, we describe the syntax and semantics of a simple quantum programming language with high-level features such as loops, recursive procedures, and structured data types. The language is functional in nature, statically typed, free of run-time errors, and has an interesting denotational semantics in terms of complete partial orders of superoperators.

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 A Python Computer Science Course Taught with a New Web Platform

2018 ◽  
Author(s):  
Francis B. Lavoie ◽  
Pierre Proulx
Keyword(s):  
Computer Science ◽  
Open Source ◽  
Programming Language ◽  
Chemical Engineering ◽  
Computer Tools ◽  
The Future ◽  
High Level ◽  
Web Platform ◽  
Programming Interface

Computer science is now considered as the basis of the future economy. It is then important to adapt courses given to future engineers to this reality. All Canadian engineers now require a solid basis in computer science and, especially, they need to be aware of and able to use computer tools specific to their domain. Consequently, the Department of Chemical Engineering of the Université de Sherbrooke switched from Matlab teaching to Python with the Spyder programming interface in 2016. This latter high-level programming language is indeed free and open-source and, particularly, its use is constantly increasing in both research and industrial fields.

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

2017 ◽  
Vol 56 (8) ◽  
pp. 2376-2412 ◽  
Author(s):  
El-Mahdy M. Ameen ◽  
Hesham A. Ali ◽  
Mofreh M. Salem ◽  
Mahmoud Badawy
Keyword(s):  
Programming Language ◽  
Quantum Programming ◽  
High Level

scholarly journals Efficient Decomposition of Unitary Matrices in Quantum Circuit Compilers

2022 ◽  
Vol 12 (2) ◽  
pp. 759
Author(s):  
Anna M. Krol ◽  
Aritra Sarkar ◽  
Imran Ashraf ◽  
Zaid Al-Ars ◽  
Koen Bertels
Keyword(s):  
Quantum Algorithms ◽  
Optimization Method ◽  
Quantum Circuit ◽  
Quantum Gates ◽  
Underlying Structure ◽  
Quantum Computers ◽  
Unitary Matrices ◽  
Quantum Operations ◽  
Test Part ◽  
Input Gate

Unitary decomposition is a widely used method to map quantum algorithms to an arbitrary set of quantum gates. Efficient implementation of this decomposition allows for the translation of bigger unitary gates into elementary quantum operations, which is key to executing these algorithms on existing quantum computers. The decomposition can be used as an aggressive optimization method for the whole circuit, as well as to test part of an algorithm on a quantum accelerator. For the selection and implementation of the decomposition algorithm, perfect qubits are assumed. We base our decomposition technique on Quantum Shannon Decomposition, which generates O(344n) controlled-not gates for an n-qubit input gate. In addition, we implement optimizations to take advantage of the potential underlying structure in the input or intermediate matrices, as well as to minimize the execution time of the decomposition. Comparing our implementation to Qubiter and the UniversalQCompiler (UQC), we show that our implementation generates circuits that are much shorter than those of Qubiter and not much longer than the UQC. At the same time, it is also up to 10 times as fast as Qubiter and about 500 times as fast as the UQC.

scholarly journals Analyzing User Experience of Website for the Learning of Programming Language

2020 ◽  
Vol 6 (1) ◽  
pp. 1
Author(s):  
Derisma Derisma
Keyword(s):  
Data Processing ◽  
Programming Languages ◽  
Programming Language ◽  
User Experience ◽  
Measurement Method ◽  
Efficiency Score ◽  
Learning Effectiveness ◽  
Programming Framework ◽  
High Level ◽  
Experience Questionnaire

User experience is a term for the experience of users in having an easiness and efficiency in the interaction between humans and computers. CodeSaya is an easy, fun, and free place to learn about coding. There are some Programming Languages which can be learned. This research aimed to analyze the effectiveness of the codesaya.com website to learn the basics of programming by using a measurement method of the User Experience Questionnaire (UEQ). There are six examined scales, namely attractiveness, perspicuity, efficiency, dependability, stimulation, and novelty. The testing results showed that those six scales positively affected the students' attentions to use the programming framework with 1.722 of attractiveness score, 1.456 of perspicuity score, 1.718 of efficiency score, 1.46 of dependability score, and 1.44 of stimulation score, these scores showed that the five scales were at a high level, while novelty was at a moderate level with 1.147 of the score. According to the whole data processing and analysis were done in this study, it can be concluded that CodeSaya Website can improve the learning effectiveness of Programming Languages.

Quantum Computing and Quantum Communication

2018 ◽  
pp. 7715-7730
Author(s):  
Göran Pulkkis ◽  
Kaj J. Grahn
Keyword(s):  
Quantum Computing ◽  
Quantum Computation ◽  
Quantum Cryptography ◽  
Quantum Algorithms ◽  
Quantum Circuit ◽  
Quantum States ◽  
Future Perspectives ◽  
Quantum Informatics ◽  
Quantum Programming ◽  
Computing Models

This article presents state-of-the-art and future perspectives of quantum computing and communication. Timeline of relevant findings in quantum informatics, such as quantum algorithms, quantum cryptography protocols, and quantum computing models, is summarized. Mathematics of information representation with quantum states is presented. The quantum circuit and adiabatic models of quantum computation are outlined. The functionality, limitations, and security of the quantum key distribution (QKD) protocol is presented. Current implementations of quantum computers and principles of quantum programming are shortly described.

scholarly journals Advantages of a modular high-level quantum programming framework

2019 ◽  
Vol 66 ◽  
pp. 81-89
Author(s):  
Damian S. Steiger ◽  
Thomas Häner ◽  
Matthias Troyer
Keyword(s):  
Programming Framework ◽  
Quantum Programming ◽  
High Level

scholarly journals Observation of exceptional point in a PT broken non-Hermitian system simulated using a quantum circuit

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Geng-Li Zhang ◽  
Di Liu ◽  
Man-Hong Yung
Keyword(s):  
Large Scale ◽  
Quantum Circuit ◽  
Higher Order ◽  
Quantum Circuits ◽  
Exceptional Point ◽  
Large Scale Systems ◽  
Zeno Effect ◽  
Programming Framework ◽  
Circuit Structure ◽  
Quantum Programming

AbstractExceptional points (EPs), the degeneracy points of non-Hermitian systems, have recently attracted great attention because of their potential of enhancing the sensitivity of quantum sensors. Unlike the usual degeneracies in Hermitian systems, at EPs, both the eigenenergies and eigenvectors coalesce. Although EPs have been widely explored, the range of EPs studied is largely limited by the underlying systems, for instance, higher-order EPs are hard to achieve. Here we propose an extendable method to simulate non-Hermitian systems and study EPs with quantum circuits. The system is inherently parity-time (PT) broken due to the non-symmetric controlling effects of the circuit. Inspired by the quantum Zeno effect, the circuit structure guarantees the success rate of the post-selection. A sample circuit is implemented in a quantum programming framework, and the phase transition at EP is demonstrated. Considering the scalable and flexible nature of quantum circuits, our model is capable of simulating large-scale systems with higher-order EPs.

Boolean satisfiability in quantum compilation

2019 ◽  
Vol 378 (2164) ◽  
pp. 20190161 ◽  
Author(s):  
Mathias Soeken ◽  
Giulia Meuli ◽  
Bruno Schmitt ◽  
Fereshte Mozafari ◽  
Heinz Riener ◽  
...  
Keyword(s):  
Programming Language ◽  
Quantum Computer ◽  
Quantum Algorithm ◽  
Boolean Satisfiability ◽  
Good Match ◽  
Theme Issue ◽  
Autonomous Computing ◽  
Multi Stage ◽  
Quantum Programming ◽  
High Level

Quantum compilation is the task of translating a quantum algorithm implemented in a high-level quantum programming language into a technology-dependent instructions flow for a physical quantum computer. To tackle the large gap between the quantum program and the low-level instructions, quantum compilation is split into a multi-stage flow consisting of several layers of abstraction. Several different individual tasks have been proposed for the layers in the flow, many of them are NP-hard. In this article, we will describe the flow and we will propose algorithms based on Boolean satisfiability, which is a good match to tackle such computationally complex problems. This article is part of the theme issue ‘Harmonizing energy-autonomous computing and intelligence’.

Sign in / Sign up

Export Citation Format

Share Document