Quantum channelIn quantum information theory, a quantum channel is a communication channel which can transmit quantum information, as well as classical information. An example of quantum information is the state of a qubit. An example of classical information is a text document transmitted over the Internet. More formally, quantum channels are completely positive (CP) trace-preserving maps between spaces of operators. In other words, a quantum channel is just a quantum operation viewed not merely as the reduced dynamics of a system but as a pipeline intended to carry quantum information.
Quantum informationQuantum information is the information of the state of a quantum system. It is the basic entity of study in quantum information theory, and can be manipulated using quantum information processing techniques. Quantum information refers to both the technical definition in terms of Von Neumann entropy and the general computational term. It is an interdisciplinary field that involves quantum mechanics, computer science, information theory, philosophy and cryptography among other fields.
Marriageable ageMarriageable age (or marriage age) is the general age, as a legal age or as the minimum age subject to parental, religious or other forms of social approval, at which a person is legitimately allowed for marriage. Age and other prerequisites to marriage vary between jurisdictions, but in the vast majority of jurisdictions, the marriage age as a right is set at the age of majority. Nevertheless, most jurisdictions allow marriage at a younger age with parental or judicial approval, especially if the female is pregnant.
Preadditive categoryIn mathematics, specifically in , a preadditive category is another name for an Ab-category, i.e., a that is over the , Ab. That is, an Ab-category C is a such that every hom-set Hom(A,B) in C has the structure of an abelian group, and composition of morphisms is bilinear, in the sense that composition of morphisms distributes over the group operation. In formulas: and where + is the group operation. Some authors have used the term additive category for preadditive categories, but here we follow the current trend of reserving this term for certain special preadditive categories (see below).
S-expressionIn computer programming, an S-expression (or symbolic expression, abbreviated as sexpr or sexp) is an expression in a like-named notation for nested list (tree-structured) data. S-expressions were invented for and popularized by the programming language Lisp, which uses them for source code as well as data. In the usual parenthesized syntax of Lisp, an S-expression is classically defined as an atom of the form x, or an expression of the form (x . y) where x and y are S-expressions.
Distortion risk measureIn financial mathematics and economics, a distortion risk measure is a type of risk measure which is related to the cumulative distribution function of the return of a financial portfolio. The function associated with the distortion function is a distortion risk measure if for any random variable of gains (where is the Lp space) then where is the cumulative distribution function for and is the dual distortion function . If almost surely then is given by the Choquet integral, i.e.
Asynchronous serial communicationAsynchronous serial communication is a form of serial communication in which the communicating endpoints' interfaces are not continuously synchronized by a common clock signal. Instead of a common synchronization signal, the data stream contains synchronization information in form of start and stop signals, before and after each unit of transmission, respectively. The start signal prepares the receiver for arrival of data and the stop signal resets its state to enable triggering of a new sequence.
CorecursionIn computer science, corecursion is a type of operation that is to recursion. Whereas recursion works analytically, starting on data further from a base case and breaking it down into smaller data and repeating until one reaches a base case, corecursion works synthetically, starting from a base case and building it up, iteratively producing data further removed from a base case. Put simply, corecursive algorithms use the data that they themselves produce, bit by bit, as they become available, and needed, to produce further bits of data.
Patch (computing)A patch is a set of changes to a computer program or its supporting data designed to update, fix, or improve it. This includes fixing security vulnerabilities and other bugs, with such patches usually being called bugfixes or bug fixes. Patches are often written to improve the functionality, usability, or performance of a program. The majority of patches are provided by software vendors for operating system and application updates. Patches may be installed either under programmed control or by a human programmer using an editing tool or a debugger.
Comma categoryIn mathematics, a comma category (a special case being a slice category) is a construction in . It provides another way of looking at morphisms: instead of simply relating objects of a to one another, morphisms become objects in their own right. This notion was introduced in 1963 by F. W. Lawvere (Lawvere, 1963 p. 36), although the technique did not become generally known until many years later. Several mathematical concepts can be treated as comma categories. Comma categories also guarantee the existence of some s and colimits.
