SearcharxivSearch

arXiv subjects

Nicholas LaRacuente

Publications and source records attributed to Nicholas LaRacuente.

16 recordsLinked to original sources

Self-restricting Noise and Exponential Relative Entropy Decay Under Unital Quantum Markov Semigroups

States of open quantum systems often decay continuously under environmental interactions. Quantum Markov semigroups model such processes in dissipative environments. It is known that finite-dimensional quantum Markov semigroups with GNS detailed balance universally obey complete modified logarithmic Sobolev inequalities (CMLSIs), yielding exponential decay of relative entropy to a subspace of fixed point states. We analyze continuous processes that combine dissipative with Hamiltonian time-evolution, precluding this notion of detailed balance. First, we find counterexamples to CMLSI-like decay for these processes and determine conditions under which it fails. In contrast, we prove that despite its absence at early times, exponential decay re-appears for unital, finite-dimensional quantum Markov semigroups at finite timescales. Finally, we show that when dissipation is much stronger than Hamiltonian time-evolution, the rate of eventual, exponential decay toward the semigroup's decoherence-free subspace is bounded inversely in the decay rate of the dissipative part alone. Dubbed self-restricting noise, this inverse relationship arises when strong damping suppresses effects that would otherwise spread noise beyond its initial subspace.

quant-ph

Approximate Unitary $k$-Designs from Shallow, Low-Communication Circuits

Random unitaries are useful in quantum information and related fields, but hard to generate with limited resources. An approximate unitary $k$-design is an ensemble of unitaries with an underlying measure over which the average is close to a Haar random ensemble up to the first $k$ moments. A particularly strong notion of approximation bounds the distance from Haar randomness in relative error. Such relative-error approximate designs are secure against queries by an adaptive adversary trying to distinguish it from a Haar ensemble. We construct relative-error approximate unitary $k$-design ensembles for which communication between subsystems is $O(1)$ in the system size. These constructions use the alternating projection method to analyze overlapping Haar averages, giving a bound on the convergence speed to the full averaging with respect to the $2$-norm. Using von Neumann subalgebra indices to replace system dimension, the 2-norm distance converts to relative error without introducing any additional dimension dependence. We use these constructions as the building blocks of a two-step protocol that achieves a relative-error design in $O \big ( (\log m + \log(1/ε) + k \log k ) k\, \text{polylog}(k) \big )$ depth, where $m$ is the number of qudits in the complete system and $ε$ the approximation error. This sublinear depth construction answers a variant of [Harrow and Mehraban 2023, Section 1.5, Open Questions 1 and 7]. Moreover, entanglement generated by the sublinear depth scheme follows area laws on spatial lattices up to corrections logarithmic in the full system size.

quant-ph

Modeling Short-Range Microwave Networks to Scale Superconducting Quantum Computation

A core challenge for superconducting quantum computers is to scale up the number of qubits in each processor without increasing noise or cross-talk. Distributed quantum computing across small qubit arrays, known as chiplets, can address these challenges in a scalable manner. We propose a chiplet architecture over microwave links with potential to exceed monolithic performance on near-term hardware. Our methods of modeling and evaluating the chiplet architecture bridge the physical and network layers in these processors. We find evidence that distributing computation across chiplets may reduce the overall error rates associated with moving data across the device, despite higher error figures for transfers across links. Preliminary analyses suggest that latency is not substantially impacted, and that at least some applications and architectures may avoid bottlenecks around chiplet boundaries. In the long-term, short-range networks may underlie quantum computers just as local area networks underlie classical datacenters and supercomputers today.

quant-ph

Relative entropy decay and complete positivity mixing time

We prove that the complete modified logarithmic Sobolev constant of a quantum Markov semigroup is bounded by the inverse of its complete positivity mixing time. For classical Markov semigroups, this implies that every sub-Laplacian given by a Hörmander system on a compact manifold satisfies a uniform modified log-Sobolev inequality for matrix-valued functions. For quantum Markov semigroups, we obtain that the complete modified logarithmic Sobolev constant is comparable to spectral gap up to a constant as logarithm of dimension constant. This estimate is asymptotically tight for a quantum birth-death process. Our results and the consequence of concentration inequalities apply to GNS-symmetric semigroups on general von Neumann algebras.

