Related papers: Moore machines duality
For a system randomly prepared in a number of quantum states, we present a lower bound for the distinguishability of the quantum states, that is, the success probability of determining the states in the form of entropy. When the states are…
Weak measurements are a unique tool for accessing information about weakly interacting quantum systems with minimal back action. Joint weak measurements of single-particle operators with pointer states characterized by a two-dimensional…
We characterize the multipartite entanglement of a system of n qubits in terms of the distribution function of the bipartite purity over all balanced bipartitions. We search for those (maximally multipartite entangled) states whose purity…
The EM algorithm is a special case of a more general algorithm called the MM algorithm. Specific MM algorithms often have nothing to do with missing data. The first M step of an MM algorithm creates a surrogate function that is optimized in…
Using the necessary and sufficient conditions, minimum error discrimination among two sets of similarity transformed equiprobable quantum qudit states is investigated. In the case that the unitary operators are generating sets of two…
We provide an efficient method for computing the maximum likelihood mixed quantum state (with density matrix $\rho$) given a set of measurement outcome in a complete orthonormal operator basis subject to Gaussian noise. Our method works by…
We give the mathematical theory of duality computer in the density matrix formalism. This result complements the mathematical theory of duality computer of Gudder in the pure state formalism.
In this paper, we prove that the Max-Morse Matching Problem is approximable, thus resolving an open problem posed by Joswig and Pfetsch. We describe two different approximation algorithms for the Max-Morse Matching Problem. For…
We derive necessary and sufficient conditions for the LU-equivalence of two general (pure or mixed) $n$-qubit states as well as we determine the local unitary operators connecting them. Almost all relevant information is contained in the…
Error probability is a popular and well-studied optimization criterion in discriminating non-orthogonal quantum states. It captures the threat from an adversary who can only query the actual state once. However, when the adversary is able…
How can we use a quantum computer to detect the entanglement structure of a quantum state? Bouland et al. (2024) recently provided an algorithm that, given multiple input copies of the state, finds the "hidden cuts"-partitions into fully…
A representation of an arbitrary system of strict linear inequalities in R^n as a system of points is proposed. The representation is obtained by using a so-called polarity. Based on this representation an algorithm for constructing a…
We consider a protocol to perform the optimal quantum state discrimination of $N$ linearly independent non-orthogonal pure quantum states and present a computational code. Through the extension of the original Hilbert space, it is possible…
A new algorithm for estimating the fraction of numbers that is present in a superpositional state which satisfies a given condition,is introduced.This algorithm is conceptually simple and does not require quantum Fourier transform.Also the…
In this paper, we consider the online version of the machine minimization problem (introduced by Chuzhoy et al., FOCS 2004), where the goal is to schedule a set of jobs with release times, deadlines, and processing lengths on a minimum…
We present an algorithm based on continuation techniques that can be applied to solve numerically minimization problems with equality constraints. We focus on problems with a great number of local minima which are hard to obtain by local…
The task of reception of a copy of an arbitrary quantum state with use of a minimum quantity of quantum operations is considered.
It has been recently shown that an observable that identifies all pure states of a d-dimensional quantum system has minimally 4d-4 outcomes or slightly less (the exact number depending on the dimension d). However, no simple construction of…
A state discrimination problem in an operational probabilistic theory (OPT) is investigated in diagrammatic terms. It is well-known that, in the case of quantum theory, if a state set has a certain symmetry, then there exists a…
We solve a problem, which while not fitting into the usual paradigm, can be viewed as a quantum computation. Suppose we are given a quantum system described by an N dimensional Hilbert space with a Hamiltonian of the form $E |w >< w|$ where…