QPL

swMATH39237MaRDI QIDQ54937FDOQ54937

Author name not available (Why is that?)

Cited In (83)

• Model checking quantum Markov chains
• Information processing in convex operational theories
• De-linearizing linearity: projective quantum axiomatics from strong compact closure
• Quantum Markov chains: description of hybrid systems, decidability of equivalence, and model checking linear-time properties
• On block structures in quantum computation
• Quantum circuit oracles for abstract machine computations
• Concrete resource analysis of the quantum linear-system algorithm used to compute the electromagnetic scattering cross section of a 2D target
• A sublinear analog of the Banach-Mazur theorem in separated convex cones with norm
• QPCF: higher-order languages and quantum circuits
• A proof system for disjoint parallel quantum programs
• Natural Quantum Operational Semantics with Predicates
• Quantum data and control made easier
• Probabilistic bisimulations for quantum processes
• Towards a quantum domain theory: order-enrichment and fixpoints in \(W^*\)-algebras
• Presheaf Models of Quantum Computation: An Outline
• An overview of QML with a concrete implementation in Haskell
• Confluence results for a quantum lambda calculus with measurements
• On a fully abstract model for a quantum linear functional language (extended abstract)
• Reachability analysis of quantum Markov decision processes
• Classical control and quantum circuits in enriched category theory
• Models of quantum computation and quantum programming languages
• Commutativity of quantum weakest preconditions
• Idempotents in dagger categories (extended abstract)
• Generalised quantum weakest preconditions
• Proof rules for the correctness of quantum programs
• Termination of nondeterministic quantum programs
• Symbolic Bisimulation for Quantum Processes
• Borel kernels and their approximation, categorically
• Distributed quantum programming
• Quantum walks: a comprehensive review
• Complete positivity and natural representation of quantum computations
• Quantum patterns and types for entanglement and separability
• Measurement-Based and Universal Blind Quantum Computation
• Quantum fuzzy inference for knowledge base design in robust intelligent controllers
• Pictures of complete positivity in arbitrary dimension
• Relating toy models of quantum computation: comprehension, complementarity and dagger mix autonomous categories
• Quantum computer simulation using the CUDA programming model
• An algebra of pure quantum programming
• On hybrid models of quantum finite automata
• Simulating and compiling code for the sequential quantum random access machine
• Semantics for a quantum programming language by operator algebras
• Sized Types for Low-Level Quantum Metaprogramming
• Local tomography and the Jordan structure of quantum theory
• Title not available (Why is that?)
• Reasoning about faulty quantum programs
• Semi-automated verification of security proofs of quantum cryptographic protocols
• Title not available (Why is that?)
• Dagger compact closed categories and completely positive maps (extended abstract)
• Semantics of higher-order quantum computation via geometry of interaction
• The Arrow Calculus as a Quantum Programming Language
• Partially traced categories
• Game Semantics for Quantum Stores
• Quantum computation: from a programmer's perspective
• Quantum implicit computational complexity
• Generating and using truly random quantum states in \texttt{Mathematica}
• Symmetry, compact closure and dagger compactness for categories of convex operational models
• HAHN-BANACH TYPE THEOREMS ON FUNCTIONAL SEPARATION FOR CONVEX ORDERED NORMED CONES
• From reversible to irreversible computations
• On quantum and probabilistic linear lambda-calculi (extended abstract)
• О вложении однозначно делимой абелевой полугруппы в выпуклый конус
• The \(C\)-topology on lattice-ordered groups
• A quantum game semantics for the measurement calculus
• Quantum Control in the Unitary Sphere: Lambda-S1 and its Categorical Model
• Towards implementation of a generalized architecture for high-level quantum programming language
• Toward automatic verification of quantum programs
• A hierarchy of quantum semantics
• Towards a quantum programming language
• Quantum loop programs
• Approximating Markov Processes by Averaging
• An algebra of automata that includes both classical and quantum entities
• Title not available (Why is that?)
• A Lambda Calculus for Density Matrices with Classical and Probabilistic Controls
• Towards a quantum calculus (work in progress, extended abstract)
• Linear logic in normed cones: probabilistic coherence spaces and beyond
• Unordered Tuples in Quantum Computation
• Concurrent Quantum Strategies
• Title not available (Why is that?)
• Title not available (Why is that?)
• Game semantics for quantum data
• Techniques for Formal Modelling and Analysis of Quantum Systems
• Automating quantum experiment control. From circuit compilation to ion routing
• Quantum programs with classical output streams (extended abstract)
• Optimal quantum networks and one-shot entropies

This page was built for software: QPL