Related papers: Moore machines duality
This short note provides and proves an easy algorithm to find a basic feasible solution for the Simplex Algorithm. The method uses a rule similar to Bland's rule for the initial phase of the algorithm.
We consider games played on graphs with the winning conditions for the players specified as weak-parity conditions. In weak-parity conditions the winner of a play is decided by looking into the set of states appearing in the play, rather…
In this article, we study the problem of comparing mixed quantum states: given $n$ unknown mixed quantum states, can one determine whether they are identical or not with an unambiguous quantum measurement? We first study universal…
An iterative algorithm for state determination is presented that uses as physical input the probability distributions for the eigenvalues of two or more observables in an unknown state $\Phi$. Starting form an arbitrary state $\Psi_{0}$, a…
In this note we propose a new algorithm for checking whether two counting functions on a free monoid $M_r$ of rank $r$ are equivalent modulo a bounded function. The previously known algorithm has time complexity $O(n)$ for all ranks $r>2$,…
This work introduces a natural variant of the online machine scheduling problem on unrelated machines, which we refer to as the favorite machine model. In this model, each job has a minimum processing time on a certain set of machines,…
We consider an asynchronous system with transitions corresponding to the instructions of a computer system. For each instruction, a runtime is given. We propose a mathematical model, allowing us to construct an algorithm for finding the…
Exact results for the BPS index are known for a class of BPS dyons in type II string theory compactified on a six dimensional torus. In this paper we set up the problem of counting the same BPS states in a duality frame in which the states…
We consider deterministic and {\em randomized} quantum algorithms simulating $e^{-iHt}$ by a product of unitary operators $e^{-iA_jt_j}$, $j=1,...,N$, where $A_j\in\{H_1,...,H_m\}$, $H=\sum_{i=1}^m H_i$ and $t_j > 0$ for every $j$.…
An efficient quantum algorithm is proposed to solve in polynomial time the parity problem, one of the hardest problems both in conventional quantum computation and in classical computation, on NMR quantum computers. It is based on the…
We propose a new algorithm for approximating the non-asymptotic second moment of the marginal likelihood estimate, or normalizing constant, provided by a particle filter. The computational cost of the new method is $O(M)$ per time step,…
We consider the state-minimisation problem for weighted and probabilistic automata. We provide a numerically stable polynomial-time minimisation algorithm for weighted automata, with guaranteed bounds on the numerical error when run with…
Consider the question: what statistical ensemble corresponds to minimal prior knowledge about a quantum system ? For the case where the system is in fact known to be in a pure state there is an obvious answer, corresponding to the unique…
We introduce a technique that allows one to connect any two arbitrary (pure or mixed) superposition states of an N-state quantum system. The proposed solution to this inverse quantum mechanical problem is analytical, exact, and very…
Given $n$ colored balls, we want to detect if more than $\lfloor n/2\rfloor$ of them have the same color, and if so find one ball with such majority color. We are only allowed to choose two balls and compare their colors, and the goal is to…
Mutual coherence is a measure of similarity between two opinions. Although the notion comes from philosophy, it is essential for a wide range of technologies, e.g., the Wahl-O-Mat system. In Germany, this system helps voters to find…
In this paper, we consider an NP-hard problem of scheduling a set of jobs of equal processing time on two machines, given a partial precedence order on the set of jobs, with an objective to minimize the makespan. An approximation algorithm…
We derive a general lower bound on the minimum-error probability for {\it ambiguous discrimination} between arbitrary $m$ mixed quantum states with given prior probabilities. When $m=2$, this bound is precisely the well-known Helstrom…
The aim of this paper is to propose a strategy to implement the Minimal Model Program in modern computer algebra systems.
This is a short review of Monte Carlo methods for approximating filter distributions in state space models. The basic algorithm and different strategies to reduce imbalance of the weights are discussed. Finally, methods for more difficult…