Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Limitations of variational quantum algorithms: a quantum optimal transport approach
The impressive progress in quantum hardware of the last years has raised the interest of the
quantum computing community in harvesting the computational power of such devices …
quantum computing community in harvesting the computational power of such devices …
Efficient learning of ground and thermal states within phases of matter
We consider two related tasks:(a) estimating a parameterisation of a given Gibbs state and
expectation values of Lipschitz observables on this state;(b) learning the expectation values …
expectation values of Lipschitz observables on this state;(b) learning the expectation values …
The quantum Wasserstein distance of order 1
We propose a generalization of the Wasserstein distance of order 1 to the quantum states of
n qudits. The proposal recovers the Hamming distance for the vectors of the canonical basis …
n qudits. The proposal recovers the Hamming distance for the vectors of the canonical basis …
Geometrical bounds of the irreversibility in Markovian systems
T Van Vu, Y Hasegawa - Physical Review Letters, 2021 - APS
We derive geometrical bounds on the irreversibility in both quantum and classical Markovian
open systems that satisfy the detailed balance condition. Using information geometry, we …
open systems that satisfy the detailed balance condition. Using information geometry, we …
Learning quantum many-body systems from a few copies
Estimating physical properties of quantum states from measurements is one of the most
fundamental tasks in quantum science. In this work, we identify conditions on states under …
fundamental tasks in quantum science. In this work, we identify conditions on states under …
Quantum optimal transport with quantum channels
G De Palma, D Trevisan - Annales Henri Poincaré, 2021 - Springer
We propose a new generalization to quantum states of the Wasserstein distance, which is a
fundamental distance between probability distributions given by the minimization of a …
fundamental distance between probability distributions given by the minimization of a …
Non-commutative calculus, optimal transport and functional inequalities in dissipative quantum systems
We study dynamical optimal transport metrics between density matrices associated to
symmetric Dirichlet forms on finite-dimensional C^* C∗-algebras. Our setting covers …
symmetric Dirichlet forms on finite-dimensional C^* C∗-algebras. Our setting covers …
Complete entropic inequalities for quantum Markov chains
We prove that every GNS-symmetric quantum Markov semigroup on a finite dimensional
matrix algebra satisfies a modified log-Sobolev inequality. In the discrete time setting, we …
matrix algebra satisfies a modified log-Sobolev inequality. In the discrete time setting, we …
Learning quantum data with the quantum earth mover's distance
Quantifying how far the output of a learning algorithm is from its target is an essential task in
machine learning. However, in quantum settings, the loss landscapes of commonly used …
machine learning. However, in quantum settings, the loss landscapes of commonly used …
The modified logarithmic Sobolev inequality for quantum spin systems: classical and commuting nearest neighbour interactions
Given a uniform, frustration-free family of local Lindbladians defined on a quantum lattice
spin system in any spatial dimension, we prove a strong exponential convergence in relative …
spin system in any spatial dimension, we prove a strong exponential convergence in relative …