Related papers: Two linearities for quantum computing in the lambd…
Since the very beginning of the theory of linear logic it is known how to represent the $\lambda$-calculus as linear logic proof nets. The two systems however have different granularities, in particular proof nets have an explicit notion of…
Clarifying the nature of the quantum state $|\Psi\rangle$ is at the root of the problems with insight into counter-intuitive quantum postulates. We provide a direct-and math-axiom free-empirical derivation of this object as an element of a…
A new model of quantum computing has recently been proposed which, in analogy with a classical lambda-calculus, exploits quantum processes which operate on other quantum processes. One such quantum meta-operator takes N unitary…
Quantum computers may achieve speedups over their classical counterparts for solving linear algebra problems. However, in some cases -- such as for low-rank matrices -- dequantized algorithms demonstrate that there cannot be an exponential…
In the foundational logical framework of homotopy-type theory we discuss a natural formalization of secondary integral transforms in stable geometric homotopy theory. We observe that this yields a process of non-perturbative cohomological…
The universality of a quantum neural network refers to its ability to approximate arbitrary functions and is a theoretical guarantee for its effectiveness. A non-universal neural network could fail in completing the machine learning task.…
A method is proposed for defining an arbitrary number of differential calculi over a given noncommutative associative algebra. As an example the generalized quantum plane is studied. It is found that there is a strong correlation, but not a…
Superdeduction is a method specially designed to ease the use of first-order theories in predicate logic. The theory is used to enrich the deduction system with new deduction rules in a systematic, correct and complete way. A proof-term…
Not all unitary operations upon a set of qubits can be implemented by sequential interactions between each qubit and an ancillary system. We analyze the specific case of sequential quantum cloning 1->M and prove that the minimal dimension D…
This paper consists of two (still only vaguely) related parts: in the first, we briefly review work done in the past three years on the ``planar equivalence" between a class of non-supersymmetric theories (including limiting cases of QCD)…
We introduce several probabilistic quantum algorithms that overcome the normal unitary restrictions in quantum machine learning by leveraging the Linear Combination of Unitaries (LCU) method. Among our investigations are quantum native…
In this paper, we investigate an example of summation of non-logarithmic singularities of a specific type in a two-dimensional non-linear sigma model. As a result of the study, we obtained an explicit formula, which, upon formal expansion…
We show that the lambda-q calculus can efficiently simulate quantum Turing machines by showing how the lambda-q calculus can efficiently simulate a class of quantum cellular automaton that are equivalent to quantum Turing machines. We…
It is investigated how two (standard or generalized) $\lambda-$symmetries of a given second-order ordinary differential equation can be used to solve the equation by quadratures. The method is based on the construction of two commuting…
Recent developments in the categorical foundations of universal algebra have given fresh impetus to an understanding of the lambda calculus coming from categorical logic: an interpretation is a semi-closed algebraic theory. Scott's…
Linear/non-linear (LNL) models, as described by Benton, soundly model a LNL term calculus and LNL logic closely related to intuitionistic linear logic. Every such model induces a canonical enrichment that we show soundly models a LNL lambda…
We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be derived from the underlying untyped equations. As a consequence, the…
Linear algebra is usually defined over a field such as the reals or complex numbers. It is possible to extend this to skew fields such as the quaternions. However, to the authors' knowledge there is no commonly accepted notation of linear…
We introduce a quantum analogue of classical first-order logic (FO) and develop a theory of quantum first-order logic as a basis of the productive discussions on the power of logical expressiveness toward quantum computing. The purpose of…
We take quantum theory and replace $\mathbb{C}$ by $\mathbb{C}[\varepsilon]$ where $\varepsilon^2=0$, i.e. we extend quantum theory to the ring of dual complex numbers. The aim is to develop a common language in which to treat continuous…