Related papers: Defining Functions on Equivalence Classes
The term quantum neural computing indicates a unity in the functioning of the brain. It assumes that the neural structures perform classical processing and that the virtual particles associated with the dynamical states of the structures…
Lawvere observed in his celebrated work on hyperdoctrines that the set-theoretic schema of comprehension can be elegantly expressed in the functorial language of categorical logic, as a comprehension structure on the functor…
The quotient operation, which is dual to the composition, is crucial in specification theories as it allows the synthesis of missing specifications and thus enables incremental design. In this paper, we consider a specification theory based…
We define a notion of equivalence between algebraic dependent type theories which we call Morita equivalence. This notion has a simple syntactic description and an equivalent description in terms of models of the theories. The category of…
The past research on the state complexity of operations on regular languages is examined, and a new approach based on an old method (derivatives of regular expressions) is presented. Since state complexity is a property of a language, it is…
The physical constructs underlying the properties of quantum mechanics are explored. Arguments are given that the particle wave function as well as photon and phonon quanta must derive from a more fundamental physical construct that has not…
Quantum mechanics is more than the derivation of straightforward theorems about vector spaces, Hilbert spaces and functional analysis. In order to be applicable to experiment and technology, those theorems need interpretation and meaning.…
We consider Clifford algebras over the field of real or complex numbers as a quotient algebra without fixed basis. We present classification of Clifford algebra elements based on the notion of quaternion type. This classification allows us…
We introduce the concept of quotient in PN spaces and give some examples. We prove some theorems with regard to the completeness of a quotient.
We look at equivalence relations on the set of models of a theory -- MERs, for short -- such that the class of equivalent pairs is itself an elementary class, in a language appropriate for pairs of models. We provide many examples of…
We analyze a class of quantum operations based on a geometrical representation of $d-$level quantum system (or qudit for short). A sufficient and necessary condition of complete positivity, expressed in terms of the quantum Fourier…
The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…
We study the Hydrogen atom as a quantum mechanical system with a Coulomb like potential, with a semiclassical approach based on an effective description of quantum mechanics. This treatment allows us to describe the quantum state of the…
Cantor's ordinal numbers, a powerful extension of the natural numbers, are a cornerstone of set theory. They can be used to reason about the termination of processes, prove the consistency of logical systems, and justify some of the core…
We construct 3-dimensional once-Extended Topological Quantum Field Theories (ETQFTs for short) out of (possibly non-semisimple) modular categories, and we explicitly identify linear categories and functors in their image. The circle…
We present the first definition of strictly associative and unital $\infty$-category. Our proposal takes the form of a type theory whose terms describe the operations of such structures, and whose definitional equality relation enforces…
Basic matrices are defined which provide unique building blocks for the class of normal matrices which include the classes of unitary and Hermitian matrices. Unique builders for quantum logic gates are hence derived since a quantum logic…
Interest in combinatorial interpretations of mathematical entities stems from the convenience of the concrete models they provide. Finding a bijective proof of a seemingly obscure identity can reveal unsuspected significance to it. Finding…
A rigorous general definition of quantum probability is given, which is valid for elementary events and for composite events, for operationally testable measurements as well as for inconclusive measurements, and also for non-commuting…
Quantum simulators are devices that actively use quantum effects to answer questions about model systems and, through them, real systems. Here we expand on this definition by answering several fundamental questions about the nature and use…