Quantum programming made easy
From MaRDI portal
Recommendations
Cites work
- \(\mathcal{Q}\)\textsc{wire} practice: formal verification of quantum circuits in Coq
- \textsc{qPCF}: a language for quantum circuit computations
- A branching distributed temporal logic for reasoning about entanglement-free quantum state transformations
- A categorical model for a quantum circuit description language (extended abstract)
- A class of recursive permutations which is primitive recursive complete
- A class of reversible primitive recursive functions
- A lambda calculus for quantum computation with classical control
- A stable programming language
- An approach to deciding the observational equivalence of Algol-like languages
- An introduction to quantum programming in Quipper
- An overview of QML with a concrete implementation in Haskell
- Applying quantitative semantics to higher-order quantum computing
- Computational Complexity
- Formal meta-level analysis framework for quantum programming languages
- scientific article; zbMATH DE number 5076264 (Why is no real title available?)
- scientific article; zbMATH DE number 5708038 (Why is no real title available?)
- Measurements and confluence in quantum lambda calculi with explicit qubits
- Modal deduction systems for quantum state transformations
- Non-determinism, non-termination and the strong normalization of System T
- On natural deduction in classical first-order logic: Curry-Howard correspondence, strong normalization and Herbrand's theorem
- On quantum lambda calculi: a foundational perspective
- On the Power of Quantum Computation
- Probabilistic game semantics
- Probabilistic operational semantics for the lambda calculus
- QPCF: higher-order languages and quantum circuits
- Quantum computation and quantum information. 10th anniversary edition
- Quantum State Transformations and Branching Distributed Temporal Logic
- QWIRE: a core language for quantum circuits
- Towards a quantum programming language
- Types and programing languages
- Wave-style token machines and quantum lambda calculi
Cited in
(9)- The fixed point problem of a simple reversible language
- QPCF: higher-order languages and quantum circuits
- Compiling quantum programs
- An introduction to quantum programming in Quipper
- Quantum data and control made easier
- \textsc{qPCF}: a language for quantum circuit computations
- Quantum alternation: prospects and problems
- Type-safe quantum programming in Idris
- Q\# as a quantum algorithmic language
This page was built for publication: Quantum programming made easy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5018491)
