Search NASA⌕ Search

SEARCH · Search NASA

Results for “quantum mixed states”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records

Geometric uncertainty relation for mixed quantum states

In this paper we use symplectic reduction in an Uhlmann bundle to construct a principal fiber bundle over a general space of unitarily equivalent mixed quantum states. The bundle, which generalizes the Hopf bundle for pure states, gives in a canonical way rise to a Riemannian metric and a symplectic structure on the base space. With these we derive a geometric uncertainty relation for observables acting on quantum systems in mixed states. We also give a geometric proof of the classical Robertson-Schrödinger uncertainty relation, and we compare the two. They turn out not to be equivalent, because of the multiple dimensions of the gauge group for general mixed states. We give examples of observables for which the geometric relation provides a stronger estimate than that of Robertson and Schrödinger, and vice versa.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Comparison of mixed quantum states

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 the universal comparison of mixed quantum states, and prove that this task is generally impossible to accomplish. Then, we focus on the unambiguous comparison of n mixed quantum states arbitrarily chosen from a set of k mixed quantum states. The condition for the existence of an unambiguous measurement operator which can produce a conclusive result when the unknown states are actually the same and the condition for the existence of an unambiguous measurement operator when the unknown states are actually different are studied independently. We derive a necessary and sufficient condition for the existence of the first measurement operator, and a necessary condition and two sufficient conditions for the second. Furthermore, we find that the sufficiency of the necessary condition for the second measurement operator has a simple and interesting dependence on n and k. At the end, a unified condition is obtained for the simultaneous existence of these two unambiguous measurement operators.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Average subentropy, coherence and entanglement of random mixed quantum states

Compact expressions for the average subentropy and coherence are obtained for random mixed states that are generated via various probability measures. Surprisingly, our results show that the average subentropy of random mixed states approaches the maximum value of the subentropy which is attained for the maximally mixed state as we increase the dimension. In the special case of the random mixed states sampled from the induced measure via partial tracing of random bipartite pure states, we establish the typicality of the relative entropy of coherence for random mixed states invoking the concentration of measure phenomenon. Our results also indicate that mixed quantum states are less useful compared to pure quantum states in higher dimension when we extract quantum coherence as a resource. This is because of the fact that average coherence of random mixed states is bounded uniformly, however, the average coherence of random pure states increases with the increasing dimension. As an important application, we establish the typicality of relative entropy of entanglement and distillable entanglement for a specific class of random bipartite mixed states. In particular, most of the random states in this specific class have relative entropy of entanglement and distillable entanglement equal to some fixed number (to within an arbitrary small error), thereby hugely reducing the complexity of computation of these entanglement measures for this specific class of mixed states.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum mixed state compiling

The task of learning a quantum circuit to prepare a given mixed state is a fundamental quantum subroutine. We present a variational quantum algorithm (VQA) to learn mixed states which is suitable for near-term hardware. Our algorithm represents a generalization of previous VQAs that aimed at learning preparation circuits for pure states. We consider two different ansätze for compiling the target state; the first is based on learning a purification of the state and the second on representing it as a convex combination of pure states. In both cases, the resources required to store and manipulate the compiled state grow with the rank of the approximation. Thus, by learning a lower rank approximation of the target state, our algorithm provides a means of compressing a state for more efficient processing. As a byproduct of our algorithm, one effectively learns the principal components of the target state, and hence our algorithm further provides a new method for principal component analysis. We investigate the efficacy of our algorithm through extensive numerical implementations, showing that typical random states and thermal states of many body systems may be learnt this way. Additionally, we demonstrate on quantum hardware how our algorithm can be used to study hardware noise-induced states.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Unambiguous discrimination of mixed quantum states: Optimal solution and case study

We present a generic study of the unambiguous discrimination between two mixed quantum states. We derive operational optimality conditions and show that the optimal measurements can be classified according to their rank. In Hilbert space dimensions less than or equal to 5, this leads to the complete optimal solution. We demonstrate our method with a physical example, namely, the unambiguous comparison of n quantum states, and find the optimal success probability.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Engineering arbitrary pure and mixed quantum states

Controlled manipulation by atomic- and molecular-scale quantum systems has attracted a lot of research attention in recent years. A fundamental problem is to provide deterministic methods for controlled engineering of arbitrary quantum states. This work proposes a deterministic method for engineering arbitrary pure and mixed states of a wide class of quantum systems. The method exploits a special combination of incoherent and coherent controls (incoherent and coherent radiation) and has two properties which are specifically important for manipulating by quantum systems: it realizes the strongest possible degree of their state control, complete density matrix controllability, meaning the ability to steer arbitrary pure and mixed initial states into any desired pure or mixed final state, and it is all-to-one, such that each particular control transfers all initial system states into one target state.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Parallel transport dynamics for mixed quantum states with applications to time-dependent density functional theory

