Show newer

Quantum dichotomies and coherent thermodynamics beyond first-order asymptotics. (arXiv:2303.05524v1 [quant-ph]) arxiv.org/abs/2303.05524

Quantum dichotomies and coherent thermodynamics beyond first-order asymptotics

We address the problem of exact and approximate transformation of quantum dichotomies in the asymptotic regime, i.e., the existence of a quantum channel $\mathcal E$ mapping $ρ_1^{\otimes n}$ into $ρ_2^{\otimes R_nn}$ with an error $ε_n$ (measured by trace distance) and $σ_1^{\otimes n}$ into $σ_2^{\otimes R_n n}$ exactly, for a large number $n$. We derive second-order asymptotic expressions for the optimal transformation rate $R_n$ in the small, moderate, and large deviation error regimes, as well as the zero-error regime, for an arbitrary pair $(ρ_1,σ_1)$ of initial states and a commuting pair $(ρ_2,σ_2)$ of final states. We also prove that for $σ_1$ and $σ_2$ given by thermal Gibbs states, the derived optimal transformation rates in the first three regimes can be attained by thermal operations. This allows us, for the first time, to study the second-order asymptotics of thermodynamic state interconversion with fully general initial states that may have coherence between different energy eigenspaces. Thus, we discuss the optimal performance of thermodynamic protocols with coherent inputs and describe three novel resonance phenomena allowing one to significantly reduce transformation errors induced by finite-size effects. What is more, our result on quantum dichotomies can also be used to obtain, up to second-order asymptotic terms, optimal conversion rates between pure bipartite entangled states under local operations and classical communication.

arxiv.org

BRST Cohomology is Lie Algebroid Cohomology. (arXiv:2303.05540v1 [hep-th]) arxiv.org/abs/2303.05540

BRST Cohomology is Lie Algebroid Cohomology

In this paper we demonstrate that the exterior algebra of an Atiyah Lie algebroid generalizes the familiar notions of the physicist's BRST complex. To reach this conclusion, we develop a general picture of Lie algebroid morphisms as commutative diagrams between algebroids preserving the geometric structure encoded in their brackets. We illustrate that a necessary and sufficient condition for such a diagram to define a morphism is that the two algebroids possess gauge-equivalent connections. This observation indicates that the set of Lie algebroid morphisms should be regarded as equivalent to the set of local diffeomorphisms and gauge transformations. Moreover, a Lie algebroid morphism being a chain map in the exterior algebra sense ensures that morphic algebroids are cohomologically equivalent. The Atiyah Lie algebroids derived from principal bundles with common base manifolds and structure groups may therefore be divided into equivalence classes of morphic algebroids. Each equivalence class possesses a representative which we refer to as the trivialized Lie algebroid, and we show that the exterior algebra of the trivialized algebroid gives rise to the BRST complex. We conclude by illustrating the usefulness of Lie algebroid cohomology in computing quantum anomalies. In particular, we pay close attention to the fact that the geometric intuition afforded by the Lie algebroid (which was absent in the naive BRST complex) provides hints of a deeper picture that simultaneously geometrizes the consistent and covariant forms of the anomaly. In the algebroid construction, the difference between the consistent and covariant anomalies is simply a different choice of basis.

arxiv.org

Robustly Complete Finite-State Abstractions for Control Synthesis of Stochastic Systems. (arXiv:2303.05566v1 [eess.SY]) arxiv.org/abs/2303.05566

Robustly Complete Finite-State Abstractions for Control Synthesis of Stochastic Systems

The essential step of abstraction-based control synthesis for nonlinear systems to satisfy a given specification is to obtain a finite-state abstraction of the original systems. The complexity of the abstraction is usually the dominating factor that determines the efficiency of the algorithm. For the control synthesis of discrete-time nonlinear stochastic systems modelled by nonlinear stochastic difference equations, recent literature has demonstrated the soundness of abstractions in preserving robust probabilistic satisfaction of ω-regular lineartime properties. However, unnecessary transitions exist within the abstractions, which are difficult to quantify, and the completeness of abstraction-based control synthesis in the stochastic setting remains an open theoretical question. In this paper, we address this fundamental question from the topological view of metrizable space of probability measures, and propose constructive finite-state abstractions for control synthesis of probabilistic linear temporal specifications. Such abstractions are both sound and approximately complete. That is, given a concrete discrete-time stochastic system and an arbitrarily small L1-perturbation of this system, there exists a family of finite-state controlled Markov chains that both abstracts the concrete system and is abstracted by the slightly perturbed system. In other words, given an arbitrarily small prescribed precision, an abstraction always exists to decide whether a control strategy exists for the concrete system to satisfy the probabilistic specification.

arxiv.org

Fairer Shootouts in Soccer: The $m-n$ Rule. (arXiv:2303.04807v1 [econ.TH]) arxiv.org/abs/2303.04807

Fairer Shootouts in Soccer: The $m-n$ Rule

