arXiv subjects

Cambyse Rouzé

Publications and source records attributed to Cambyse Rouzé.

At least 55 records · Page 3Linked to original sources

arXiv2023

Efficient learning of ground & 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; and (b) learning the expectation values of local observables within a thermal or quantum phase of matter. In both cases, we wish to minimise the number of samples we use to learn these properties to a given precision. For the first task, we develop new techniques to learn parameterisations of classes of systems, including quantum Gibbs states of non-commuting Hamiltonians with exponential decay of correlations and the approximate Markov property. We show it is possible to infer the expectation values of all extensive properties of the state from a number of copies that not only scales polylogarithmically with the system size, but polynomially in the observable's locality -- an exponential improvement. This set of properties includes expected values of quasi-local observables and entropies. For the second task, we develop efficient algorithms for learning observables in a phase of matter of a quantum system. By exploiting the locality of the Hamiltonian, we show that $M$ local observables can be learned with probability $1-δ$ to precision $ε$ with using only $N=O\big(\log\big(\frac{M}δ\big)e^{polylog(ε^{-1})}\big)$ samples -- an exponential improvement on the precision over previous bounds. Our results apply to both families of ground states of Hamiltonians displaying local topological quantum order, and thermal phases of matter with exponential decay of correlations. In addition, our sample complexity applies to the worse case setting whereas previous results only applied on average. Furthermore, we develop tools of independent interest, such as robust shadow tomography algorithms, Gibbs approximations to ground states, and generalisations of transportation cost inequalities for Gibbs states.

quant-ph↗

arXiv2023

Quantum Differential Privacy: An Information Theory Perspective

Differential privacy has been an exceptionally successful concept when it comes to providing provable security guarantees for classical computations. More recently, the concept was generalized to quantum computations. While classical computations are essentially noiseless and differential privacy is often achieved by artificially adding noise, near-term quantum computers are inherently noisy and it was observed that this leads to natural differential privacy as a feature. In this work we discuss quantum differential privacy in an information theoretic framework by casting it as a quantum divergence. A main advantage of this approach is that differential privacy becomes a property solely based on the output states of the computation, without the need to check it for every measurement. This leads to simpler proofs and generalized statements of its properties as well as several new bounds for both, general and specific, noise models. In particular, these include common representations of quantum circuits and quantum machine learning concepts. Here, we focus on the difference in the amount of noise required to achieve certain levels of differential privacy versus the amount that would make any computation useless. Finally, we also generalize the classical concepts of local differential privacy, Renyi differential privacy and the hypothesis testing interpretation to the quantum setting, providing several new properties and insights.

quant-ph↗

arXiv2023

Classical shadow tomography for continuous variables quantum systems

In this article we develop a continuous variable (CV) shadow tomography scheme with wide ranging applications in quantum optics. Our work is motivated by the increasing experimental and technological relevance of CV systems in quantum information, quantum communication, quantum sensing, quantum simulations, quantum computing and error correction. We introduce two experimentally realisable schemes for obtaining classical shadows of CV (possibly non-Gaussian) quantum states using only randomised Gaussian unitaries and easily implementable Gaussian measurements such as homodyne and heterodyne detection. For both schemes, we show that $N=O\big(\operatorname{poly}\big(\frac{1}ε,\log\big(\frac{1}δ\big),M_n^{r+α},\log(m)\big)\big)$ samples of an unknown $m$-mode state $ρ$ suffice to learn the expected value of any $r$-local polynomial in the canonical observables of degree $α$, both with high probability $1-δ$ and accuracy $ε$, as long as the state $ρ$ has moments of order $n>α$ bounded by $M_n$. By simultaneously truncating states and operators in energy and phase space, we are able to overcome new mathematical challenges that arise due to the infinite-dimensionality of CV systems. We also provide a scheme to learn nonlinear functionals of the state, such as entropies over any small number of modes, by leveraging recent energy-constrained entropic continuity bounds. Finally, we provide numerical evidence of the efficiency of our protocols in the case of CV states of relevance in quantum information theory, including ground states of quadratic Hamiltonians of many-body systems and cat qubit states. We expect our scheme to provide good recovery in learning relevant states of 2D materials and photonic crystals.

