Related papers: Solving Quantified Boolean Formulas with Few Exist…
The paper is concerned with a problem of coherent (measurement-free) filtering for physically realizable (PR) linear quantum plants. The state variables of such systems satisfy canonical commutation relations and are governed by linear…
Quantized Neural Networks (QNNs), which use low bitwidth numbers for representing parameters and performing computations, have been proposed to reduce the computation complexity, storage size and memory usage. In QNNs, parameters and…
This article presents a closed-form adaptive controlbarrier-function (CBF) approach for satisfying state constraints in systems with parametric uncertainty. This approach uses a sampled-data recursive-least-squares algorithm to estimate the…
A quantum circuit must be preprocessed before implementing on NISQ devices due to the connectivity constraint. Quantum circuit mapping (QCM) transforms the circuit into an equivalent one that is compliant with the NISQ device's architecture…
The standard axiomatization of quantum mechanics (QM) is not fully explicit about the role of the time-parameter. Especially, the time reference within the probability algorithm (the Born Rule, BR) is unclear. Using a plausible principle…
The Quadratic Unconstrained Binary Optimization problem (QUBO) has become a unifying model for representing a wide range of combinatorial optimization problems, and for linking a variety of disciplines that face these problems. A new class…
We present an alternative proof of the NEXP-hardness of the satisfiability of {\em Dependency Quantified Boolean Formulas} (DQBF). Besides being simple, our proof also gives us a general method to reduce NEXP-complete problems to DQBF. We…
In robotics, control barrier function (CBF)-based safety filters are commonly used to enforce state constraints. A critical challenge arises when the relative degree of the CBF varies across the state space. This variability can create…
We study the computational complexity of explaining preference data through Boolean attribute models (BAMs), motivated by extensive research involving attribute models and their promise in understanding preference structure and enabling…
The two-way finite automaton with quantum and classical states (2QCFA), defined by Ambainis and Watrous, is a model of quantum computation whose quantum part is extremely limited; however, as they showed, 2QCFA are surprisingly powerful: a…
This paper is devoted to the complexity of the Boolean satisfiability problem. We consider a version of this problem, where the Boolean formula is specified in the conjunctive normal form. We prove an unexpected result that the…
This note is intended to foster a discussion about the extent to which typical problems arising in quantum information theory are algorithmically decidable (in principle rather than in practice). Various problems in the context of…
Quantum finite automata (QFAs) literature offers an alternative mathematical model for studying quantum systems with finite memory. As a superiority of quantum computing, QFAs have been shown exponentially more succinct on certain problems…
We critique Valerii Sopin's paper "${\rm PH} = {\rm PSPACE}$" [Sop14]. The paper claims to resolve one of the major open problems of theoretical computer science by leveraging the Skolemization of existential quantifiers of quantified…
Control barrier functions (CBFs) offer an efficient framework for designing real-time safe controllers. However, CBF-based controllers can be short-sighted, resulting in poor performance, a behaviour which is aggravated in uncertain…
States in quantum field theory (QFT) are represented by many-particle wave functions, such that a state describing n particles depends on n spacetime positions. Since a general state is a superposition of states with different numbers of…
Quantum computing is seeking to realize hardware-optimized algorithms for application-related computational tasks. NP (nondeterministic-polynomial-time) is a complexity class containing many important but intractable problems like the…
Automatic structures are first-order structures whose universe and relations can be represented as regular languages. It follows from the standard closure properties of regular languages that the first-order theory of an automatic structure…
Today's quantum field theory (QFT) relies heavenly on canonical quantization (CQ), which fails for $\varphi^4_4$ leading only to a "free" result. Affine quantization (AQ), an alternative quantization procedure, leads to a "non-free" result…
We present QUBOLite, a Python package for the creation, manipulation, analysis, and solution of Quadratic Unconstrained Binary Optimization (QUBO) instances. Built as a thin wrapper around NumPy arrays, QUBOLite combines efficient numerical…