1,781 research outputs found
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.Comment: 31 page
PlantCARE, a plant cis-acting regulatory element database
PlantCARE is a database of plant cis-acting regulatory elements, enhancers and repressors. Besides the transcription motifs found on a sequence, it also offers a link to the EMBL entry that contains the full gene sequence as well as a description of the conditions in which a motif becomes functional. The information on these sites is given by matrices, consensus and individual site sequences on particular genes, depending on the available information
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\"ormander 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
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.Comment: 35 pages, 2 figures. Close to published versio
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 -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 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
qudits forming -approximate -designs in relative entropy for
times scaling as .Comment: v2: results are improved and added. In particular asymptotically
tighter bounds are provided in Section 5. Two new sections (Section 6 and 7)
contain examples including transferred sub-Laplacians, quantum Kac generators
and approximate designs. v3: minor corrections with new title and abstrac
Limitations of local update recovery in stabilizer-GKP codes: a quantum optimal transport approach
Local update recovery seeks to maintain quantum information by applying local
correction maps alternating with and compensating for the action of noise.
Motivated by recent constructions based on quantum LDPC codes in the
finite-dimensional setting, we establish an analytic upper bound on the
fault-tolerance threshold for concatenated GKP-stabilizer codes with local
update recovery. Our bound applies to noise channels that are tensor products
of one-mode beamsplitters with arbitrary environment states, capturing, in
particular, photon loss occurring independently in each mode. It shows that for
loss rates above a threshold given explicitly as a function of the locality of
the recovery maps, encoded information is lost at an exponential rate. This
extends an early result by Razborov from discrete to continuous variable (CV)
quantum systems.
To prove our result, we study a metric on bosonic states akin to the
Wasserstein distance between two CV density functions, which we call the
bosonic Wasserstein distance. It can be thought of as a CV extension of a
quantum Wasserstein distance of order 1 recently introduced by De Palma et al.
in the context of qudit systems, in the sense that it captures the notion of
locality in a CV setting. We establish several basic properties, including a
relation to the trace distance and diameter bounds for states with finite
average photon number. We then study its contraction properties under quantum
channels, including tensorization, locality and strict contraction under
beamsplitter-type noise channels. Due to the simplicity of its formulation, and
the established wide applicability of its finite-dimensional counterpart, we
believe that the bosonic Wasserstein distance will become a versatile tool in
the study of CV quantum systems.Comment: 30 pages, 2 figure
- âŠ