Towards a quantum programming language
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Reasoning about faulty quantum programs
- Quantum implicit computational complexity
- Reachability analysis of quantum Markov decision processes
- From symmetric pattern-matching to quantum control
- Semantics for a quantum programming language by operator algebras
- Towards implementation of a generalized architecture for high-level quantum programming language
- Quantum walks: a comprehensive review
- Distributed quantum programming
- Partially traced categories
- A proof system for disjoint parallel quantum programs
- Classical control and quantum circuits in enriched category theory
- Semantics of quantum programming languages: Classical control, quantum control
- On well-founded and recursive coalgebras
- Quantum programming with inductive datatypes: causality and affine type theory
- Verifying quantum communication protocols with ground bisimulation
- Models of quantum computation and quantum programming languages
- QPCF: higher-order languages and quantum circuits
- Formal meta-level analysis framework for quantum programming languages
- On hybrid models of quantum finite automata
- Commutativity of quantum weakest preconditions
- Automating quantum experiment control. From circuit compilation to ion routing
- Termination of nondeterministic quantum programs
- Proof rules for the correctness of quantum programs
- Probabilistic bisimulations for quantum processes
- Compiling quantum programs
- Classical concepts in quantum programming
- Complete positivity and natural representation of quantum computations
- On block structures in quantum computation
- scientific article; zbMATH DE number 1612487 (Why is no real title available?)
- On quantum and probabilistic linear lambda-calculi (extended abstract)
- An overview of QML with a concrete implementation in Haskell
- Modelling parallel quantum computing using transactional memory
- Relating toy models of quantum computation: comprehension, complementarity and dagger mix autonomous categories
- Confluence results for a quantum lambda calculus with measurements
- An algebra of automata that includes both classical and quantum entities
- Towards a quantum domain theory: order-enrichment and fixpoints in W^*-algebras
- An algebra of pure quantum programming
- De-linearizing linearity: projective quantum axiomatics from strong compact closure
- Simulating and compiling code for the sequential quantum random access machine
- Quantum patterns and types for entanglement and separability
- Dagger compact closed categories and completely positive maps (extended abstract)
- Quantum programs with classical output streams (extended abstract)
- Quantum programming with mixed states
- A hierarchy of quantum semantics
- An introduction to quantum programming in Quipper
- A quantum game semantics for the measurement calculus
- From reversible to irreversible computations
- Towards a quantum calculus (work in progress, extended abstract)
- Quantum data and control made easier
- Idempotents in dagger categories (extended abstract)
- On a fully abstract model for a quantum linear functional language (extended abstract)
- On quantum lambda calculi: a foundational perspective
- scientific article; zbMATH DE number 6712184 (Why is no real title available?)
- \textsc{qPCF}: a language for quantum circuit computations
- Pictures of complete positivity in arbitrary dimension
- Parallel self-testing of the GHZ state with a proof by diagrams
- Semantics of higher-order quantum computation via geometry of interaction
- Linear-algebraic λ-calculus: higher-order, encodings, and confluence.
- scientific article; zbMATH DE number 5708042 (Why is no real title available?)
- Towards a typed geometry of interaction
- Measurement-Based and Universal Blind Quantum Computation
- Quantum Predicative Programming
- On a measurement-free quantum lambda calculus with classical control
- Proceedings of the 4th international workshop on quantum programming languages (QPL 2006), Oxford, UK, 17--19 July 2006
- Model checking quantum Markov chains
- scientific article; zbMATH DE number 1512863 (Why is no real title available?)
- Quantum computation: from a programmer's perspective
- A categorical analogue of the monoid semiring construction
- Semi-automated verification of security proofs of quantum cryptographic protocols
- Presheaf models of quantum computation: an outline
- Techniques for Formal Modelling and Analysis of Quantum Systems
- Quantum Markov chains: description of hybrid systems, decidability of equivalence, and model checking linear-time properties
- On the automation of encoding processes in the quantum IO monad
- scientific article; zbMATH DE number 7364199 (Why is no real title available?)
- Quantum alternation: prospects and problems
- Unordered tuples in quantum computation
- Analysis of quantum entanglement in quantum programs using stabilizer formalism
- Quantum programming made easy
- Computational adequacy for substructural lambda calculi
- Quantum Control in the Unitary Sphere: Lambda-S1 and its Categorical Model
- A Lambda Calculus for Density Matrices with Classical and Probabilistic Controls
- Differentials and distances in probabilistic coherence spaces
- scientific article; zbMATH DE number 7561601 (Why is no real title available?)
- Classical control, quantum circuits and linear logic in enriched category theory
- Concurrent quantum strategies
- FJQuantum. A quantum object oriented language
- Functional and Logic Programming
- Natural Quantum Operational Semantics with Predicates
- Applying quantitative semantics to higher-order quantum computing
- Game semantics for quantum stores
- Quantum programming languages: survey and bibliography
- A lambda calculus for quantum computation with classical control
- Probabilistic coherence spaces as a model of higher-order probabilistic computation
- Typed Lambda Calculi and Applications
- A computer scientist’s reconstruction of quantum theory*
- Software science view on quantum circuit algorithms
- Classically time-controlled quantum automata
- Abstract interpretation, Hoare logic, and incorrectness logic for quantum programs
- Quantum symbolic execution
- A programming language characterizing quantum polynomial time
This page was built for publication: Towards a quantum programming language
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4818937)