quant-ph↗

arXiv2023

Limitations of variational quantum algorithms: a quantum optimal transport approach

The impressive progress in quantum hardware in the last years has raised the interest of the quantum computing community in harvesting the computational power of such devices. However, in the absence of error correction, these devices can only reliably implement very shallow circuits or comparatively deeper circuits at the expense of a nontrivial density of errors. In this work, we obtain extremely tight limitation bounds for standard NISQ proposals in both the noisy and noiseless regimes, with or without error-mitigation tools. The bounds limit the performance of both circuit model algorithms, such as QAOA, and also continuous-time algorithms, such as quantum annealing. In the noisy regime with local depolarizing noise $p$, we prove that at depths $L=\mathcal{O}(p^{-1})$ it is exponentially unlikely that the outcome of a noisy quantum circuit outperforms efficient classical algorithms for combinatorial optimization problems like Max-Cut. Although previous results already showed that classical algorithms outperform noisy quantum circuits at constant depth, these results only held for the expectation value of the output. Our results are based on newly developed quantum entropic and concentration inequalities, which constitute a homogeneous toolkit of theoretical methods from the quantum theory of optimal mass transport whose potential usefulness goes beyond the study of variational quantum algorithms.

quant-ph↗

arXiv2023

Sufficient statistic and recoverability via Quantum Fisher Information metrics

We prove that for a large class of quantum Fisher information, a quantum channel is sufficient for a family of quantum states, i.e., the input states can be recovered from the output, if and only if the quantum Fisher information is preserved under the quantum channel. This class, for instance, includes Winger-Yanase-Dyson skew information. On the other hand, interestingly, the SLD quantum Fisher information, as the most popular example of quantum analog of Fisher information, does not satisfy this property. Our recoverability result is obtained by studying Riemannian monotone metrics on the quantum state space, i.e. metrics monotone decreasing under the action of quantum channels, a property often called data processing inequality. For two quantum states, the monotone metric gives the corresponding quantum $χ^2$ divergence. We obtain an approximate recovery result in the sense that, if the quantum $χ^2$ divergence is approximately preserved by a quantum channel, then two states can be approximately recovered by the Petz recovery map. We also obtain a universal recovery bound for the $χ_{\frac{1}{2}}$ divergence. Finally, we discuss applications in the context of quantum thermodynamics and the resource theory of asymmetry.

quant-ph↗

arXiv2022

On contraction coefficients, partial orders and approximation of capacities for quantum channels

The data processing inequality is the most basic requirement for any meaningful measure of information. It essentially states that distinguishability measures between states decrease if we apply a quantum channel and is the centerpiece of many results in information theory. Moreover, it justifies the operational interpretation of most entropic quantities. In this work, we revisit the notion of contraction coefficients of quantum channels, which provide sharper and specialized versions of the data processing inequality. A concept closely related to data processing is partial orders on quantum channels. First, we discuss several quantum extensions of the well-known less noisy ordering and relate them to contraction coefficients. We further define approximate versions of the partial orders and show how they can give strengthened and conceptually simple proofs of several results on approximating capacities. Moreover, we investigate the relation to other partial orders in the literature and their properties, particularly with regard to tensorization. We then examine the relation between contraction coefficients with other properties of quantum channels such as hypercontractivity. Next, we extend the framework of contraction coefficients to general f-divergences and prove several structural results. Finally, we consider two important classes of quantum channels, namely Weyl-covariant and bosonic Gaussian channels. For those, we determine new contraction coefficients and relations for various partial orders.

quant-ph↗

arXiv2022

