30,017 research outputs found
Extending scientific computing system with structural quantum programming capabilities
We present a basic high-level structures used for developing quantum
programming languages. The presented structures are commonly used in many
existing quantum programming languages and we use quantum pseudo-code based on
QCL quantum programming language to describe them. We also present the
implementation of introduced structures in GNU Octave language for scientific
computing. Procedures used in the implementation are available as a package
quantum-octave, providing a library of functions, which facilitates the
simulation of quantum computing. This package allows also to incorporate
high-level programming concepts into the simulation in GNU Octave and Matlab.
As such it connects features unique for high-level quantum programming
languages, with the full palette of efficient computational routines commonly
available in modern scientific computing systems. To present the major features
of the described package we provide the implementation of selected quantum
algorithms. We also show how quantum errors can be taken into account during
the simulation of quantum algorithms using quantum-octave package. This is
possible thanks to the ability to operate on density matrices
Quantum Programming Made Easy
We present IQu, namely a quantum programming language that extends Reynold's
Idealized Algol, the paradigmatic core of Algol-like languages. IQu combines
imperative programming with high-order features, mediated by a simple type
theory. IQu mildly merges its quantum features with the classical programming
style that we can experiment through Idealized Algol, the aim being to ease a
transition towards the quantum programming world. The proposed extension is
done along two main directions. First, IQu makes the access to quantum
co-processors by means of quantum stores. Second, IQu includes some support for
the direct manipulation of quantum circuits, in accordance with recent trends
in the development of quantum programming languages. Finally, we show that IQu
is quite effective in expressing well-known quantum algorithms.Comment: In Proceedings Linearity-TLLA 2018, arXiv:1904.0615
Quantum Computing and Quantum Algorithms
The field of quantum computing and quantum algorithms is studied from the ground up. Qubits and their quantum-mechanical properties are discussed, followed by how they are transformed by quantum gates. From there, quantum algorithms are explored as well as the use of high-level quantum programming languages to implement them. One quantum algorithm is selected to be implemented in the Qiskit quantum programming language. The validity and success of the resulting computation is proven with matrix multiplication of the qubits and quantum gates involved
An Exploratory Study on the Usage of Quantum Programming Languages
Tese de mestrado, Engenharia Informática, 2022, Universidade de Lisboa, Faculdade de CiênciasAs in the classical realm, the usage of quantum programming languages in quantum computing allows one to instruct a quantum computer to perform certain tasks. Although several imperative, declarative, and multi-paradigm quantum programming languages with different features and goals have been developed in the last 25 years, no study
has been conducted on who, how, and what for does one use a quantum programming
language. In this thesis, we first identified and described several quantum programming
languages and then surveyed 251 quantum practitioners to answer several questions related to the usage of quantum programming languages. Further, an analysis of the results
obtained is presented and shows that most of the quantum practitioners use the languages
for research and that Qiskit (Python) is the most used one. Finally, we make recommendations for further development of quantum programming languages, such as building on
top of a classical programming language, running in real quantum computers, supporting
language documentation, and consulting developers’ needs
Quantum Alternation: Prospects and Problems
We propose a notion of quantum control in a quantum programming language
which permits the superposition of finitely many quantum operations without
performing a measurement. This notion takes the form of a conditional construct
similar to the IF statement in classical programming languages. We show that
adding such a quantum IF statement to the QPL programming language simplifies
the presentation of several quantum algorithms. This motivates the possibility
of extending the denotational semantics of QPL to include this form of quantum
alternation. We give a denotational semantics for this extension of QPL based
on Kraus decompositions rather than on superoperators. Finally, we clarify the
relation between quantum alternation and recursion, and discuss the possibility
of lifting the semantics defined by Kraus operators to the superoperator
semantics defined by Selinger.Comment: In Proceedings QPL 2015, arXiv:1511.0118
An Algebra of Pure Quantum Programming
We develop a sound and complete equational theory for the functional quantum
programming language QML. The soundness and completeness of the theory are with
respect to the previously-developed denotational semantics of QML. The
completeness proof also gives rise to a normalisation algorithm following the
normalisation by evaluation approach. The current work focuses on the pure
fragment of QML omitting measurements.Comment: To appear in ENTCS, 3rd International Workshop on Quantum Programming
Languages, 2005. 21 Page
Evaluating probabilistic programming languages for simulating quantum correlations
This article explores how probabilistic programming can be used to simulate
quantum correlations in an EPR experimental setting. Probabilistic programs are
based on standard probability which cannot produce quantum correlations. In
order to address this limitation, a hypergraph formalism was programmed which
both expresses the measurement contexts of the EPR experimental design as well
as associated constraints. Four contemporary open source probabilistic
programming frameworks were used to simulate an EPR experiment in order to shed
light on their relative effectiveness from both qualitative and quantitative
dimensions. We found that all four probabilistic languages successfully
simulated quantum correlations. Detailed analysis revealed that no language was
clearly superior across all dimensions, however, the comparison does highlight
aspects that can be considered when using probabilistic programs to simulate
experiments in quantum physics.Comment: 24 pages, 8 figures, code is available at
https://github.com/askoj/bell-ppl
- …