Related papers: Formal Verification using Second-Quantized Horn Cl…
Many applications of denotational semantics, such as higher-order model checking or the complexity of normalization, rely on finite semantics for monomorphic type systems. We exhibit such a finite semantics for a polymorphic purely linear…
Hamiltonian Mechanics works for conserved systems and Quantum Mechanics is given in Hamiltonian language. It is considered that complexifying the quantum Hamiltonian, a balanced loss and gain model can be created. The usual mathematics of…
These are the notes written for the talk given at the workshop Rethinking foundations of physics 2016. In section 2, a derivation of the the quantum formalism starting from propositional calculus (quantum logic) is reviewed, pointing out…
Standard quantum mechanics predicts the non-conservation of state norms and probability when the fundamental requirement of the Hermiticity of the Hamiltonian is relaxed. Biorthogonal quantum mechanics, or the more general metric formalism,…
Since Shor's discovery of an algorithm to factor numbers on a quantum computer in polynomial time, quantum computation has become a subject of immense interest. Unfortunately, one of the key features of quantum computers - the difficulty of…
Many Program Verification and Synthesis problems of interest can be modeled directly using Horn clauses and many recent advances in the CLP and CAV communities have centered around efficiently solving problems presented as Horn clauses. The…
We introduce a framework for simulating quantum optics by decomposing the system into a finite rank (number of terms) superposition of coherent states. This allows us to define a resource theory, where linear optical operations are 'free'…
Since Edmund Husserl coined the term "Formal Ontologies" in the early 20th century, a field that identifies itself with this particular branch of sciences has gained increasing attention. Many authors, and even Husserl himself have…
Starting from a simple classical framework and employing some stochastic concepts, the basic ingredients of the quantum formalism are recovered. It has been shown that the traditional axiomatic structure of quantum mechanics can be rebuilt,…
We present a fluctuating $N$ formalism, based on second-quantization, to describe large $N$ vector models from field theory using Hamiltonian methods. We first present the method in the simpler setting of a quantum mechanical system with…
A different approach towards quantum theory is proposed in this paper. The basis is taken to be conceptual variables, physical variables that may be accessible or inaccessible, i.e., it may be possible or impossible to assign numerical…
Despite the seminal connection between classical multiply-periodic motion and Heisenberg matrix mechanics and the massive amount of work done on the associated problem of semiclassical (EBK) quantization of bound states, we show that there…
If a code base is so big and complicated that complete mechanical verification is intractable, can we still apply and benefit from verification methods? We show that by allowing a deliberate mechanized formalization gap we can shrink and…
The quantum mechanical formalism doesn't support our intuition, nor does it elucidate the key concepts that govern the behaviour of the entities that are subject to the laws of quantum physics. The arrays of complex numbers are kin to the…
We discuss quantum non-locality and contextuality using the notion of transition sets. This approach provides a way to obtain a direct logical contradiction with locality/non-contextuality in the EPRB gedanken experiment as well as a clear…
We introduce a novel, logic-independent framework for the study of sequent-style proof systems, which covers a number of proof-theoretic formalisms and concrete proof systems that appear in the literature. In particular, we introduce a…
Standard quantum mechanics employs complex Hilbert spaces, but whether complex numbers are fundamental or merely convenient has long been debated. For decades, real-valued equivalents were considered mathematically possible but cumbersome.…
In this paper a generalization of Weyl quantization which maps a dynamical operator in a function space to a dynamical superoperator in an operator space is suggested. Quantization of dynamical operator, which cannot be represented as…
In quantum information and computation research, symbolic methods have been widely used for human specification and reasoning about quantum states and operations. At the same time, they are essential for ensuring the scalability and…
Recently there has been much interest in deriving the quantum formalism and the set of quantum correlations from simple axioms. In this paper, we provide a step-by-step derivation of the quantum formalism that tackles both these problems…