Direct simulation of the von Neumann dynamics for a general (pure or mixed) quantum state can often be expensive. One prominent example is the real-time time-dependent density functional theory (rt-TDDFT), a widely used framework for the first principle description of many-electron dynamics in chemical and materials systems. Practical rt-TDDFT calculations often avoid the direct simulation of the von Neumann equation, and solve instead a set of Schrödinger equations, of which the dynamics is equivalent to that of the von Neumann equation. However, the time step size employed by the Schrödinger dynamics is often much smaller. Here, in order to improve the time step size and the overall efficiency of the simulation, we generalize a recent work of the parallel transport (PT) dynamics for simulating pure states [An, Lin, Multiscale Model. Simul. 18, 612, 2020] to general quantum states. The PT dynamics provides the optimal gauge choice, and can employ a time step size comparable to that of the von Neumann dynamics. Going beyond the linear and near adiabatic regime in previous studies, we find that the error of the PT dynamics can be bounded by certain commutators between Hamiltonians, density matrices, and their derived quantities. Such a commutator structure is not present in the Schrödinger dynamics. We demonstrate that the parallel transport-implicit midpoint (PT-IM) method is a suitable method for simulating the PT dynamics, especially when the spectral radius of the Hamiltonian is large. The commutator structure of the error bound, and numerical results for model rt-TDDFT calculations in both linear and nonlinear regimes, confirm the advantage of the PT dynamics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Minimum-error quantum distinguishability bounds from matrix monotone functions: A comment on 'Two-sided estimates of minimum-error distinguishability of mixed quantum states via generalized Holevo-Curlander bounds' [J. Math. Phys. 50, 032106 (2009)]

Matrix monotonicity is used to obtain upper bounds on minimum-error distinguishability of arbitrary ensembles of mixed quantum states. This generalizes one direction of a two-sided bound recently obtained by the author [J. Tyson, J. Math. Phys. 50, 032106 (2009)]. It is shown that the previously obtained special case has unique properties.

97 MATHEMATICS AND COMPUTING↗

Experimental detection of nonclassical correlations in mixed-state quantum computation

We report on an experiment to detect nonclassical correlations in a highly mixed state. The correlations are characterized by the quantum discord and are observed using four qubits in a liquid-state nuclear magnetic resonance quantum information processor. The state analyzed is the output of a DQC1 computation, whose input is a single quantum bit accompanied by n maximally mixed qubits. This model of computation outperforms the best known classical algorithms and, although it contains vanishing entanglement, it is known to have quantum correlations characterized by the quantum discord. This experiment detects nonvanishing quantum discord, ensuring the existence of nonclassical correlations as measured by the quantum discord.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Singlet generation in mixed-state quantum networks

We study the generation of singlets in quantum networks with nodes initially sharing a finite number of partially entangled bipartite mixed states. We prove that singlets between arbitrary nodes in such networks can be created if and only if the initial states connecting the nodes have a particular form. We then generalize the method of entanglement percolation, previously developed for pure states, to mixed states of this form. As part of this, we find and compare different distillation protocols necessary to convert groups of mixed states shared between neighboring nodes of the network into singlets. In addition, we discuss protocols that only rely on local rules for the efficient connection of two remote nodes in the network via entanglement swapping. Further improvements of the success probability of singlet generation are developed by using particular forms of ''quantum preprocessing'' on the network. This includes generalized forms of entanglement swapping and we show how such strategies can be embedded in regular and hierarchical quantum networks.

74 ATOMIC AND MOLECULAR PHYSICS↗

Observable estimation of entanglement of formation and quantum discord for bipartite mixed quantum states

We present observable lower and upper bounds for the entanglement of formation (EOF) and quantum discord (QD), which facilitates estimates of EOF and QD for arbitrary experimental unknown states in finite-dimensional bipartite systems. These bounds can be easily obtained by a few experimental measurements on a twofold copy {rho} x {rho} of the mixed states. Based on our results, we use the experimental measurement data of the real experiment given by Schmid et al.[Phys. Rev. Lett. 101, 260505 (2008)] to obtain the lower and upper bounds of EOF and QD for the experimental unknown state.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Single-experiment-detectable nonclassical correlation witness

Recent progress in theories of quantum information has determined nonclassical correlation defined differently from the widely used entanglement as an important property to evaluate computation and communication with mixed quantum states. We introduce an operational method to detect nonclassical correlation of bipartite systems. In this method, we use particular maps analogous to the well-established entanglement witnesses. Thus, the maps are called nonclassical correlation witness maps. Furthermore, it is proved that such a map can be generally decomposed so that a single-run experiment is feasible for implementation in bulk-ensemble systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Locally purified maximally mixed states at scale: Entanglement pruning and symmetries