Optimal convergence rate in the quantum Zeno effect for open quantum systems in infinite dimensions

In open quantum systems, the quantum Zeno effect consists in frequent applications of a given quantum operation, e.g.~a measurement, used to restrict the time evolution (due e.g.~to decoherence) to states that are invariant under the quantum operation. In an abstract setting, the Zeno sequence is an alternating concatenation of a contraction operator (quantum operation) and a $C_0$-contraction semigroup (time evolution) on a Banach space. In this paper, we prove the optimal convergence rate of order $\tfrac{1}{n}$ of the Zeno sequence by proving explicit error bounds. For that, we derive a new Chernoff-type $\sqrt{n}$-Lemma, which we believe to be of independent interest. Moreover, we generalize the convergence result for the Zeno effect in two directions: We weaken the assumptions on the generator, inducing the Zeno dynamics generated by an unbounded generator and we improve the convergence to the uniform topology. Finally, we provide a large class of examples arising from our assumptions.

quant-ph↗

arXiv2022

Deviation bounds and concentration inequalities for quantum noises

We provide a stochastic interpretation of non-commutative Dirichlet forms in the context of quantum filtering. For stochastic processes motivated by quantum optics experiments, we derive an optimal finite time deviation bound expressed in terms of the non-commutative Dirichlet form. Introducing and developing new non-commutative functional inequalities, we deduce concentration inequalities for these processes. Examples satisfying our bounds include tensor products of quantum Markov semigroups as well as Gibbs samplers above a threshold temperature.

quant-ph↗

arXiv2022

Quantum concentration inequalities

We establish transportation cost inequalities (TCI) with respect to the quantum Wasserstein distance by introducing quantum extensions of well-known classical methods: first, using a non-commutative version of Ollivier's coarse Ricci curvature, we prove that high temperature Gibbs states of commuting Hamiltonians on arbitrary hypergraphs $H=(V,E)$ satisfy a TCI with constant scaling as $O(|V|)$. Second, we argue that the temperature range for which the TCI holds can be enlarged by relating it to recently established modified logarithmic Sobolev inequalities. Third, we prove that the inequality still holds for fixed points of arbitrary reversible local quantum Markov semigroups on regular lattices, albeit with slightly worsened constants, under a seemingly weaker condition of local indistinguishability of the fixed points. Finally, we use our framework to prove Gaussian concentration bounds for the distribution of eigenvalues of quasi-local observables and argue the usefulness of the TCI in proving the equivalence of the canonical and microcanonical ensembles and an exponential improvement over the weak Eigenstate Thermalization Hypothesis.

quant-ph↗

arXiv2022

Rapid thermalization of spin chain commuting Hamiltonians

We prove that spin chains weakly coupled to a large heat bath thermalize rapidly at any temperature for finite-range, translation-invariant commuting Hamiltonians, reaching equilibrium in a time which scales logarithmically with the system size. Our main result is a generalization to the quantum setting of a seminal result of Holley and Stroock for classical spin chains and represents an exponential improvement over bounds based on the non-closure of the spectral gap. From a physical point of view, our result rigorously establishes the absence of dissipative phase transition for Davies evolutions over translation-invariant spin chains. The result also applies in the case of Symmetry Protected Topological phases where the evolution is respecting the symmetry of the phase. This has wide-ranging applications to the study of many-body in and out-of-equilibrium quantum systems.

quant-ph↗

arXiv2021

Entropy decay for Davies semigroups of a one dimensional quantum lattice

