Deterministic and Unambiguous Dense Coding

Optimal dense coding using a partially-entangled pure state of Schmidt rank $\bar D$ and a noiseless quantum channel of dimension $D$ is studied both in the deterministic case where at most $L_d$ messages can be transmitted with perfect fidelity, and in the unambiguous case where when the protocol succeeds (probability $\tau_x$) Bob knows for sure that Alice sent message $x$, and when it fails (probability $1-\tau_x$) he knows it has failed. Alice is allowed any single-shot (one use) encoding procedure, and Bob any single-shot measurement. For $\bar D\leq D$ a bound is obtained for $L_d$ in terms of the largest Schmidt coefficient of the entangled state, and is compared with published results by Mozes et al. For $\bar D > D$ it is shown that $L_d$ is strictly less than $D^2$ unless $\bar D$ is an integer multiple of $D$, in which case uniform (maximal) entanglement is not needed to achieve the optimal protocol. The unambiguous case is studied for $\bar D \leq D$, assuming $\tau_x>0$ for a set of $\bar D D$ messages, and a bound is obtained for the average \lgl1/\tau\rgl. A bound on the average \lgl\tau\rgl requires an additional assumption of encoding by isometries (unitaries when $\bar D=D$) that are orthogonal for different messages. Both bounds are saturated when $\tau_x$ is a constant independent of $x$, by a protocol based on one-shot entanglement concentration. For $\bar D > D$ it is shown that (at least) $D^2$ messages can be sent unambiguously. Whether unitary (isometric) encoding suffices for optimal protocols remains a major unanswered question, both for our work and for previous studies of dense coding using partially-entangled states, including noisy (mixed) states.Comment: Short new section VII added. Latex 23 pages, 1 PSTricks figure in tex

Maintenance of a gluten free diet in coeliac disease: The roles of self-regulation, habit, psychological resources, motivation, support, and goal priority

Introduction: A strict lifelong gluten free diet (GFD) is the only treatment for coeliac disease (CD). Theory-based research has focused predominantly on initiation, rational, and motivational processes in predicting adherence. The aim of this study was to evaluate an expanded collection of theoretical constructs specifically relevant to the maintenance of behaviour change, in the understanding and prediction of GFD adherence. Methods: Respondents with CD (N = 5573) completed measures of GFD adherence, psychological distress, intentions, self-efficacy, and the maintenance-relevant constructs of self-regulation, habit, temptation and intentional and unintentional lapses (cognitive and behavioural consequences of lowered or fluctuating psychological resources and self-control), motivation, social and environmental support, and goal priority, conflict, and facilitation. Correlations and multiple regression were used to determine their influence on adherence, over and above intention and self-efficacy, and how relationships changed in the presence of distress. Results: Better adherence was associated with greater self-regulation, habit, self-efficacy, priority, facilitation, and support; and lower psychological distress, conflict, and fewer self-control lapses (e.g., when busy/stressed). Autonomous and wellbeing-based, but not controlled motivations, were related to adherence. In the presence of distress, the influence of self-regulation and intentional lapses on adherence were increased, while temptation and unintentional lapses were decreased. Discussion: The findings point to the importance of considering intentional, volitional, automatic, and emotional processes in the understanding and prediction of GFD adherence. Behaviour change interventions and psychological support are now needed so that theoretical knowledge can be translated into evidence-based care, including a role for psychologists within the multi-disciplinary treatment team

Quantum Limits of Measurements Induced by Multiplicative Conservation Laws: Extension of the Wigner-Araki-Yanase Theorem

The Wigner-Araki-Yanase (WAY) theorem shows that additive conservation laws limit the accuracy of measurements. Recently, various quantitative expressions have been found for quantum limits on measurements induced by additive conservation laws, and have been applied to the study of fundamental limits on quantum information processing. Here, we investigate generalizations of the WAY theorem to multiplicative conservation laws. The WAY theorem is extended to show that an observable not commuting with the modulus of, or equivalently the square of, a multiplicatively conserved quantity cannot be precisely measured. We also obtain a lower bound for the mean-square noise of a measurement in the presence of a multiplicatively conserved quantity. To overcome this noise it is necessary to make large the coefficient of variation (the so-called relative fluctuation), instead of the variance as is the case for additive conservation laws, of the conserved quantity in the apparatus.Comment: 8 pages, REVTEX; typo added, to appear in PR

