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

Physics Letters A

Maximum entropy and approximate descriptions of pure states

Angel Ricardo Plastino, Angel Ricardo Plastino

Published Nov 1, 1993• 55 citations
Publisher
DOI
10.1016/0375-9601(93)91147-w

Related papers

Maximum-entropy-correlated ground state and the description of collective excitations

N. Canosa, Angelo Plastino, R. Rossignoli

Nuclear Physics A•Dec 1, 1992•20 citations

Maximum Entropy Descriptions of Quantum Wave Functions

N. Canosa, R. Rossignoli, Angel Ricardo Plastino

Springer eBooks•Jan 1, 1993•0 citations

Least Maximum Entropy and Minimum Uncertainty Coherent States

A. K. Rajagopal, S. Teitler

Springer eBooks•Jan 1, 1988•3 citations

L-entropy: A new genuine multipartite entanglement measure

Jaydeep Kumar Basak, Vinay Malvimat, Junggi Yoon

We advance ``Latent entropy" (L-entropy) as a novel measure to characterize genuine multipartite entanglement in pure states, applicable to quantum systems with both finite and infinite degrees of freedom. This measure, derived from an upper bound on reflected entropy, attains its maximum for three-party GHZ states and $n=4,5$-party $2$-uniform states. We establish that it satisfies all essential properties of a genuine multipartite entanglement measure, including being a pure-state entanglement monotone. We further obtain an analogue of the Page curve by analyzing the behavior of L-entropy in multiboundary wormholes, emphasizing their connection to multipartite entanglement in random states. Specifically, for $n = 5$, we show that random states approximate $2$-uniform states, exhibiting maximal multipartite entanglement. Extending these ideas to finite temperatures, we introduce the Multipartite Thermal Pure Quantum (MTPQ) state, a generalization of the thermal pure quantum state to multipartite systems, and demonstrate that the entanglement structure in states of the multicopy SYK model exhibits finite-temperature $2$-uniform behavior.

hep-thCross-listedarXiv:2602.00617•Physical Review Letters•Feb 3, 2026•2 citations

Quantum inference methods and hypervirial theorems

Angel Ricardo Plastino, Montserrat Casas, Angel Ricardo Plastino +1 more

Arguments of the Jaynes maximum entropy sort have proved to be surprisingly successful in providing one with approximate descriptions of pure states in a variety of scenarios, entirely bypassing any consideration of Schr\"odinger's equation. Thus far, however, the algorithm has been unable to incorporate input information concerning expectation values of complementary observables. We discuss here how to overcome this difficulty by recourse to diagonal hypervirial theorems.

Physical Review A•Oct 1, 1995•16 citations

Randomized truncation of quantum states

Aram W. Harrow, Angus Lowe, Freek Witteveen

A fundamental task in quantum information is to approximate a pure quantum state in terms of sparse states or, for a bipartite system, states of bounded Schmidt rank. The optimal deterministic approximation in each case is straightforward, and maximizes the fidelity: keep the largest entries or singular values. On the other hand, random mixtures of sparse states can achieve quadratically improved trace distances, and yield nontrivial bounds on other distance measures like the robustness. In this work, we give efficient algorithms for finding mixtures of sparse states that optimally approximate a given pure state in either trace distance or robustness. These algorithms also yield descriptions of efficiently samplable ensembles of sparse, or less-entangled, states that correspond to these optimal mixed approximations. This can be used for the truncation step of algorithms for matrix product states, improving their accuracy while using no extra memory and no asymptotic increase in runtime, and we demonstrate this improvement numerically. Our proofs rely on tools from convex optimization and zero-sum games, as well as rigorous gurarantees for computing and sampling from maximum-entropy distributions. In particular, a key step in our construction is conditional Poisson sampling, which is the well-studied problem of drawing fixed-size subsets from a population with known inclusion probabilities. We give improved algorithms for carrying out this sampling, which may be of independent interest.

arXiv:2510.08518•Oct 9, 2025•6 citations
We advance ``Latent entropy" (L-entropy) as a novel measure to characterize genuine multipartite entanglement in pure states, applicable to quantum systems with both finite and infinite degrees of freedom. This measure, derived from an upper bound on reflected entropy, attains its maximum for three-party GHZ states and n=4,5n=4,5n=4,5-party 222-uniform states. We establish that it satisfies all essential properties of a genuine multipartite entanglement measure, including being a pure-state entanglement monotone. We further obtain an analogue of the Page curve by analyzing the behavior of L-entropy in multiboundary wormholes, emphasizing their connection to multipartite entanglement in random states. Specifically, for n=5n = 5n=5, we show that random states approximate 222-uniform states, exhibiting maximal multipartite entanglement. Extending these ideas to finite temperatures, we introduce the Multipartite Thermal Pure Quantum (MTPQ) state, a generalization of the thermal pure quantum state to multipartite systems, and demonstrate that the entanglement structure in states of the multicopy SYK model exhibits finite-temperature 222-uniform behavior.
A fundamental task in quantum information is to approximate a pure quantum state in terms of sparse states or, for a bipartite system, states of bounded Schmidt rank. The optimal deterministic approximation in each case is straightforward, and maximizes the fidelity: keep the largest entries or singular values. On the other hand, random mixtures of sparse states can achieve quadratically improved trace distances, and yield nontrivial bounds on other distance measures like the robustness. In this work, we give efficient algorithms for finding mixtures of sparse states that optimally approximate a given pure state in either trace distance or robustness. These algorithms also yield descriptions of efficiently samplable ensembles of sparse, or less-entangled, states that correspond to these optimal mixed approximations. This can be used for the truncation step of algorithms for matrix product states, improving their accuracy while using no extra memory and no asymptotic increase in runtime, and we demonstrate this improvement numerically. Our proofs rely on tools from convex optimization and zero-sum games, as well as rigorous gurarantees for computing and sampling from maximum-entropy distributions. In particular, a key step in our construction is conditional Poisson sampling, which is the well-studied problem of drawing fixed-size subsets from a population with known inclusion probabilities. We give improved algorithms for carrying out this sampling, which may be of independent interest.