Given a finite-range, translation-invariant commuting system Hamiltonians on a spin chain, we show that the Davies semigroup describing the reduced dynamics resulting from the joint Hamiltonian evolution of a spin chain weakly coupled to a large heat bath thermalizes rapidly at any temperature. More precisely, we prove that the relative entropy between any evolved state and the equilibrium Gibbs state contracts exponentially fast with an exponent that scales logarithmically with the length of the chain. Our theorem extends a seminal result of Holley and Stroock to the quantum setting, up to a logarithmic overhead, as well as provides an exponential improvement over the non-closure of the gap proved by Brandao and Kastoryano. This has wide-ranging applications to the study of many-body in and out-of-equilibrium quantum systems. Our proof relies upon a recently derived strong decay of correlations for Gibbs states of one dimensional, translation-invariant local Hamiltonians, and tools from the theory of operator spaces.

quant-ph↗

arXiv2021

Ricci curvature of quantum channels on non-commutative transportation metric spaces

Following Ollivier's work, we introduce the coarse Ricci curvature of a quantum channel as the contraction of non-commutative metrics on the state space. These metrics are defined as a non-commutative transportation cost in the spirit of [N. Gozlan and C. Léonard. 2006], which gives a unified approach to different quantum Wasserstein distances in the literature. We prove that the coarse Ricci curvature lower bound and its dual gradient estimate, under suitable assumptions, imply the Poincaré inequality (spectral gap) as well as transportation cost inequalities. Using intertwining relations, we obtain positive bounds on the coarse Ricci curvature of Gibbs samplers, Bosonic and Fermionic beam-splitters as well as Pauli channels on n-qubits.

math-ph↗

arXiv2021

Approximate tensorization of the relative entropy for noncommuting conditional expectations

In this paper, we derive a new generalisation of the strong subadditivity of the entropy to the setting of general conditional expectations onto arbitrary finite-dimensional von Neumann algebras. The latter inequality, which we call approximate tensorization of the relative entropy, can be expressed as a lower bound for the sum of relative entropies between a given density and its respective projections onto two intersecting von Neumann algebras in terms of the relative entropy between the same density and its projection onto an algebra in the intersection, up to multiplicative and additive constants. In particular, our inequality reduces to the so-called quasi-factorization of the entropy for commuting algebras, which is a key step in modern proofs of the logarithmic Sobolev inequality for classical lattice spin systems. We also provide estimates on the constants in terms of conditions of clustering of correlations in the setting of quantum lattice spin systems. Along the way, we show the equivalence between conditional expectations arising from Petz recovery maps and those of general Davies semigroups.

quant-ph↗

arXiv2021

On the modified logarithmic Sobolev inequality for the heat-bath dynamics for 1D systems

The mixing time of Markovian dissipative evolutions of open quantum many-body systems can be bounded using optimal constants of certain quantum functional inequalities, such as the modified logarithmic Sobolev constant. For classical spin systems, the positivity of such constants follows from a mixing condition for the Gibbs measure, via quasi-factorization results for the entropy. Inspired by the classical case, we present a strategy to derive the positivity of the modified logarithmic Sobolev constant associated to the dynamics of certain quantum systems from some clustering conditions on the Gibbs state of a local, commuting Hamiltonian. In particular we show that for the heat-bath dynamics for 1D systems, the modified logarithmic Sobolev constant is positive under the assumptions of a mixing condition on the Gibbs state and a strong quasi-factorization of the relative entropy.

quant-ph↗

arXiv2021

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 prove that every finite dimensional GNS-symmetric quantum channel satisfies a strong data processing inequality with respect to its decoherence free part. Moreover, we establish the first general approximate tensorization property of relative entropy. This extends the famous strong subadditivity of the quantum entropy (SSA) of two subsystems to the general setting of two subalgebras. All the three results are independent of the size of the environment and hence satisfy the tensorization property. They are obtained via a common, conceptually simple method for proving entropic inequalities via spectral or $L_2$-estimates. As applications, we combine our results on the modified log-Sobolev inequality and approximate tensorization to derive bounds for examples of both theoretical and practical relevance, including representation of sub-Laplacians on $\operatorname{SU}(2)$ and various classes of local quantum Markov semigroups such as quantum Kac generators and continuous time approximate unitary designs. For the latter, our bounds imply the existence of local continuous time Markovian evolutions on $nk$ qudits forming $ε$-approximate $k$-designs in relative entropy for times scaling as $\widetilde{\mathcal{O}}(n^2 \operatorname{poly}(k))$.