quant-ph

Entropy Uncertainty Relations and Strong Sub-additivity of Quantum Channels

We prove an entropic uncertainty relation for two quantum channels, extending the work of Frank and Lieb for quantum measurements. This is obtained via a generalized strong super-additivity (SSA) of quantum entropy. Motivated by Petz's algebraic SSA inequality, we also obtain a generalized SSA for quantum relative entropy. As a special case, it gives an improved data processing inequality.

quant-ph

Quasi-factorization and Multiplicative Comparison of Subalgebra-Relative Entropy

Purely multiplicative comparisons of quantum relative entropy are desirable but challenging to prove. We show such comparisons for relative entropies between comparable densities, including the relative entropy of a density with respect to its subalgebraic restriction. These inequalities are asymptotically tight in approaching known, tight inequalities as perturbation size approaches zero. Based on these results, we obtain a kind of inequality known as quasi-factorization or approximate tensorization of relative entropy. Quasi-factorization lower bounds the sum of a density's relative entropies to several subalgebraic restrictions in terms of its relative entropy to their intersection's subalgebraic restriction. As applications, quasi-factorization implies uncertainty-like relations, and with an iteration trick, it yields decay estimates of optimal asymptotic order on mixing processes described by finite, connected, undirected graphs.

quant-ph

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

Quantum Oracle Separations from Complex but Easily Specified States

A foundational question in quantum computational complexity asks how much more useful a quantum state can be in a given task than a comparable, classical string. Aaronson and Kuperberg showed such a separation in the presence of a quantum oracle, a black box unitary callable during quantum computation. Their quantum oracle responds to a random, marked, quantum state, which is intractable to specify classically. We constrain the marked state in ways that make it easy to specify classically while retaining separations in task complexity. Our method replaces query by state complexity. Furthermore, assuming a widely believed separation between the difficulty of creating a random, complex state and creating a specified state, we propose an experimental demonstration of quantum witness advantage on near-term, distributed quantum computers. Finally, using the fact that a standard, classically defined oracle may enable a quantum algorithm to prepare an otherwise hard state in polynomial steps, we observe quantum-classical oracle separation in heavy output sampling.

quant-ph

Multivariate Trace Inequalities, p-Fidelity, and Universal Recovery Beyond Tracial Settings

Trace inequalities are general techniques with many applications in quantum information theory, often replacing classical functional calculus in noncommutative settings. The physics of quantum field theory and holography, however, motivate entropy inequalities in type III von Neumann algebras that lack a semifinite trace. The Haagerup and Kosaki $L_p$ spaces enable re-expressing trace inequalities in non-tracial von Neumann algebras. In particular, we show this for the generalized Araki-Lieb-Thirring and Golden-Thompson inequalities from (Sutter, Berta \& Tomamichel 2017). Then, using the Haagerup approximation method, we prove a general von Neumann algebra version of univeral recovery map corrections to the data processing inequality for relative entropy. We also show subharmonicity of a logarithmic p-fidelity of recovery. Furthermore, we prove that non-decrease of relative entropy is equivalent to existence of an $L_1$-isometry implementing the channel on both input states.

quant-ph

Graph Hörmander Systems

This paper extends the Bakry-Émery theorem connecting the Ricci curvature and log-Sobolev inequalities to the matrix-valued setting. Using tools from noncommuative geometry, it is shown that for a right invariant second order differential operator on a compact Lie group, a lower bound for a matrix-valued modified log-Sobolev inequality is equivalent to a uniform lower bound for all finite dimensional representations. Using combinatorial tools, we obtain computable lower bounds for matrix-valued log-Sobolev inequalities of graph-Hörmander systems using combinatorial methods.

math-ph

Stability of logarithmic Sobolev inequalities under a noncommutative change of measure

