Corpus ID: 236469432

Semantics for Variational Quantum Programming

@article{Jia2021SemanticsFV,
  title={Semantics for Variational Quantum Programming},
  author={Xiaodong Jia and Andre Kornell and Bert Lindenhovius and Michael W. Mislove and Vladimir Zamdzhiev},
  journal={ArXiv},
  year={2021},
  volume={abs/2107.13347}
}
We consider a programming language that can manipulate both classical and quantum information. Our language is type-safe and designed for variational quantum programming, which is a hybrid classical-quantum computational paradigm. The classical subsystem of the language is the Probabilistic FixPoint Calculus (PFPC), which is a lambda calculus with mixed-variance recursive types, term recursion and probabilistic choice. The quantum subsystem is a first-order linear type system that can… Expand

Figures from this paper

Commutative Monads for Probabilistic Programming Languages
TLDR
This paper shows how to use these monads to provide a sound and adequate denotational semantics for the Probabilistic FixPoint Calculus (PFPC) – a call-by-value simply-typed lambda calculus with mixed-variance recursive types, term recursion and probabilistic choice. Expand
Qimaera: Type-safe (Variational) Quantum Programming in Idris
Variational Quantum Algorithms are hybrid classical-quantum algorithms where classical and quantum computationwork in tandem to solve computational problems. These algorithms create interestingExpand