quant-ph↗

arXiv2021

Group transference techniques for the estimation of the decoherence times and capacities of quantum Markov semigroups

Capacities of quantum channels and decoherence times both quantify the extent to which quantum information can withstand degradation by interactions with its environment. However, calculating capacities directly is known to be intractable in general. Much recent work has focused on upper bounding certain capacities in terms of more tractable quantities such as specific norms from operator theory. In the meantime, there has also been substantial recent progress on estimating decoherence times with techniques from analysis and geometry, even though many hard questions remain open. In this article, we introduce a class of continuous-time quantum channels that we called transferred channels, which are built through representation theory from a classical Markov kernel defined on a compact group. We study two subclasses of such kernels: Hörmander systems on compact Lie-groups and Markov chains on finite groups. Examples of transferred channels include the depolarizing channel, the dephasing channel, and collective decoherence channels acting on $d$ qubits. Some of the estimates presented are new, such as those for channels that randomly swap subsystems. We then extend tools developed in earlier work by Gao, Junge and LaRacuente to transfer estimates of the classical Markov kernel to the transferred channels and study in this way different non-commutative functional inequalities. The main contribution of this article is the application of this transference principle to the estimation of various capacities as well as estimation of entanglement breaking times, defined as the first time for which the channel becomes entanglement breaking. Moreover, our estimates hold for non-ergodic channels such as the collective decoherence channels, an important scenario that has been overlooked so far because of a lack of techniques.

quant-ph↗

arXiv2021

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 entropy of the system to equilibrium under a condition of spatial mixing of the stationary Gibbs states and the rapid decay of the relative entropy on finite-size blocks. Our result leads to the first examples of the positivity of the modified logarithmic Sobolev inequality for quantum lattice spin systems independently of the system size. Moreover, we show that our notion of spatial mixing is a consequence of the recent quantum generalization of Dobrushin and Shlosman's complete analyticity of the free-energy at equilibrium. The latter typically holds above a critical temperature Tc. Our results have wide-ranging applications in quantum information. As an illustration, we discuss four of them: first, using techniques of quantum optimal transport, we show that a quantum annealer subject to a finite range classical noise will output an energy close to that of the fixed point after constant annealing time. Second, we prove Gaussian concentration inequalities for Lipschitz observables and show that the eigenstate thermalization hypothesis holds for certain high-temperture Gibbs states. Third, we prove a finite blocklength refinement of the quantum Stein lemma for the task of asymmetric discrimination of two Gibbs states of commuting Hamiltonians satisfying our conditions. Fourth, in the same setting, our results imply the existence of a local quantum circuit of logarithmic depth to prepare Gibbs states of a class of commuting Hamiltonians.

quant-ph↗

arXiv2021

Energy-constrained discrimination of unitaries, quantum speed limits and a Gaussian Solovay-Kitaev theorem

We investigate the energy-constrained (EC) diamond norm distance between unitary channels acting on possibly infinite-dimensional quantum systems, and establish a number of results. Firstly, we prove that optimal EC discrimination between two unitary channels does not require the use of any entanglement. Extending a result by Acín, we also show that a finite number of parallel queries suffices to achieve zero error discrimination even in this EC setting. Secondly, we employ EC diamond norms to study a novel type of quantum speed limits, which apply to pairs of quantum dynamical semigroups. We expect these results to be relevant for benchmarking internal dynamics of quantum devices. Thirdly, we establish a version of the Solovay--Kitaev theorem that applies to the group of Gaussian unitaries over a finite number of modes, with the approximation error being measured with respect to the EC diamond norm relative to the photon number Hamiltonian.

quant-ph↗