QPL

swMATH39237MaRDI QIDQ54937

No author found.

Related Items (83)

On block structures in quantum computation ⋮ Towards a quantum domain theory: order-enrichment and fixpoints in \(W^*\)-algebras ⋮ Classical control and quantum circuits in enriched category theory ⋮ Quantum Control in the Unitary Sphere: Lambda-S1 and its Categorical Model ⋮ Reachability analysis of quantum Markov decision processes ⋮ Borel kernels and their approximation, categorically ⋮ A Lambda Calculus for Density Matrices with Classical and Probabilistic Controls ⋮ Commutativity of quantum weakest preconditions ⋮ Pictures of complete positivity in arbitrary dimension ⋮ Towards a quantum programming language ⋮ Semantics of higher-order quantum computation via geometry of interaction ⋮ Linear logic in normed cones: probabilistic coherence spaces and beyond ⋮ Symmetry, compact closure and dagger compactness for categories of convex operational models ⋮ Natural Quantum Operational Semantics with Predicates ⋮ Semantics for a quantum programming language by operator algebras ⋮ Automating quantum experiment control. From circuit compilation to ion routing ⋮ Concrete resource analysis of the quantum linear-system algorithm used to compute the electromagnetic scattering cross section of a 2D target ⋮ Model checking quantum Markov chains ⋮ Quantum computer simulation using the CUDA programming model ⋮ Unordered Tuples in Quantum Computation ⋮ О вложении однозначно делимой абелевой полугруппы в выпуклый конус ⋮ Unnamed Item ⋮ Partially traced categories ⋮ Towards implementation of a generalized architecture for high-level quantum programming language ⋮ Generating and using truly random quantum states in \texttt{Mathematica} ⋮ HAHN-BANACH TYPE THEOREMS ON FUNCTIONAL SEPARATION FOR CONVEX ORDERED NORMED CONES ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Quantum computation: from a programmer's perspective ⋮ Local tomography and the Jordan structure of quantum theory ⋮ Termination of nondeterministic quantum programs ⋮ Proof rules for the correctness of quantum programs ⋮ Toward automatic verification of quantum programs ⋮ Semi-automated verification of security proofs of quantum cryptographic protocols ⋮ Probabilistic bisimulations for quantum processes ⋮ Quantum Markov chains: description of hybrid systems, decidability of equivalence, and model checking linear-time properties ⋮ A sublinear analog of the Banach-Mazur theorem in separated convex cones with norm ⋮ Models of quantum computation and quantum programming languages ⋮ Quantum circuit oracles for abstract machine computations ⋮ Game Semantics for Quantum Stores ⋮ Measurement-Based and Universal Blind Quantum Computation ⋮ Quantum walks: a comprehensive review ⋮ Symbolic Bisimulation for Quantum Processes ⋮ Distributed quantum programming ⋮ Presheaf Models of Quantum Computation: An Outline ⋮ Techniques for Formal Modelling and Analysis of Quantum Systems ⋮ Quantum loop programs ⋮ Generalised quantum weakest preconditions ⋮ Unnamed Item ⋮ Quantum fuzzy inference for knowledge base design in robust intelligent controllers ⋮ Complete positivity and natural representation of quantum computations ⋮ Approximating Markov Processes by Averaging ⋮ A proof system for disjoint parallel quantum programs ⋮ The Arrow Calculus as a Quantum Programming Language ⋮ Information Processing in Convex Operational Theories ⋮ Game Semantics for Quantum Data ⋮ On Quantum and Probabilistic Linear Lambda-calculi (Extended Abstract) ⋮ An Overview of QML With a Concrete Implementation in Haskell ⋮ 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 ⋮ Reasoning about faulty quantum programs ⋮ Concurrent Quantum Strategies ⋮ Sized Types for Low-Level Quantum Metaprogramming ⋮ Quantum implicit computational complexity ⋮ QPCF: higher-order languages and quantum circuits ⋮ The \(C\)-topology on lattice-ordered groups ⋮ Optimal quantum networks and one-shot entropies ⋮ 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 ⋮ Quantum Programs With Classical Output Streams ⋮ A Hierarchy of Quantum Semantics ⋮ A Quantum Game Semantics for the Measurement Calculus ⋮ From Reversible to Irreversible Computations ⋮ Towards a Quantum Calculus ⋮ Quantum Data and Control Made Easier ⋮ Idempotents in Dagger Categories ⋮ On a Fully Abstract Model for a Quantum Linear Functional Language ⋮ On hybrid models of quantum finite automata

This page was built for software: QPL