Quantum Monge-Kantorovich problem and transport distance between density matrices

• URL: http://arxiv.org/abs/2102.07787v2
• Date: Mon, 27 Sep 2021 17:16:33 GMT
• Title: Quantum Monge-Kantorovich problem and transport distance between density matrices
• Authors: Shmuel Friedland, Micha{\l} Eckstein, Sam Cole, Karol \.Zyczkowski
• Abstract summary: We show that, selecting the quantum cost matrix to be proportional to the projector on the antisymmetric subspace, the minimal transport cost leads to a semidistance between $rhoA$ and $rhoB$. We introduce an associated measure of proximity of quantum states, called SWAP-fidelity, and discuss its properties and applications in quantum machine learning.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A quantum version of the Monge--Kantorovich optimal transport problem is analyzed. The transport cost is minimized over the set of all bipartite coupling states $\rho^{AB}$, such that both of its reduced density matrices $\rho^A$ and $\rho^B$ of dimension $N$ are fixed. We show that, selecting the quantum cost matrix to be proportional to the projector on the antisymmetric subspace, the minimal transport cost leads to a semidistance between $\rho^A$ and $\rho^B$, which is bounded from below by the rescaled Bures distance and from above by the root infidelity. In the single qubit case we provide a semi-analytic expression for the optimal transport cost between any two states and prove that its square root satisfies the triangle inequality and yields an analogue of the Wasserstein distance of order two on the set of density matrices. We introduce an associated measure of proximity of quantum states, called SWAP-fidelity, and discuss its properties and applications in quantum machine learning.

Related papers

• Relative-Translation Invariant Wasserstein Distance [82.6068808353647]
  We introduce a new family of distances, relative-translation invariant Wasserstein distances ($RW_p$) We show that $RW_p distances are also real distance metrics defined on the quotient set $mathcalP_p(mathbbRn)/sim$ invariant to distribution translations.
  arXiv  Detail & Related papers  (2024-09-04T03:41:44Z)
• Entanglement in flavored scalar scattering [0.0]
  We investigate quantum entanglement in high-energy $2to 2$ scalar scattering. We build the final-state density matrix as a function of the scattering amplitudes connecting the initial to the outgoing state. We consider the post-scattering entanglement between the momentum and flavor degrees of freedom of the final-state particles.
  arXiv  Detail & Related papers  (2024-04-21T18:59:48Z)
• Quantum Error Suppression with Subgroup Stabilisation [3.4719087457636792]
  Quantum state purification is the functionality that, given multiple copies of an unknown state, outputs a state with increased purity. We propose an effective state purification gadget with a moderate quantum overhead by projecting $M$ noisy quantum inputs to their subspace. Our method, applied in every short evolution over $M$ redundant copies of noisy states, can suppress both coherent and errors by a factor of $1/M$, respectively.
  arXiv  Detail & Related papers  (2024-04-15T17:51:47Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• Quantum Current and Holographic Categorical Symmetry [62.07387569558919]
  A quantum current is defined as symmetric operators that can transport symmetry charges over an arbitrary long distance. The condition for quantum currents to be superconducting is also specified, which corresponds to condensation of anyons in one higher dimension.
  arXiv  Detail & Related papers  (2023-05-22T11:00:25Z)
• Monotonicity of the quantum 2-Wasserstein distance [0.0]
  We show that for $N=2$ dimensional Hilbert space the quantum 2-Wasserstein distance is monotonous with respect to any single-qubit quantum operation. We conjecture that the unitary invariant quantum 2-Wasserstein semi-distance is monotonous with respect to all CPTP maps in any dimension $N$.
  arXiv  Detail & Related papers  (2022-04-15T09:57:39Z)
• Annihilating Entanglement Between Cones [77.34726150561087]
  We show that Lorentz cones are the only cones with a symmetric base for which a certain stronger version of the resilience property is satisfied. Our proof exploits the symmetries of the Lorentz cones and applies two constructions resembling protocols for entanglement distillation.
  arXiv  Detail & Related papers  (2021-10-22T15:02:39Z)
• On Multimarginal Partial Optimal Transport: Equivalent Forms and Computational Complexity [11.280177531118206]
  We study the multi-marginal partial optimal transport (POT) problem between $m$ discrete (unbalanced) measures with at most $n$ supports. We first prove that we can obtain two equivalence forms of the multimarginal POT problem in terms of the multimarginal optimal transport problem via novel extensions of cost tensor. We demonstrate that the ApproxMPOT algorithm can approximate the optimal value of multimarginal POT problem with a computational complexity upper bound of the order $tildemathcalO(m3(n+1)m/ var
  arXiv  Detail & Related papers  (2021-08-18T06:46:59Z)
• Quantum Optimal Transport [0.0]
  We analyze a quantum version of the Monge--Kantorovich optimal transport problem. We show that the quantum transport is cheaper than the classical one. We also discuss the quantum optimal transport for general $d$-partite systems.
  arXiv  Detail & Related papers  (2021-05-14T16:11:27Z)
• Random quantum circuits anti-concentrate in log depth [118.18170052022323]
  We study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anti-concentrated. Our definition of anti-concentration is that the expected collision probability is only a constant factor larger than if the distribution were uniform. In both the case where the gates are nearest-neighbor on a 1D ring and the case where gates are long-range, we show $O(n log(n)) gates are also sufficient.
  arXiv  Detail & Related papers  (2020-11-24T18:44:57Z)
• Linear Optimal Transport Embedding: Provable Wasserstein classification for certain rigid transformations and perturbations [79.23797234241471]
  Discriminating between distributions is an important problem in a number of scientific fields. The Linear Optimal Transportation (LOT) embeds the space of distributions into an $L2$-space. We demonstrate the benefits of LOT on a number of distribution classification problems.
  arXiv  Detail & Related papers  (2020-08-20T19:09:33Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.