Winning the coin toss at the end of a tied soccer game gives a team the right to choose whether to kick either first or second on all five rounds of penalty kicks, when each team is allowed one kick per round. There is considerable evidence that the right to make this choice, which is usually to kick first, gives a team a significant advantage. To make the outcome of a tied game fairer, we suggest a rule that handicaps the team that kicks first (A), requiring it to succeed on one more penalty kick than the team that kicks second (B). We call this the $m - n$ rule and, more specifically, propose $(m, n)$ = (5, 4): For A to win, it must successfully kick 5 goals before the end of the round in which B kicks its 4th; for B to win, it must succeed on 4 penalty kicks before A succeeds on 5. If both teams reach (5, 4) on the same round -- when they both kick successfully at (4, 3) -- then the game is decided by round-by-round "sudden death," whereby the winner is the first team to score in a subsequent round when the other team does not. We show that this rule is fair in tending to equalize the ability of each team to win a tied game in a penalty shootout. We also discuss a related rule that precludes the teams from reaching (5, 4) at the same time, obviating the need for sudden death and extra rounds.

arxiv.org

The Impact of Coherence Diversity on MIMO Relays. (arXiv:2303.04840v1 [cs.IT]) arxiv.org/abs/2303.04840

The Impact of Coherence Diversity on MIMO Relays

This paper studies MIMO relays with non-identical link coherence times, a frequently occurring condition when, e.g., the nodes in the relay channel do not all have the same mobility, or the scatterers around some nodes have different mobility compared with those around other nodes. Despite its practical relevance, this condition, known as coherence diversity, has not been studied in the relay channel. This paper studies the performance of MIMO relays and proposes efficient transmission strategies under coherence diversity. Since coherence times have a prominent impact on channel training, we do not assume channel state is available to the decoder for free; all channel training resources are accounted for in the calculations. A product superposition technique is employed at the source, which allows a more efficient usage of degrees of freedom when the relay and the destination have different training requirements. Varying configurations of coherence times are studied. The interesting case where the different link coherence intervals are not a multiple of each other, and therefore the coherence intervals do not align, is studied. Relay scheduling is combined with the product superposition to obtain further gains in degrees of freedom. The impact of coherence diversity is further studied in the presence of multiple parallel relays.

arxiv.org

Step-by-step derivation of the algebraic structure of quantum mechanics (or from nondisturbing to quantum correlations by connecting incompatible observables). (arXiv:2303.04847v1 [quant-ph]) arxiv.org/abs/2303.04847

Step-by-step derivation of the algebraic structure of quantum mechanics (or from nondisturbing to quantum correlations by connecting incompatible observables)

Recently there has been much interest in deriving the quantum formalism and the set of quantum correlations from simple axioms. In this paper, we provide a step-by-step derivation of the quantum formalism that tackles both these problems and helps us to understand why this formalism is as it is. We begin with a structureless system that only includes real-valued observables, states and a (not specified) state update, and we gradually identify theory-independent conditions that make the algebraic structure of quantum mechanics be assimilated by it. In the first part of the paper, we derive essentially all the "commutative part" of the quantum formalism, i.e., all definitions and theorems that do not involve algebraic operations between incompatible observables, such as projections, Specker's principle, and the spectral theorem; at the statistical level, the system is nondisturbing and satisfies the exclusivity principle at this stage. In the second part of the paper, we connect incompatible observables by taking transition probabilities between pure states into account. This connection is the final step needed to embed our system in a Hilbert space and to go from nondisturbing to quantum correlations.

arxiv.org

Computational Spectral Imaging: A Contemporary Overview. (arXiv:2303.04848v1 [cs.IT]) arxiv.org/abs/2303.04848

Computational Spectral Imaging: A Contemporary Overview

Spectral imaging collects and processes information along spatial and spectral coordinates quantified in discrete voxels, which can be treated as a 3D spectral data cube. The spectral images (SIs) allow identifying objects, crops, and materials in the scene through their spectral behavior. Since most spectral optical systems can only employ 1D or maximum 2D sensors, it is challenging to directly acquire the 3D information from available commercial sensors. As an alternative, computational spectral imaging (CSI) has emerged as a sensing tool where the 3D data can be obtained using 2D encoded projections. Then, a computational recovery process must be employed to retrieve the SI. CSI enables the development of snapshot optical systems that reduce acquisition time and provide low computational storage costs compared to conventional scanning systems. Recent advances in deep learning (DL) have allowed the design of data-driven CSI to improve the SI reconstruction or, even more, perform high-level tasks such as classification, unmixing, or anomaly detection directly from 2D encoded projections. This work summarises the advances in CSI, starting with SI and its relevance; continuing with the most relevant compressive spectral optical systems. Then, CSI with DL will be introduced, and the recent advances in combining the physical optical design with computational DL algorithms to solve high-level tasks.

arxiv.org
Show older
Qoto Mastodon

QOTO: Question Others to Teach Ourselves
An inclusive, Academic Freedom, instance
All cultures welcome.
Hate speech and harassment strictly forbidden.