179,128 research outputs found
Alternation in Quantum Programming: From Superposition of Data to Superposition of Programs
We extract a novel quantum programming paradigm - superposition of programs -
from the design idea of a popular class of quantum algorithms, namely quantum
walk-based algorithms. The generality of this paradigm is guaranteed by the
universality of quantum walks as a computational model. A new quantum
programming language QGCL is then proposed to support the paradigm of
superposition of programs. This language can be seen as a quantum extension of
Dijkstra's GCL (Guarded Command Language). Surprisingly, alternation in GCL
splits into two different notions in the quantum setting: classical alternation
(of quantum programs) and quantum alternation, with the latter being introduced
in QGCL for the first time. Quantum alternation is the key program construct
for realizing the paradigm of superposition of programs.
The denotational semantics of QGCL are defined by introducing a new
mathematical tool called the guarded composition of operator-valued functions.
Then the weakest precondition semantics of QGCL can straightforwardly derived.
Another very useful program construct in realizing the quantum programming
paradigm of superposition of programs, called quantum choice, can be easily
defined in terms of quantum alternation. The relation between quantum choices
and probabilistic choices is clarified through defining the notion of local
variables. We derive a family of algebraic laws for QGCL programs that can be
used in program verification, transformations and compilation. The expressive
power of QGCL is illustrated by several examples where various variants and
generalizations of quantum walks are conveniently expressed using quantum
alternation and quantum choice. We believe that quantum programming with
quantum alternation and choice will play an important role in further
exploiting the power of quantum computing.Comment: arXiv admin note: substantial text overlap with arXiv:1209.437
Reachability and Termination Analysis of Concurrent Quantum Programs
We introduce a Markov chain model of concurrent quantum programs. This model
is a quantum generalization of Hart, Sharir and Pnueli's probabilistic
concurrent programs. Some characterizations of the reachable space, uniformly
repeatedly reachable space and termination of a concurrent quantum program are
derived by the analysis of their mathematical structures. Based on these
characterizations, algorithms for computing the reachable space and uniformly
repeatedly reachable space and for deciding the termination are given.Comment: Accepted by Concur'12. Comments are welcom
An Integrated Programming and Development Environment for Adiabatic Quantum Optimization
Adiabatic quantum computing is a promising route to the computational power
afforded by quantum information processing. The recent availability of
adiabatic hardware has raised challenging questions about how to evaluate
adiabatic quantum optimization programs. Processor behavior depends on multiple
steps to synthesize an adiabatic quantum program, which are each highly
tunable. We present an integrated programming and development environment for
adiabatic quantum optimization called JADE that provides control over all the
steps taken during program synthesis. JADE captures the workflow needed to
rigorously specify the adiabatic quantum optimization algorithm while allowing
a variety of problem types, programming techniques, and processor
configurations. We have also integrated JADE with a quantum simulation engine
that enables program profiling using numerical calculation. The computational
engine supports plug-ins for simulation methodologies tailored to various
metrics and computing resources. We present the design, integration, and
deployment of JADE and discuss its potential use for benchmarking adiabatic
quantum optimization programs by the quantum computer science community.Comment: 28 pages, 17 figures, feedback welcomed, even if it's criticism; v2
manuscript updated based on reviewer feedback; v3 manuscript updated based on
reviewer feedback, title modifie
- …
