Related papers: Moore machines duality
Given a convex optimization problem and its dual, there are many possible first-order algorithms. In this paper, we show the equivalence between mirror descent algorithms and algorithms generalizing the conditional gradient method. This is…
We propose the use of a quantum algorithm to deal with the problem of searching with errors in the framework of two-person games. Specifically, we present a solution to the Ulam's problem that polynomially reduces its query complexity and…
A method for locating first order saddle points on the energy surface of a magnetic system is described and several applications presented where the mechanism of various magnetic transitions is identified. The starting point for the…
We present the optimal measurement strategy for distinguishing between three quantum states exhibiting a mirror symmetry. The three states live in a two-dimensional Hilbert space, and are thus overcomplete. By mirror symmetry we understand…
A quantum algorithm is a set of instructions for a quantum computer, however, unlike algorithms in classical computer science their results cannot be guaranteed. A quantum system can undergo two types of operation, measurement and quantum…
Nuclear magnetic resonance techniques are used to realize a quantum algorithm experimentally. The algorithm allows a simple NMR quantum computer to determine global properties of an unknown function requiring fewer function ``calls'' than…
The Kolmogorov complexity of a physical state is the minimal physical resources required to reproduce that state. We define a second quantized quantum Turing machine and use it to define second quantized Kolmogorov complexity. There are two…
In this paper, we give out some effective criterions which can be used to judge the separability of multipartite pure states. We obtain the relationship between separability and Schmidt decomposable of multipartite pure states in Theorem1.…
The paper addresses the model reduction problem by least squares moment matching for continuous-time, linear, time-invariant systems. The basic idea behind least squares moment matching is to approximate a transfer function by ensuring that…
It is presented a simple algorithm for power network state estimation and correction (fault detection) employing standard methodology.
We examine the possible states of subsystems of a system of bits or qubits. In the classical case (bits), this means the possible marginal distributions of a probability distribution on a finite number of binary variables; we give necessary…
This note contains a short and simple proof of Wormald's differential equation method (that yields slightly improved approximation guarantees and error probabilities). This powerful method uses differential equations to approximate the…
We give sufficient conditions on a matrix A ensuring the existence of a partition of this matrix into two submatrices with extremely small norm of the image of any vector. Under some weak conditions on a matrix A we obtain a partition of A…
Under some mild assumptions, we study the state complexity of the trim minimal automaton accepting the greedy representations of the multiples of m >= 2 for a wide class of linear numeration systems. As an example, the number of states of…
We address a problem of identifying a given pure state with one of two reference pure states, when no classical knowledge on the reference states is given, but a certain number of copies of them are available. We assume the input state is…
We present an inequality for detecting entanglement and distillability of arbitrary dimensional bipartite systems. This inequality provides a sufficient condition of entanglement for bipartite mixed states, and a necessary and sufficient…
We present, and analyze thoroughly, a highly symmetric and efficient scheme for the determination of a single-qubit state, such as the polarization properties of photons emitted by a single-photon source. In our scheme there are only four…
We present a new approach to the analysis of entanglement in smooth bipartite continuous-variable states. One or both parties perform projective filterings via preliminary measurements to determine whether the system is located in some…
We define a new criterion for selecting a specific minimal entanglement purification of given mixed states in generic quantum states using the entanglement of purification. We then propose that its holographic dual is the state living on…
We consider a state discrimination problem which deals with settings of minimum-error and unambiguous discrimination systematically by introducing a margin for the probability of an incorrect guess. We analyze discrimination of three…