To implement any quantum operation (a.k.a. ``superoperator'' or ``CP map'') on a d-dimensional quantum system, it is enough to apply a suitable overall unitary transformation to the system and a d^2-dimensional environment which is initialized in a fixed pure state. It has been suggested that a d-dimensional environment might be enough if we could initialize the environment in a mixed state of our choosing. In this note we show with elementary means that certain explicit quantum operations cannot be realized in this way. Our counterexamples map some pure states to pure states, giving strong and easily manageable conditions on the overall unitary transformation. Everything works in the more general setting of quantum operations from d-dimensional to d'-dimensional spaces, so we place our counterexamples within this more general framework.
We show that, given a general mixed state for a quantum system, there are no physical means for {\it broadcasting\/} that state onto two separate quantum systems, even when the state need only be reproduced marginally on the separate systems. This result generalizes and extends the standard no-cloning theorem for pure states.
We show that there does not exist any universal quantum cloning machine that can broadcast an arbitrary mixed qubit with a constant fidelity. Based on this result, we investigate the dependent quantum cloner in the sense that some parameter of the input qubit $ρ_s(θ,ω,λ)$ is regarded as constant in the fidelity. For the case of constant $ω$, we establish the $1\to2$ optimal symmetric dependent cloner with a fidelity 1/2. It is also shown that the $1\to M$ optimal quantum cloning machine for pure qubits is also optimal for mixed qubits, when $λ$ is the unique parameter in the fidelity. For gene…
Local operations on subsystems and classical communication between parties (LOCC) constitute the most general protocols available on spatially separated quantum systems. Every LOCC protocol implements a separable generalized measurement -- a complete measurement for which every outcome corresponds to a tensor product of operators on individual subsystems -- but it is known that there exist separable measurements that cannot be implemented by LOCC. A longstanding problem in quantum information theory is to understand the difference between LOCC and the full set of separable measurements. In thi…
The bipartite quantum teleportation with a three-qubit mixture of GHZ and W states as a quantum channel is discussed. When the quantum channel is a mixed state consisting of the GHZ state plus small perturbed W state, the entanglement of the channel becomes zero when the average fidelity $\bar{F}_{GHZ}$ is less than 0.775. This means that the mixed state cannot play an any role as a quantum channel at $\bar{F}_{GHZ} \leq 0.775$. For the case of the mixed state consisting of the W state plus small perturbed GHZ state it turn out that this mixed state cannot play a role as a quantum channel at $…
Linden, Massar and Popescu have recently given an optimization argument to show that a single two-qubit Werner state, or any other mixture of the maximally entangled Bell states, cannot be purified by local operations and classical communications. We generalise their result and give a simple explanation. In particular, we show that no purification scheme using local operations and classical communications can produce a pure singlet from any mixed state of two spin-1/2 particles. More generally, no such scheme can produce a maximally entangled state of any pair of finite-dimensional systems fro…
Using a recently introduced framework, we derive criteria for quantum k-separability, which are very easily computed. In the case k = 2, our criteria are equally strong to the best methods known so far, while in all other cases there are currently no comparable criteria known. We also show how the criteria can be implemented experimentally.
Orthogonal pure states can be cloned as well as deleted. However if there is an initial disorder in the system, that is for orthogonal mixed states, one cannot perform deletion. And cloning, in such cases, necessarily produces an irreversibility, in the form of leakage of information into the environment.
We present one-shot compression protocols that optimally encode ensembles of $N$ identically prepared mixed states into $O(\log N)$ qubits. In contrast to the case of pure-state ensembles, we find that the number of encoding qubits drops down discontinuously as soon as a nonzero error is tolerated and the spectrum of the states is known with sufficient precision. For qubit ensembles, this feature leads to a 25% saving of memory space. Our compression protocols can be implemented efficiently on a quantum computer.
We study the physical resources required to implement general quantum operations, and provide new bounds on the minimum possible size which an environment must be in order to perform certain quantum operations. We prove that contrary to a previous conjecture, not all quantum operations on a single-qubit can be implemented with a single-qubit environment, even if that environment is initially prepared in a mixed state. We show that a mixed single-qutrit environment is sufficient to implement a special class of operations, the generalized depolarizing channels.
It is well known that different preparations of a mixed state cannot be distinguished by a measurement of that state. Yet we show that some other experiments let us make this distinction despite a very general belief that this would not be possible. Issues in quantum cryptography that prompted this work are only briefly mentioned in this letter.
We prove that all purifications of a non-factorable state (i.e., the state which cannot be expressed in a form $ρ_{AB}=ρ_A\otimesρ_B$) are entangled. We also show that for any bipartite state there exists a pair of measurements which are correlated on this state if and only if the state is non-factorable.
We analyze the effects of quantum correlations, such as entanglement and discord, on the efficiency of phase estimation by studying four quantum circuits that can be readily implemented using NMR techniques. These circuits define a standard strategy of repeated single-qubit measurements, a classical strategy where only classical correlations are allowed, and two quantum strategies where nonclassical correlations are allowed. In addition to counting space (number of qubits) and time (number of gates) requirements, we introduce mixedness as a key constraint of the experiment. We compare the effi…
We extend the family of problems that may be implemented on an adiabatic quantum optimizer (AQO). When a quadratic optimization problem has at least one set of discrete controls and the constraints are linear, we call this a quadratic constrained mixed discrete optimization (QCMDO) problem. QCMDO problems are NP-hard, and no efficient classical algorithm for their solution is known. Included in the class of QCMDO problems are combinatorial optimization problems constrained by a linear partial differential equation (PDE) or system of linear PDEs. An essential complication commonly encountered i…
We analyze the class of single qubit channels with the environment modeled by a one-qubit mixed state. The set of affine transformations for this class of channels is computed analytically, employing the canonical form for the two-qubit unitary operator. We demonstrate that, 3/8 of the generalized depolarizing channels can be simulated by the one-qubit mixed state environment by explicitly obtaining the shape of the volume occupied by this class of channels within the tetrahedron representing the generalized depolarizing channels. Further, as a special case, we show that the two-Pauli Channel …
Most quantum error correcting codes are predicated on the assumption that there exists a reservoir of qubits in the state $\ket{0}$, which can be used as ancilla qubits to prepare multi-qubit logical states. In this report, we examine the consequences of relaxing this assumption, and propose a method to increase the fidelity produced by a given code when the ancilla qubits are initialized in mixed states, using the same number of qubits, at most doubling the number of gates. The procedure implemented consists of altering the encoding operator to include the inverse of the unitary operation use…
We investigate classification and detection of entanglement of multipartite quantum states in a very general setting, and obtain efficient $k$-separability criteria for mixed multipartite states in arbitrary dimensional quantum systems. These criteria can be used to distinguish $n-1$ different classes of multipartite inseparable states and can detect many important multipartite entangled states such as GHZ states, W states, anti W states, and mixtures thereof. They detect $k$-nonseparable $n$-partite quantum states which have previously not been identified. Here $k=2,3,\cdots,n$. No optimizati…
We consider Grover's search algorithm on a model quantum computer implemented on a chain of four or five nuclear spins with first and second neighbour Ising interactions. Noise is introduced into the system in terms of random fluctuations of the external fields. By averaging over many repetitions of the algorithm, the output state becomes effectively a mixed state. We study its overlap with the nominal output state of the algorithm, which is called fidelity. We find either an exponential or a Gaussian decay for the fidelity as a function of the strength of the noise, depending on the type of n…
We investigate multipartite entanglement for composite quantum systems in a pure state. Using the generalized Bloch representation for n-qubit states, we express the condition that all k-qubit reductions of the whole system are maximally mixed, reflecting maximum bipartite entanglement across all k vs. n-k bipartitions. As a special case, we examine the class of balanced pure states, which are constructed from a subset of the Pauli group P_n that is isomorphic to Z_2^n. This makes a connection with the theory of quantum error-correcting codes and provides bounds on the largest allowed k for fi…
Purifying noisy entanglement is a protocol which can increase the entanglement of a mixed state (as a source)at expense of the entanglement of others(as an ancilla)by collective measurement. A protocol with which one can get a pure entangled state from a mixed state is defined as purifying mixed states. We address a basic question: can one get a pure entangled state from a mixed state? We give a necessary and sufficient condition of purifying a mixed state by fit local operations and classical communication and show that for a class of source states and ancilla states in arbitrary bipartite sy…
Quantum coherence is a key element in topical research on quantum resource theories and a primary facilitator for design and implementation of quantum technologies. However, the resourcefulness of quantum coherence is severely restricted by environmental noise, which is indicated by the loss of information in a quantum system, measured in terms of its purity. In this work, we derive the limits imposed by the mixedness of a quantum system on the amount of quantum coherence that it can possess. We obtain an analytical trade-off between the two quantities that upperbound the maximum quantum coher…
The Grover quantum search algorithm is generalized to deal with an arbitrary mixed initial state. The probability to measure a marked state as a function of time is calculated, and found to depend strongly on the specific initial state. The form of the function, though, remains as it is in the case of initial pure state. We study the role of the von Neumann entropy of the initial state, and show that the entropy cannot be a measure for the usefulness of the algorithm. We give few examples and show that for some extremely mixed initial states carrying high entropy, the generalized Grover algori…
Quantum secret sharing is one of the most important and interesting quantum information processing task. In quantum secret sharing, information is split among several parties such that only one of them is able to recover the qubit exactly provided all the other parties agree to cooperate. To achieve this task, all the parties need to share entangled state. As far as my knowledge, all the previous quantum secret sharing protocol used either pure tripartite or pure bipartite entangled state. In this work we use for the first time bipartite two qubit mixed state (formed due to noisy environment) …
The mixed states are important in quantum optics since they frequently appear in the decoherence problems. When one of the components of the system is prepared in the mixed state and the evolution operator of this system is not available, one cannot deduce the density matrix. We present analytical approach to accurately solve this problem. The approach can be applied on the condition that the Schrödinger's equation of the system is solvable with any arbitrary initial state. In deriving the solution we exploit the fact that any mixed state can be expressed in terms of a phase state. The approac…
In this paper, we use Bell inequality and nonlocality to study the bipartite correlation in an exactly soluble two-dimensional mixed spin system. Bell inequality turns out to be a valuable detector for phase transitions in this model. It can detect not only the quantum phase transition, but also the thermal phase transitions, of the system. The property of bipartite correlation in the system is also analyzed. In the quantum anti-ferromagnetic phase, the Bell inequality is violated thus nonlocality is present. It is interesting that the nonlocality is enhanced by thermal fluctuation, and simila…
Heterogeneous bipartite quantum pure states, composed of two subsystems with a different number of levels, cannot have both reductions maximally mixed. In this work, we demonstrate existence of a wide range of highly entangled states of heterogeneous multipartite systems consisting of $N>2$ parties such that every reduction to one and two parties is maximally mixed. Two constructions of generating genuinely multipartite maximally entangled states of heterogeneous systems for an arbitrary number of subsystems are presented. Such states are related to quantum error correction codes over mixed al…
We propose protocols for determining the distances in Hilbert space between pure and mixed quantum states prepared on a quantum computer. In the case of pure quantum states, the protocol is based on measuring the square of modulus of scalar product between certain states. Determination of the distance between mixed quantum states is reduced to measuring the squares of modules of scalar products between all pure states included in the mixed states. In addition, we develop a protocol that allows one to determine the speed of evolution of the spin system simulated by a quantum computer. These pro…
The maximally entangled state can be in a mixed state as well as the well-known pure state. Taking the negativity as a measure of entanglement, we study the entanglement dynamics of bipartite, mixed maximally entangled states (MMESs) in multipartite cavity-reservoir systems. It is found that the MMES can exhibit the phenomenon of entanglement sudden death, which is quite different from the asymptotic decay of the pure-Bell-state case. We also find that maximal entanglement cannot guarantee maximal nonlocality and the MMES does not correspond to the state with maximal measurement-induced nonloc…
We consider quantum enhanced measurements with initially mixed states. We show very generally that for any linear propagation of the initial state that depends smoothly on the parameter to be estimated, the sensitivity is bound by the maximal sensitivity that can be achieved for any of the pure states from which the initial density matrix is mixed. This provides a very general proof that purely classical correlations cannot improve the sensitivity of parameter estimation schemes in quantum enhanced measurement schemes.
Two-qubit quantum codes have been suggested to obtain better efficiency and higher loss tolerance in quantum key distribution. Here, we propose a two-qubit quantum key distribution protocol based on a mixed basis consisting of two Bell states and two states from the computational basis. All states can be generated from a single entangled photon pair resource by using local operations on only one auxiliary photon. Compared to other schemes it is also possible to deterministically discriminate all states using linear optics. Additionally, our protocol can be implemented with today's technology. …
Geometric phase has found a broad spectrum of applications in both classical and quantum physics, such as condensed matter and quantum computation. In this paper we introduce an operational geometric phase for mixed quantum states, based on spectral weighted traces of holonomies, and we prove that it generalizes the standard definition of geometric phase for mixed states, which is based on quantum interferometry. We also introduce higher order geometric phases, and prove that under a fairly weak, generically satisfied, requirement, there is always a well-defined geometric phase of some order. …
Weak-measurement-based experiments [Kocsis et al., Science 332 (2011) 1170] have shown that, at least for pure states, the average evolution of independent photons in Young's two-slit experiment is in compliance with the trajectories prescribed by the Bohmian formulation of quantum mechanics. But, what happens if the same experiment is repeated assuming that the wave function associated with each particle is different, i.e., in the case of mixed (incoherent) states? This question is investigated here by means of two alternative numerical simulations of Young's experiment, purposely devised to …
Solving combinatorial optimization problems on current noisy quantum devices is currently being advocated for (and restricted to) binary polynomial optimization with equality constraints via quantum heuristic approaches. This is achieved using, e.g., the variational quantum eigensolver (VQE) and the quantum approximate optimization algorithm (QAOA). We present a decomposition-based approach to extend the applicability of current approaches to "quadratic plus convex" mixed binary optimization (MBO) problems, so as to solve a broad class of real-world optimization problems. In the MBO framework,…
