Related papers: De Morgan Dual Nominal Quantifiers Modelling Priva…
Nominal abstract syntax is an approach to representing names and binding pioneered by Gabbay and Pitts. So far nominal techniques have mostly been studied using classical logic or model theory, not type theory. Nominal extensions to simple,…
Variational algorithms are a promising paradigm for utilizing near-term quantum devices for modeling electronic states of molecular systems. However, previous bounds on the measurement time required have suggested that the application of…
We extend the framework for complexity of operators in analysis devised by Kawamura and Cook (2012) to allow for the treatment of a wider class of representations. The main novelty is to endow represented spaces of interest with an…
The univalence axiom expresses the principle of extensionality for dependent type theory. However, if we simply add the univalence axiom to type theory, then we lose the property of canonicity - that every closed term computes to a…
Matrix functions are utilized to rewrite smooth spectral constrained matrix optimization problems as smooth unconstrained problems over the set of symmetric matrices which are then solved via the cubic-regularized Newton method. A…
The transport of charged particles, which can be described by the Maxwell-Ampere Nernst-Planck (MANP) framework, is essential in various applications including ion channels and semiconductors. We propose a decoupled structure-preserving…
We present a sequent-based deductive system for automatically proving entailments in separation logic by using mathematical induction. Our technique, called mutual explicit induction proof, is an instance of Noetherian induction.…
A principled approach to the design of program verification and con- struction tools is applied to separation logic. The control flow is modelled by power series with convolution as separating conjunction. A generic construction lifts…
In this paper, we develop a quantified propositional proof systems that corresponds to logarithmic-space reasoning. We begin by defining a class SigmaCNF(2) of quantified formulas that can be evaluated in log space. Then our new proof…
The problem of reliably certifying the outcome of a computation performed by a quantum device is rapidly gaining relevance. We present two protocols for a classical verifier to verifiably delegate a quantum computation to two…
Given two $n$-element structures, $\mathcal{A}$ and $\mathcal{B}$, which can be distinguished by a sentence of $k$-variable first-order logic ($\mathcal{L}^k$), what is the minimum $f(n)$ such that there is guaranteed to be a sentence $\phi…
We study the local quantization principle (after Sorin Popa~\cite{popa 94} and \cite{popa 95}) of inclusions of tracial von Neumann algebras. Let $(\mathcal{M},\tau)$ be a type ${\rm II}_1$ von Neumann algebra and let $\mathcal{N}\subseteq…
The more important difference between Riemann and pseudo-Riemann manifolds is the metric signature and its theoretical consequences. The practical application for Physics Theories becomes often impossible due to the signature consequences.…
We propose a novel approach for coping with alternating quantification as the main source of nonelementary complexity of deciding WS1S formulae. Our approach is applicable within the state-of-the-art automata-based WS1S decision procedure…
Tweedie's formula is central to measurement-error analysis and empirical Bayes. Under Gaussian noise, the formula identifies the posterior mean directly from the observed-data density, bypassing nonparametric deconvolution. Beyond a few…
Amplification by subsampling is one of the main primitives in machine learning with differential privacy (DP): Training a model on random batches instead of complete datasets results in stronger privacy. This is traditionally formalized via…
This thesis introduces the "method of structural refinement", which serves as a means of transforming the relational semantics of a modal and/or constructive logic into an 'economical' proof system by connecting two proof-theoretic…
We revisit the notion of intuitionistic equivalence and formal proof representations by adopting the view of formulas as exponential polynomials. After observing that most of the invertible proof rules of intuitionistic (minimal)…
We analyze quantum metrological protocols, where the sensing system is linearly coupled to a bosonic environment, by performing a Markovian embedding of the problem based on pseudomode formalism. This allows us to effectively model the…
Toeplitz quantization is defined in a general setting in which the symbols are the elements of a possibly non-commutative algebra with a conjugation and a possibly degenerate inner product. We show that the quantum group $SU_q(2)$ is such…