Related papers: Short Proofs for Some Symmetric Quantified Boolean…
We study the existence of formal power series solutions to q-algebraic equations. When a solution exists, we give a sufficient condition on the equation for this solution to have a positive radius of convergence. We emphasize on the case…
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…
Second-order Boolean logic is a generalization of QBF, whose constant alternation fragments are known to be complete for the levels of the exponential time hierarchy. We consider two types of restriction of this logic: 1) restrictions to…
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolmogorov complexity to query complexity. Our technique…
We define Boolean algebras in the linear context and study its symmetric powers. We give explicit formulae for products in symmetric Boolean algebras of various dimensions. We formulate symmetric forms of the inclusion-exclusion principle.
We give closed formulae for the q-characters of the fundamental representations of the quantum loop algebra of a classical Lie algebra in terms of a family of partitions satisfying some simple properties. We also give the multiplicities of…
We explore ideas for scaling verification methods for quantum circuits using SMT (Satisfiability Modulo Theories) solvers. We propose two primary strategies: (1) decomposing proof obligations via compositional verification and (2)…
Using a property of the q-shifted factorial, an identity for q-binomial coefficients is proved, which is used to derive the formulas for the q-binomial coefficient for negative arguments. The result is in agreement with an earlier paper…
The QRAT (quantified resolution asymmetric tautology) proof system simulates virtually all inference rules applied in state of the art quantified Boolean formula (QBF) reasoning tools. It consists of rules to rewrite a QBF by adding and…
Errors in quantum computers are of two kinds: sudden perturbations to isolated qubits, and slow random drifts of all the qubits. The latter may be reduced, but not eliminated, by means of symmetrization, namely by using many replicas of the…
The solution of equations from the title is well known since the Euler's time. However, its proof in the case of multiple roots of the characteristic polynomial is rather long and technical and even appearance of the factors $x^m$ looks…
The cylindrical algebraic covering method was originally proposed to decide the satisfiability of a set of non-linear real arithmetic constraints. We reformulate and extend the cylindrical algebraic covering method to allow for checking the…
We investigate the size complexity of proofs in $Res(s)$ -- an extension of Resolution working on $s$-DNFs instead of clauses -- for families of contradictions given in the {\em unusual binary} encoding. A motivation of our work is size…
We introduce the entangled quantum polynomial hierarchy $\mathsf{QEPH}$ as the class of problems that are efficiently verifiable given alternating quantum proofs that may be entangled with each other. We prove $\mathsf{QEPH}$ collapses to…
Large language models (LLMs) have demonstrated significant potential in formal theorem proving, yet state-of-the-art performance often necessitates prohibitive test-time compute via massive roll-outs or extended context windows. In this…
Tomography has reached its practical limits in characterization of new quantum devices, and there is a need for a new means of characterizing and validating new technological advances in this field. We propose a different verification…
In this paper we present a quantifier elimination method for conjunctions of linear real arithmetic constraints. Our algorithm is based on the Fourier-Motzkin variable elimination procedure, but by case splitting we are able to reduce the…
The quantum Fourier transform (QFT) is the principal algorithmic tool underlying most efficient quantum algorithms. We present a generic framework for the construction of efficient quantum circuits for the QFT by ``quantizing'' the…
We produce neccessary and sufficient conditions for pairs of quantum minors in the quantized coordinate algebra $\Bbb{C}_q[Mat_{k \times m}]$ to quasi-commute. In addition we study the combinatorics of maximal (by inclusion) families of…
I discuss a variety of issues relating to near-future experiments demonstrating fault-tolerant quantum computation. I describe a family of fault-tolerant quantum circuits that can be performed with 5 qubits arranged on a ring with…