We generalize Holley-Stroock's perturbation argument from commutative to quantum Markov semigroups. As a consequence, results on (complete) modified logarithmic Sobolev inequalities and logarithmic Sobolev inequalities for self-adjoint quantum Markov process can be used to prove estimates on the exponential convergence in relative entropy of quantum Markov systems which preserve a fixed state. This leads to estimates for the decay to equilibrium for coupled systems and to estimates for mixed state preparation times using Lindblad operators. Our techniques also apply to discrete time settings, where we show that the strong data processing inequality constant of a quantum channel can be controlled by that of a corresponding unital channel.

quant-ph

Relative entropy for von Neumann subalgebras

We revisit the connection between index and relative entropy for an inclusion of finite von Neumann algebras. We observe that the Pimsner-Popa index connects to sandwiched Renyi $p$-relative entropy for all $1/2\le p\le \infty$, including Umegaki's relative entropy at $p=1$. Based on that, we introduce a new notation of relative entropy to a subalgebra which generalizes subfactors index. This relative entropy has application in estimating decoherence time of quantum Markov semigroups.

math.OA

Unifying Entanglement with Uncertainty via Symmetries of Observable Algebras

Strong subadditivity goes beyond the tensored subsystem and commuting operator models. As previously noted by Petz and later by Araki and Moriya, two subalgebras of observables satisfy a generalized SSA-like inequality if they form a commuting square. We explore the interpretation and consequences in finite dimensions, connecting various entropic uncertainty relations for mutually unbiased bases with the positivity of a generalized conditional mutual information (CMI), and with inequalities on relative entropies of coherence and asymmetry. We obtain a bipartite resource theory of operations under which the two subalgebras are respectively invariant and covariant, with CMI as a monotone, and generalized non-classical monotones based on squashed entanglement and entanglement of formation. Free transformations support conversion between entanglement and uncertainty-based configurations, as "EPR <-> 2UCR." Our theory quantifies the common non-classicality in entanglement and uncertainty, implying a strong conceptual link between these fundamentally quantum phenomena.

quant-ph

Capacity Estimates via comparison with TRO channels

A ternary ring of operators (TRO) in finite dimensions is a diagonal sum of spaces of rectangular matrices. TRO as operator space corresponds to quantum channels that are diagonal sums of partial traces, which we call TRO channels. TRO channels admits simple, single-letter capacity formula. Using operator space and complex interpolation techniques, we give perturbative capacities estimates for a wider class of quantum channels by comparison to TRO channels. Our estimates applies mainly for quantum and private capacity and also strong converse rates. The examples includes random unitary from group representations which in general are non-degradable channels.

quant-ph

Heralded Channel Holevo Superadditivity Bounds from Entanglement Monogamy

We show that for a particular class of quantum channels, which we call heralded channels, monogamy of squashed entanglement limits the superadditivity of Holevo capacity. Heralded channels provide a means to understand the quantum erasure channel composed with an arbitrary other quantum channel, as well as common situations in experimental quantum information that involve frequent loss of qubits or failure of trials. We also show how entanglement monogamy applies to non-classicality in quantum games, and we consider how faithful, monogamous entanglement measures may bound other entanglement-dependent quantities in many-party scenarios.

quant-ph

Capacity Bounds via Operator Space Methods

Quantum capacity, as the ultimate transmission rate of quantum communication, is characterized by regularized coherent information. In this work, we reformulate approximations of the quantum capacity by operator space norms and give both upper and lower bounds on quantum capacity, and potential quantum capacity using interpolation techniques. We identify a situation in which nice classes of channels satisfy a "comparison property" on entropy, coherent information and capacities. The paradigms for our estimates are so-called conditional expectations. These generally non-degradable channels admit a strongly additive expression for $Q^{(1)}$. We also identify conditions on channels showing that the "hashing bound" is optimal for the cb-entropy. These two estimates combined give upper and lower bounds on quantum capacity on our "nice" classes of channels, which differ only up to a factor 2, independent of the dimension. The estimates are discussed for certain classes of channels, including group channels, Pauli channels and other high-dimensional channels.

quant-ph