Do these 3 things before closing this tab:
1Clear out junk files and repair common Windows errors2Fix the driver behind crashes, sound loss and screen glitches3Repair Windows errors before they cause bigger problemsA quantum transport barycentre is a quantum state that minimizes the weighted transport cost to a collection of input states. It is not generally the arithmetic average of their density matrices: each transport cost is defined by optimizing over bipartite quantum states with specified marginal states. For Gaussian inputs and canonical quadratic 2-quantum Wasserstein costs, Gerolin and Lin show that the calculation can be reduced to a finite-dimensional convex optimization over covariance matrices.
What a quantum transport barycentre means
Let the input states be density operators σ1, …, σN, with σs acting on a Hilbert space ℋs. Give each state a positive weight αs, with Σs αs = 1. Choose a common Hilbert space ℋ0 for the barycentre and a nonnegative self-adjoint cost operator Cs on ℋ0 ⊗ ℋs for each input.
A candidate barycentre is a density operator ρ on ℋ0. To measure its transport cost to σs, consider bipartite density operators γs on ℋ0 ⊗ ℋs whose partial traces are ρ and σs. Such a γs is a coupling of the two states. The cost for that input is the least possible expectation of Cs over these couplings:
TCs(ρ, σs) = inf Tr(Csγs), where γs is a bipartite state with Trℋs(γs) = ρ and Trℋ0(γs) = σs.
The Tool Desk
Outbyte Driver Updater FREEFix the driver behind crashes, sound loss and screen glitchesFind Drivers →Outbyte PC Repair FREERepair Windows errors before they cause bigger problemsFix Now →#1 Best Overall
The barycentre minimizes the weighted sum of those individual costs:
ρ* ∈ arg minρ Σs=1N αsTCs(ρ, σs), with ρ ranging over quantum states on ℋ0.
Rank #2
This definition makes the transport model part of the answer: the spaces, admissible states, weights, costs, and allowed barycentre states all matter. A different choice of cost operators or barycentre space defines a different optimization problem.
How to calculate one
- Specify the model. Identify the input density operators, their Hilbert spaces, the normalized weights, the common barycentre space, and the cost operator linking that space to each input. If using a 2-quantum Wasserstein cost, state the particular canonical quadratic cost convention. The state-state and channel-based formulations are both treated in the framework of Gerolin and Lin, but they are distinct models and should not be mixed without specifying which objects and constraints are being used.
- Set up each transport problem. For a trial barycentre ρ, minimize Tr(Csγs) over bipartite states γs with the required partial traces. Each input has its own coupling and cost minimization.
- Minimize over the barycentre. Find the state ρ that minimizes the weighted sum of the resulting transport costs. This is a variational problem over quantum states, not a component-by-component average of the input density matrices.
- Check that the existence assumptions apply. The general existence and duality results in Gerolin and Lin rely on hypotheses that include confinement and finite-cost feasibility. For unbounded cost operators or continuous-variable systems, those conditions need to be checked; existence should not be presumed from the definition alone.
- Use a covariance formulation when the Gaussian result applies. For Gaussian inputs and canonical quadratic costs in the 2-quantum Wasserstein setting, the authors prove that a Gaussian minimizer exists and reduce the minimum to a finite-dimensional convex optimization over covariance matrices.
- Verify the state, not just its covariance. To establish a barycentre as a quantum state, the covariance solution must be connected back to a valid state. The paper uses a state-reconstruction principle under covariance complementary slackness. A unique optimal covariance by itself does not establish that there is only one optimal quantum state.
What the Gaussian covariance reduction does—and does not—say
Covariance matrices give a finite-dimensional route through the Gaussian case: instead of optimizing over all candidate quantum states and couplings directly, the stated result reduces the minimum to a convex problem over covariance matrices. This is a structural theorem for Gaussian inputs under the specified canonical quadratic costs, not a general recipe that applies unchanged to arbitrary quantum states or cost operators.
Rank #3
Uniqueness also requires care. Gerolin and Lin state that if at least one Gaussian input is faithful, then the barycentre is unique among all quantum states and is necessarily Gaussian. Without that condition, a unique optimizer in the covariance problem should not be taken as proof of global state uniqueness; the covariance-to-state reconstruction argument is a separate part of the analysis.
How this differs from a classical Wasserstein barycentre
In the classical setting, a Wasserstein barycentre minimizes a weighted sum of powered Wasserstein distances, commonly written Σs αs Wpp(μ, νs). The underlying space, cost, exponent, and permitted class of barycentres are part of that definition. A distance and its powered version are not interchangeable, so the cost convention should be stated explicitly.
For classical empirical measures, transport can be expressed as a linear program over a nonnegative coupling matrix with prescribed row and column marginals. Cuturi and Doucet discuss classical methods including convex subgradient methods for barycentre weights on fixed support, and alternating weight/location procedures for free support that can reach local minima. These methods offer intuition about constrained transport optimization; they are not quantum barycentre algorithms and do not solve the bipartite-state optimization above.
Independent reader supportYour contribution helps us test, update, and keep practical guides available for everyone.Which result is established, and by whom
The specific existence, duality, Gaussian-reduction, and uniqueness claims described here are results attributed to Augusto Gerolin and Zhiyi Lin in version 1 of their arXiv preprint, “Quantum Optimal Transport Barycenters: Existence, Duality, and Gaussian Rigidity,” submitted October 1, 2026 (arXiv:2610.01855). They write: “We first show that the barycenter problem admits a Gaussian minimizer and reduces to a finite-dimensional convex optimization problem over covariance matrices.” They also state: “if at least one Gaussian input is faithful, then the barycenter is unique among all quantum states and is necessarily Gaussian.” These are claims from a dated preprint, rather than settled textbook consensus.
Quick Recap
Product prices and availability are accurate as of the date/time indicated and are subject to change. Any price and availability information displayed on Amazon at the time of purchase will apply.