Local distinguishability of quantum states in infinite dimensional systems

We investigate local distinguishability of quantum states by use of the convex analysis about joint numerical range of operators on a Hilbert space. We show that any two orthogonal pure states are distinguishable by local operations and classical communications, even for infinite dimensional systems. An estimate of the local discrimination probability is also given for some family of more than two pure states

Quantum Ballistic Evolution in Quantum Mechanics: Application to Quantum Computers

Quantum computers are important examples of processes whose evolution can be described in terms of iterations of single step operators or their adjoints. Based on this, Hamiltonian evolution of processes with associated step operators $T$ is investigated here. The main limitation of this paper is to processes which evolve quantum ballistically, i.e. motion restricted to a collection of nonintersecting or distinct paths on an arbitrary basis. The main goal of this paper is proof of a theorem which gives necessary and sufficient conditions that T must satisfy so that there exists a Hamiltonian description of quantum ballistic evolution for the process, namely, that T is a partial isometry and is orthogonality preserving and stable on some basis. Simple examples of quantum ballistic evolution for quantum Turing machines with one and with more than one type of elementary step are discussed. It is seen that for nondeterministic machines the basis set can be quite complex with much entanglement present. It is also proved that, given a step operator T for an arbitrary deterministic quantum Turing machine, it is decidable if T is stable and orthogonality preserving, and if quantum ballistic evolution is possible. The proof fails if T is a step operator for a nondeterministic machine. It is an open question if such a decision procedure exists for nondeterministic machines. This problem does not occur in classical mechanics.Comment: 37 pages Latexwith 2 postscript figures tar+gzip+uuencoded, to be published in Phys. Rev.

Proposed direct test of a certain type of noncontextuality in quantum mechanics

The noncontextuality of quantum mechanics can be directly tested by measuring two entangled particles with more than two outcomes per particle. The two associated contexts are "interlinked" by common observables.Comment: 9 pages 2 figure

The chromosphere: gateway to the corona, or the purgatory of solar physics?

I argue that one should attempt to understand the solar chromosphere not only for its own sake, but also if one is interested in the physics of: the corona; astrophysical dynamos; space weather; partially ionized plasmas; heliospheric UV radiation; the transition region. I outline curious observations which I personally find puzzling and deserving of attention.Comment: To appear in the proceedings of the 25th NSO Workshop "Chromospheric Structure and Dynamics. From Old Wisdom to New Insights", Memorie della Societa' Astronomica Italiana, Eds. Tritschler et a

Influence of dissipation on the extraction of quantum states via repeated measurements

A quantum system put in interaction with another one that is repeatedly measured is subject to a non-unitary dynamics, through which it is possible to extract subspaces. This key idea has been exploited to propose schemes aimed at the generation of pure quantum states (purification). All such schemes have so far been considered in the ideal situations of isolated systems. In this paper, we analyze the influence of non-negligible interactions with environment during the extraction process, with the scope of investigating the possibility of purifying the state of a system in spite of the sources of dissipation. A general framework is presented and a paradigmatic example consisting of two interacting spins immersed in a bosonic bath is studied. The effectiveness of the purification scheme is discussed in terms of purity for different values of the relevant parameters and in connection with the bath temperature.Comment: 10 pages, 3 figure

Parameter-Independent Strategies for pMDPs via POMDPs

Markov Decision Processes (MDPs) are a popular class of models suitable for solving control decision problems in probabilistic reactive systems. We consider parametric MDPs (pMDPs) that include parameters in some of the transition probabilities to account for stochastic uncertainties of the environment such as noise or input disturbances. We study pMDPs with reachability objectives where the parameter values are unknown and impossible to measure directly during execution, but there is a probability distribution known over the parameter values. We study for the first time computing parameter-independent strategies that are expectation optimal, i.e., optimize the expected reachability probability under the probability distribution over the parameters. We present an encoding of our problem to partially observable MDPs (POMDPs), i.e., a reduction of our problem to computing optimal strategies in POMDPs. We evaluate our method experimentally on several benchmarks: a motivating (repeated) learner model; a series of benchmarks of varying configurations of a robot moving on a grid; and a consensus protocol.Comment: Extended version of a QEST 2018 pape