Locally Purified Density Operators (LPDOs) are state-of-the-art tensor network ansatze candidates that efficiently represent mixed quantum states at scale. However, given their non-uniqueness, their representational complexity is generally sub-optimal in practical computations. Here, in this work we perform a comprehensive numerical and analytical analysis and resolve this issue in the experimentally relevant limit where noise depolarizes the density operator into a maximally mixed state. To resolve the sub-optimality issue, we analyze two numerical tools, one analytic method, and detail the relations between them. The numerical tools used are fidelity-preserving truncations and isometric gauge transformations leveraging Riemannian optimizations over entropic objective functions. In addition, by invoking the injectivity and symmetry constraints of the maximally mixed LPDO, we also present analytical closed-form expressions for the disentangler and discuss their relation to numerical optimizers. Further, away from the maximally mixed state, our simulations highlight how the truncation threshold smoothly interpolate, as a function of depolarization, between established matrix product results and our new results. Our work shows how, by minimizing the resources required to represent key states of practical interest in experiment, the efficiency of tensor network algorithms can be substantially increased. This paves the path for uncovering tensor network’s fundamental scalability limits and latent potential in representing the wide locus of mixed quantum states that are accessible on near-term quantum devices.

Gangapuram, Amit Jamadagni [Oak Ridge National Lab↗

Relation between minimum-error discrimination and optimum unambiguous discrimination

In this paper, we investigate the relationship between the minimum-error probability Q{sub E} of ambiguous discrimination and the optimal inconclusive probability Q{sub U} of unambiguous discrimination. It is known that for discriminating two states, the inequality Q{sub U{>=}}2Q{sub E} has been proved in the literature. The main technical results are as follows: (1) We show that, for discriminating more than two states, Q{sub U{>=}}2Q{sub E} may not hold again, but the infimum of Q{sub U}/Q{sub E} is 1, and there is no supremum of Q{sub U}/Q{sub E}, which implies that the failure probabilities of the two schemes for discriminating some states may be narrowly or widely gapped. (2) We derive two concrete formulas of the minimum-error probability Q{sub E} and the optimal inconclusive probability Q{sub U}, respectively, for ambiguous discrimination and unambiguous discrimination among arbitrary m simultaneously diagonalizable mixed quantum states with given prior probabilities. In addition, we show that Q{sub E} and Q{sub U} satisfy the relationship that Q{sub U{>=}}(m/m-1)Q{sub E}.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Extremal quantum correlations: Experimental study with two-qubit states

We explore experimentally the space of two-qubit quantum-correlated mixed states, including frontier states as defined by the use of quantum discord and von Neumann entropy. Our experimental setup is flexible enough to allow for high-quality generation of a vast variety of states. We address quantitatively the relation between quantum discord and a recently suggested alternative measure of quantum correlations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Computing partition functions in the one-clean-qubit model

We present a method to approximate partition functions of quantum systems using mixed-state quantum computation. For positive-semidefinite Hamiltonians, our method has an expected running-time that is almost linear in [M/( ε rel Z )] 2 , where M is the dimension of the quantum system, Z is the partition function, and ε rel is the relative precision. It is based on approximations of the exponential operator as linear combinations of certain operators related to block-encoding of Hamiltonians or Hamiltonian evolutions. The trace of each operator is estimated using a standard algorithm in the one-clean-qubit model. For large values of Z , our method may run faster than exact classical methods, whose complexities are polynomial in M . We also prove that a version of the partition function estimation problem within additive error is complete for the so-called DQC1 complexity class, suggesting that our method provides a superpolynomial speedup for certain parameter values. Overall, to attain a desired relative precision, we develop a classical procedure based on a sequence of approximations within predetermined additive errors that may be of independent interest.

97 MATHEMATICS AND COMPUTING↗

Efficient optimal minimum error discrimination of symmetric quantum states

This article deals with the quantum optimal discrimination among mixed quantum states enjoying geometrical uniform symmetry with respect to a reference density operator rho{sub 0}. It is well known that the minimal error probability is given by the positive operator-valued measure obtained as a solution of a convex optimization problem, namely a set of operators satisfying geometrical symmetry, with respect to a reference operator PI{sub 0} and maximizing Tr(rho{sub 0}PI{sub 0}). In this article, by resolving the dual problem, we show that the same result is obtained by minimizing the trace of a semidefinite positive operator X commuting with the symmetry operator and such that X>=rho{sub 0}. The new formulation gives a deeper insight into the optimization problem and allows to obtain closed-form analytical solutions, as shown by a simple but not trivial explanatory example. In addition to the theoretical interest, the result leads to semidefinite programming solutions of reduced complexity, allowing to extend the numerical performance evaluation to quantum communication systems modeled in Hilbert spaces of large dimension.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