Related papers: Quantum Logics that are Symmetric-difference-close…

While symmetries are well understood for Boolean formulas and successfully exploited in practical SAT solving, less is known about symmetries in quantified Boolean formulas (QBF). There are some works introducing adaptions of propositional…

Quantum states are represented by positive semidefinite Hermitian operators with unit trace, known as density matrices. An important subset of quantum states is that of separable states, the complement of which is the subset of…

Quantum field theories, at short scales, can be approximated by a scaling limit theory. In this approximation, an additional symmetry is gained, namely dilation covariance. To understand the structure of this dilation symmetry, we…

Quantum error correction and symmetry arise in many areas of physics, including many-body systems, metrology in the presence of noise, fault-tolerant computation, and holographic quantum gravity. Here we study the compatibility of these two…

Uncertainty in Logic Programming has been investigated during the last decades, dealing with various extensions of the classical LP paradigm and different applications. Existing proposals rely on different approaches, such as clause…

We ask whether the operational quantum description is complete at the level of preparations: can the empirically accessible properties of a finite preparation set be reproduced exactly by a hidden-variable description, or must every such…

We introduce several classes of quantum combinatorial designs, namely quantum Latin squares, cubes, hypercubes and a notion of orthogonality between them. A further introduced notion, quantum orthogonal arrays, generalizes all previous…

We establish a connection between measurement-based quantum computation and the field of mathematical logic. We show that the computational power of an important class of quantum states called graph states, representing resources for…

The exponential modalities of linear logic have been used by various authors to model infinite-dimensional quantum systems. This paper explains how these modalities can also give rise to the complementarity principle of quantum mechanics.…

Quantum Separation Logic (QSL) has been proposed as an effective tool to improve the scalability of deductive reasoning for quantum programs. In QSL, separation is interpreted as disentanglement, and the frame rule brings a notion of…

We review some aspects of the relation between ordinary coherent states and q-deformed generalized coherent states with some of the simplest cases of quantum Lie algebras. In particular, new properties of (q-)coherent states are utilized to…

Following the idea of Subexponential Linear Logic and Stratified Bounded Linear Logic, we propose a new parameterized version of Linear Logic which subsumes other systems like ELL, LLL or SLL, by including variants of the exponential rules.…

Representation theory is shown to be incomplete in terms of enumerating all integrable limits of quantum systems. As a consequence, one can find exactly solvable Hamiltonians which have apparently strongly broken symmetry. The number of…

We study quasi-exact quantum error correcting codes and quantum computation with them. A quasi-exact code is an approximate code such that it contains a finite number of scaling parameters, the tuning of which can flow it to corresponding…

We consider N quantum systems initially prepared in pure states and address the problem of unambiguously comparing them. One may ask whether or not all $N$ systems are in the same state. Alternatively, one may ask whether or not the states…

Logic programming under the answer-set semantics nowadays deals with numerous different notions of program equivalence. This is due to the fact that equivalence for substitution (known as strong equivalence) and ordinary equivalence are…

Although the foundations of quantum and classical physics are much different, it is often difficult to pinpoint which features of a particular system are intrinsically "quantum". Perhapse, the most clear-cut distinction between "classical"…

Duality theorems play a fundamental role in convex optimization. Recently, it was shown how duality theorems for countable probability distributions and finite-dimensional quantum states can be leveraged for building relatively complete…

Continuing a previous analysis originally motivated by physics, we consider representable states on quasi-local quasi *-algebras, starting with examining the possibility for a {\em compatible} family of {\em local} states to give rise to a…

Since Renes et al. [J. Math. Phys. 45, 2171 (2004)], there has been much effort in the quantum information community to prove (or disprove) the existence of symmetric informationally complete (SIC) sets of quantum states in arbitrary finite…