Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

American Journal of Mathematics

Extensions of Pure States

Richard V. Kadison, I. M. Singer

Published Apr 1, 1959• 217 citations
Publisher
DOI
10.2307/2372748

Related papers

Pure States

Daniel M. Greenberger, Klaus Hentschel, Friedel Weinert

Compendium of Quantum Physics•Jan 1, 2009•0 citations

A variational quantum algorithm for approximating convex roofs

George Androulakis, Ryan McGaha

Many entanglement measures are first defined for pure states of a bipartite Hilbert space, and then extended to mixed states via the convex roof extension. In this article we alter the convex roof extension of an entanglement measure, to produce a sequence of extensions that we call $f$-$d$ extensions, for $d \in \mathbb{N}$, where $f:[0,1]\to [0, \infty)$ is a fixed continuous function which vanishes only at zero. We prove that for any such function $f$, and any continuous, faithful, non-negative function, (such as an entanglement measure), $\mu$ on the set of pure states of a finite dimensional bipartite Hilbert space, the collection of $f$-$d$ extensions of $\mu$ detects entanglement, i.e. a mixed state $\rho$ on a finite dimensional bipartite Hilbert space is separable, if and only if there exists $d \in \mathbb{N}$ such that the $f$-$d$ extension of $\mu$ applied to $\rho$ is equal to zero. We introduce a quantum variational algorithm which aims to approximate the $f$-$d$ extensions of entanglement measures defined on pure states. However, the algorithm does have its drawbacks. We show that this algorithm exhibits barren plateaus when used to approximate the family of $f$-$d$ extensions of the Tsallis entanglement entropy for a certain function $f$ and unitary ansatz $U(\theta)$ of sufficient depth. In practice, if additional information about the state is known, then one needs to avoid using the suggested ansatz for long depth of circuits.

arXiv:2203.02099•Quantum Information and Computation•Sep 1, 2022•2 citations

PURE STATES IN ORDERED LOCALLY

Convex Hausdorff Spaces, Pietro Aiena, Umberto Oliveri

•Jan 1, 1980•0 citations

Noninformative prior in the quantum statistical model of pure states and generalized entropy (New developments of generalized entropies by functional analysis)

冬彦 田中

In the quantum state tomography, which is the task of estimating the unknown quantum state on a Hilbert space from measurement data, the standard Bayesian technique is often used.As is well known in Bayesian statistics, it is a nontrivial problem to define a noninformative prior in gen- eral statistical models.Although some definitions for statistical models of mixed states are given by straightforward extension of classical results, there is no counterpart for those of pure states.Recently the author proposed a conceptual extension of the famous reference prior by Bemardo and defined noninformative priors for statistical models of pure states.While the formal extension of the reference prior corresponds to the prior maximizing the von Neumann entropy, our proposed prior is shown to maximize the limit of the quantum Renyi entropy.We show some relations between two principles.

•Sep 1, 2013•0 citations

Coherent States

John R. Klauder, Bo-Sture Skagerstam

WORLD SCIENTIFIC eBooks•Apr 1, 1985•1,186 citations

An answer to a question of Gudder about the existence of optimal pure state ensembles

George Androulakis, Ryan McGaha

Gudder, in a recent paper, defined a candidate entanglement measure which is called the entanglement number. The entanglement number is first defined on pure states and then it extends to mixed states by the convex roof construction. In Gudder's article it was left as an open problem to show that Optimal Pure State Ensembles (OPSE) exist for the convex roof extension of the entanglement number from pure to mixed states. We answer Gudder's question in the affirmative, and therefore we obtain that the entanglement number vanishes only on the separable states. More generally we show that OPSE exist for the convex roof extension of any function that is norm continuous on the pure states of a finite dimensional Hilbert space. Further we prove that the entanglement number is an LOCC monotone, (and thus an entanglement measure), by using a criterion that was developed by Vidal in 2000. We present a simplified proof of Vidal's result where moreover we use an interesting point of view of tree representations for LOCC communications. Lastly, we generalize Gudder's entanglement number by producing a monotonic family of entanglement measures which converge in a natural way to the entropy of entanglement.

•Dec 3, 2020•0 citations
Many entanglement measures are first defined for pure states of a bipartite Hilbert space, and then extended to mixed states via the convex roof extension. In this article we alter the convex roof extension of an entanglement measure, to produce a sequence of extensions that we call fff-ddd extensions, for d∈Nd \in \mathbb{N}d∈N, where f:[0,1]→[0,∞)f:[0,1]\to [0, \infty)f:[0,1]→[0,∞) is a fixed continuous function which vanishes only at zero. We prove that for any such function fff, and any continuous, faithful, non-negative function, (such as an entanglement measure), μ\muμ on the set of pure states of a finite dimensional bipartite Hilbert space, the collection of fff-ddd extensions of μ\muμ detects entanglement, i.e. a mixed state ρ\rhoρ on a finite dimensional bipartite Hilbert space is separable, if and only if there exists d∈Nd \in \mathbb{N}d∈N such that the fff-ddd extension of μ\muμ applied to ρ\rhoρ is equal to zero. We introduce a quantum variational algorithm which aims to approximate the fff-ddd extensions of entanglement measures defined on pure states. However, the algorithm does have its drawbacks. We show that this algorithm exhibits barren plateaus when used to approximate the family of fff-ddd extensions of the Tsallis entanglement entropy for a certain function fff and unitary ansatz U(θ)U(\theta)U(θ) of sufficient depth. In practice, if additional information about the state is known, then one needs to avoid using the suggested ansatz for long depth of circuits.
In the quantum state tomography, which is the task of estimating the unknown quantum state on a Hilbert space from measurement data, the standard Bayesian technique is often used.As is well known in Bayesian statistics, it is a nontrivial problem to define a noninformative prior in gen- eral statistical models.Although some definitions for statistical models of mixed states are given by straightforward extension of classical results, there is no counterpart for those of pure states.Recently the author proposed a conceptual extension of the famous reference prior by Bemardo and defined noninformative priors for statistical models of pure states.While the formal extension of the reference prior corresponds to the prior maximizing the von Neumann entropy, our proposed prior is shown to maximize the limit of the quantum Renyi entropy.We show some relations between two principles.
Gudder, in a recent paper, defined a candidate entanglement measure which is called the entanglement number. The entanglement number is first defined on pure states and then it extends to mixed states by the convex roof construction. In Gudder's article it was left as an open problem to show that Optimal Pure State Ensembles (OPSE) exist for the convex roof extension of the entanglement number from pure to mixed states. We answer Gudder's question in the affirmative, and therefore we obtain that the entanglement number vanishes only on the separable states. More generally we show that OPSE exist for the convex roof extension of any function that is norm continuous on the pure states of a finite dimensional Hilbert space. Further we prove that the entanglement number is an LOCC monotone, (and thus an entanglement measure), by using a criterion that was developed by Vidal in 2000. We present a simplified proof of Vidal's result where moreover we use an interesting point of view of tree representations for LOCC communications. Lastly, we generalize Gudder's entanglement number by producing a monotonic family of entanglement measures which converge in a natural way to the entropy of entanglement.