A fundamental question in quantum mechanics is, whether it is possible to replicate an arbitrary unknown quantum state. Then famous quantum no-cloning theorem [Nature 299, 802 (1982)] says no to the question. But it leaves open the following question: If the state is not arbitrary, but secretly chosen from a certain set $\$={ | Ψ_1> ,| Ψ_2> ,... ,| Ψ_n> } $, whether is the cloning possible? This question is of great practical significance because of its applications in quantum information theory. If the states $| Ψ_1>, | Ψ_2>,...$ and $| Ψ_n> $ are linearly-dependent, similar to the proof of the no-cloning theorem, the linearity of quantum mechanics forbids such replication. In this paper, we show that, if the states $| Ψ_1>, | Ψ_2>, ...$ and $| Ψ_n> $ are linearly-independent, they do can be cloned by a unitary-reduction process.
From Ref. [Phys. Rev. Lett. 80(1998)4999] one knows that the quantum states secretly chosen from a certain set can be probabilistically cloned with positive cloning efficiencies if and only if all the states in the set are linearly independent. In this paper, we focus on the probabilistic quantum cloning (PQC) of linearly dependent states with nonnegative cloning efficiencies. We show that a linearly independent subset of the linearly dependent quantum states can be probabilistically cloned if and only if any one state in the subset can not be expressed as the linear superposition of the other…
We construct a probabilistic quantum cloning machine by a general unitary-reduction operation. With a postselection of the measurement results, the machine yields faithful copies of the input states. It is shown that the states secretly chosen from a certain set $\$=\left\{\left| Ψ_1\right> ,\left| Ψ_2\right> ,... ,\left| Ψ_n\right> \right\} $ can be probabilistically cloned if and only if $% \left| Ψ_1\right>$, $\left| Ψ_2\right>$, $... ,$ and $\left| Ψ_n\right>$ are linearly-independent. We derive the best possible cloning efficiencies. Probabilistic cloning has close connection with the pro…
We investigate the probabilistic cloning and purification of quantum states. The performance of these probabilistic operations is quantified by the average fidelity between the ideal and actual output states. We provide a simple formula for the maximal achievable average fidelity and we explictly show how to construct a probabilistic operation that achieves this fidelity. We illustrate our method on several examples such as the phase covariant cloning of qubits, cloning of coherent states, and purification of qubits transmitted via depolarizing channel and amplitude damping channel. Our exampl…
The quantum formalism permits one to discriminate sometimes between any set of linearly-independent pure states with certainty. We obtain the maximum probability with which a set of equally-likely, symmetric, linearly-independent states can be discriminated. The form of this bound is examined for symmetric coherent states of a harmonic oscillator or field mode.
We propose an optimal discrimination scheme for a case of four linearly independent nonorthogonal symmetric quantum states, based on linear optics only. The probability of discrimination is in agreement with the optimal probability for unambiguous discrimination among N symmetric states [Phys. Lett. A \textbf{250}, 223 (1998)]. The experimental setup can be extended for the case of discrimination among $2^M$ nonorthogonal symmetric quantum states.
We consider the problem of designing a measurement to minimize the probability of a detection error when distinguishing between a collection of possibly non-orthogonal mixed quantum states. We show that if the quantum state ensemble consists of linearly independent density operators then the optimal measurement is an orthogonal Von Neumann measurement consisting of mutually orthogonal projection operators and not a more general positive operator-valued measure.
The theory of generalised measurements is used to examine the problem of discriminating unambiguously between non-orthogonal pure quantum states. Measurements of this type never give erroneous results, although, in general, there will be a non-zero probability of a result being inconclusive. It is shown that only linearly-independent states can be unambiguously discriminated. In addition to examining the general properties of such measurements, we discuss their application to entanglement concentration.
It is well known that (non-orthogonal) pure states cannot be cloned so one may ask: how much or what kind of additional (quantum) information is needed to supplement one copy of a quantum state in order to be able to produce two copies of that state by a physical operation? For classical information, no supplementary information is required. However for pure quantum (non-orthogonal) states, we show that the supplementary information must always be as large as it can possibly be i.e. the clone must be able to be generated from the additional information alone, independently of the first (given)…
We consider the problem of unambiguous (error-free) discrimination of N linearly independent pure quantum states with prior probabilities, where the goal is to find a measurement that maximizes the average probability of success. We derive an upper bound on the optimal average probability of success using a result on optimal local conversion between two bipartite pure states. We prove that an optimal measurement in general saturates our bound. In the exceptional cases we show that the bound is tight, but not always optimal.
A set of quantum states can be unambiguously discriminated if and only if they are linearly independent. However, for a linearly dependent set, if C copies of the state are available, then the resulting C particle states may form a linearly independent set, and be amenable to unambiguous discrimination. We obtain necessary and sufficient conditions for the possibility of unambiguous discrimination between N states given that C copies are available and that the single copies span a D dimensional space. These conditions are found to be identical for qubits. We then examine in detail the linearly…
The optimization conditions for minimum error discrimination of linearly independent pure states comprise of two kinds: stationary conditions over the space of rank one projective measurements and the global maximization conditions. A discrete number of projective measurments will solve th former of which a unique one will solve the latter. In the case of three real linearly independent pure states we show that the stationary conditions translate to a system of simultaneous polynomial (non linear) equations in three variabes thus explaining why it's so difficult to obtain a closed-form solutio…
We find an optimal quantum cloning machine, which clones qubits of arbitrary symmetrical distribution around the Bloch vector with the highest fidelity. The process is referred to as phase-independent cloning in contrast to the standard phase-covariant cloning for which an input qubit state is a priori better known. We assume that the information about the input state is encoded in an arbitrary axisymmetric distribution (phase function) on the Bloch sphere of the cloned qubits. We find analytical expressions describing the optimal cloning transformation and fidelity of the clones. As an illust…
In this paper we study the Minimum Error Discrimination problem (MED) for ensembles of linearly independent (LI) states. We define a bijective map from the set of those ensembles to itself and we show that the Pretty Good Measurement (PGM) and the optimal measurement for the MED are related by the map. In particular, the fixed points of the map are those ensembles for which the PGM is the optimal measurement. Also, we simplify the optimality conditions for the measurement of an ensemble of LI states.
Given $n$ linearly independent pure states and their prior probabilities, we study the problem of optimum unambiguous discrimination of these states. We derive the properties of the optimum solution and the equations that must be satisfied by the optimum measurement strategy which achieves the maximum average success probability, and also give the detailed steps to obtain the optimum solution and the optimum measurement strategy. The general method and results we obtain are also illustrated both numerically and geometrically. We derive a simple analytical formula of the maximum average success…
We put the pure-state decomposition mathematical property of a mixed state to a physical test. We begin by characterizing all the possible decompositions of a rank-two mixed state by means of the complex overlap between two involved states. The physical test proposes a scheme of quantum state recognition of one of the two linearly independent states which arise from the decomposition. We find that the two states associated with the balanced pure-state decomposition have the smaller overlap modulus and therefore the smallest probability of being discriminated conclusively, while in the nonconcl…
Due to the no-cloning theorem, the unknown quantum state can only be cloned approximately or exactly with some probability. There are two types of cloners: universal and state-dependent cloner. The optimal universal cloner has been found and could be viewed as a special state-dependent quantum cloner which has no information about the states. In this paper, we investigate the state-dependent cloning when the state-set contains more than two states. We get some bounds of the global fidelity for these processes. This method is not dependent on the number of the states contained in the state-set.…
The problem of unambiguously distinguishing among nonorthogonal but linearly independent quantum states can be solved by mapping the set of nonorthogonal quantum states onto a set of orthogonal ones, which can then be distinguished without error. Such nonunitary transformations can be performed conditionally on quantum systems; a unitary transformation is carried out on a larger system of which the system of interest is a subsytem, a measurement is performed, and if the proper result is obtained, the desired nonunitary transformation will have been performed on the subsystem. We show how to co…
Inspired by the work done by Belavkin [Belavkin V. P., Stochastics, 1, 315 (1975)], and independently by Mochon, [Phys. Rev. A 73, 032328, (2006)], we formulate the problem of minimum error discrimination of any ensemble of $n$ linearly independent pure states by stripping the problem of its rotational covariance and retaining only the rotationally invariant aspect of the problem. This is done by embedding the optimal conditions in a matrix equality as well as matrix inequality. Employing the implicit function theorem in these conditions we get a set of first-order coupled ordinary non-linear …
Multi-mode entangled coherent states are important resources for linear optics quantum computation and teleportation. Here we introduce the generalized balanced N-mode coherent states which recast in the multi-qudit case. The necessary and sufficient condition for bi-separability of such balanced N-mode coherent states is found. We particularly focus on pure and mixed multi-qubit and multi-qutrit like states and examine the degree of bipartite as well as tripartite entanglement using the concurrence measure. Unlike the N-qubit case, it is shown that there are qutrit states violating monogamy i…
The minimum error discrimination problem for ensembles of linearly independent pure states are known to have an interesting structure; for such a given ensemble the optimal POVM is given by the pretty good measurment of another ensemble which can be related to the former ensemble by a bijective mapping $\mathscr{R}$ on the "space of ensembles". In this paper we generalize this result to ensembles of general linearly independent states (not necessarily pure) and also give an analytic expression for the inverse of the map, i.e., for $\mathscr{R}^{-1}$. In the process of proving this we also simp…
In this paper, we find the necessary and sufficient condition for the maximal entanglement of the state, $ |ψ>=μ|α>|β>+λ|α>|δ>+ ρ|γ>|β>+ν|γ>|δ>,$ constructed by linearly independent coherent states with \emph{real parameters} when $<α|γ>=<β|δ>$. This is a further generalization of the classified nonorthogonal states discussed in Ref. Physics Letters A {\bf{291}}, 73-76 (2001).
We derive a necessary condition for the existence of a completely-positive, linear, trace-preserving map which deterministically transforms one finite set of pure quantum states into another. This condition is also sufficient for linearly-independent initial states. We also examine the issue of quantum coherence, that is, when such operations maintain the purity of superpositions. If, in any deterministic transformation from one linearly-independent set to another, even a single, complete superposition of the initial states maintains its purity, the initial and final states are related by a un…
Einstein-Podolsky-Rosen (EPR) steering allows two parties to verify their entanglement, even if one party's measurements are untrusted. This concept has not only provided new insights into the nature of non-local spatial correlations in quantum mechanics, but also serves as a resource for one-sided device-independent quantum information tasks. Here, we investigate how EPR steering behaves when one-half of a maximally-entangled pair of qudits (multidimensional quantum systems) is cloned by a universal cloning machine. We find that EPR steering, as verified by a criterion based on the mutual inf…
Schroedinger's disentanglement [E. Schroedinger, Proc. Cambridge Phil. Soc. 31, 555 (1935)], i. e., remote state decomposition, as a physical way to study entanglement, is carried one step further with respect to previous work in investigating the qualitative side of entanglement in any bipartite state vector. Remote measurement (or, equivalently, remote orthogonal state decomposition) from previous work is generalized to remote linearly-independent complete state decomposition both in the non-selective and the selective versions. The results are displayed in terms of commutative square diagra…
We study the storage capacity of quantum neural networks (QNNs) described as completely positive trace preserving (CPTP) maps, which act on an $N$-dimensional Hilbert space. We demonstrate that QNNs can store up to $N$ linearly independent pure states and provide the structure of the corresponding maps. While the storage capacity of a classical Hopfield network scales linearly with the number of neurons, we show that QNNs can store an exponential number of linearly independent states. We estimate, employing the Gardner program, the relative volume of CPTP maps with $M$ stationary states. The v…
We investigate quantum information masking for arbitrary dimensional quantum states. We show that mutually orthogonal quantum states can always be served for deterministic masking of quantum information. We further construct a probabilistic masking machine for linearly independent states. It is shown that a set of d dimensional states, $\{ |a_1 \rangle_A, |t a_2 \rangle_A, \dots, |a_n \rangle_A \}$, $n \leq d$, can be probabilistically masked by a general unitary-reduction operation if they are linearly independent. The maximal successful probability of probabilistic masking is analyzed and de…
We consider the problem of discriminating between states of a specified set with maximum confidence. For a set of linearly independent states unambiguous discrimination is possible if we allow for the possibility of an inconclusive result. For linearly dependent sets an analogous measurement is one which allows us to be as confident as possible that when a given state is identified on the basis of the measurement result, it is indeed the correct state.
Unambiguously distinguishing between nonorthogonal but linearly independent quantum states is a challenging problem in quantum information processing. In this work, an exact analytic solution to an optimum measurement problem involving an arbitrary number of pure linearly independent quantum states is presented. To this end, the relevant semi-definite programming task is reduced to a linear programming one with a feasible region of polygon type which can be solved via simplex method. The strength of the method is illustrated through some explicit examples. Also using the close connection betwe…
Practical schemes for measurement-device-independent quantum key distribution using phase and path or time encoding are presented. In addition to immunity to existing loopholes in detection systems, our setup employs simple encoding and decoding modules without relying on polarization maintenance or optical switches. Moreover, by employing a modified sifting technique to handle the dead-time limitations in single-photon detectors, our scheme can be run with only two single-photon detectors. With a phase-postselection technique, a decoy-state variant of our scheme is also proposed, whose key ge…
It is known that unambiguous discrimination among non-orthogonal but linearly independent quantum states is possible with a certain probability of success. Here, we consider a variant of that problem. Instead of discriminating among all of the different states, we shall only discriminate between two subsets of them. In particular, for the case of three non-orthogonal states, we show that the optimal strategy to distinguish between a set containing one of the states from the set containing the other two has a higher success rate than if we wish to discriminate among all three states. Somewhat s…
In this paper, we present a variational treatment of the linear dependence for a non-orthogonal time-dependent basis set in solving the Schrödinger equation. The method is based on: i) the definition of a linearly independent working space, and ii) a variational construction of the propagator over finite time-steps. The second point allows the method to properly account for changes in the dimensionality of the working space along the time evolution. In particular, the time evolution is represented by a semi-unitary transformation. Tests are done on a quartic double-well potential with Gaussian…
In the present paper, an exact analytic solution for the optimal unambiguous state discrimination (OPUSD) problem involving an arbitrary number of pure linearly independent quantum states with real and complex inner product is presented. Using semidefinite programming and Karush-Kuhn-Tucker convex optimization method, we derive an analytical formula which shows the relation between optimal solution of unambiguous state discrimination problem and an arbitrary number of pure linearly independent quantum states.
