It is known that the maximum classical mutual information, which can be achieved between measurements on pairs of quantum systems, can drastically underestimate the quantum mutual information between them. In this article, we quantify this distinction between classical and quantum information by demonstrating that after removing a logarithmic-sized quantum system from one half of a pair of perfectly correlated bitstrings, even the most sensitive pair of measurements might yield only outcomes essentially independent of each other. This effect is a form of information locking but the definition we use is strictly stronger than those used previously. Moreover, we find that this property is generic, in the sense that it occurs when removing a random subsystem. As such, the effect might be relevant to statistical mechanics or black hole physics. While previous works had always assumed a uniform message, we assume only a min-entropy bound and also explore the effect of entanglement. We find that classical information is strongly locked almost until it can be completely decoded. Finally, we exhibit a quantum key distribution protocol that is 'secure' in the sense of accessible information but in which leakage of even a logarithmic number of bits compromises the secrecy of all others.

In previous research, older adults show greater emotional benefits from distracting themselves than from reappraising an event when strategically regulating emotion. Older adults also demonstrate an attentional preference to avoid, while younger adults show a bias toward approaching negative stimuli. This suggests a possible age-related differentiation of cognitive effort across approach and avoidance of negative stimuli during emotion regulation. In this study, we tracked cognitive effort via pupil dilation during the use of distraction (avoidance) and reappraisal (approach) strategies across age. Forty-eight younger adults (M = 20.94, SD = 1.78; 19 men) and 48 older adults (M = 68.82, SD = 5.40; 15 men) viewed a slideshow of negative images and were instructed to distract, reappraise, or passively view each image. Older adults showed greater pupil dilation during reappraisal than distraction, but younger adults displayed no difference between conditions-an effect that survived when controlling for gaze patterns. Gaze findings revealed that older adults looked less within images during active emotion regulation compared with passive viewing (no difference between distraction and reappraisal), and younger adults showed no difference across strategies. Younger adults gazed less within the most emotional image areas during distraction, but this did not significantly contribute to pupil response. Our findings support that distraction is less cognitively effortful than reinterpreting negative information in later life. These findings could be explained by older adults' motivational bias to disengage from negative information because of the age-related positivity effect, or compensation for decreased working memory resources across the life span. (PsycINFO Database Record

It is known that the maximum classical mutual information, which can be achieved between measurements on pairs of quantum systems, can drastically underestimate the quantum mutual information between them. In this article, we quantify this distinction between classical and quantum information by demonstrating that after removing a logarithmic-sized quantum system from one half of a pair of perfectly correlated bitstrings, even the most sensitive pair of measurements might yield only outcomes essentially independent of each other. This effect is a form of information locking but the definition we use is strictly stronger than those used previously. Moreover, we find that this property is generic, in the sense that it occurs when removing a random subsystem. As such, the effect might be relevant to statistical mechanics or black hole physics. While previous works had always assumed a uniform message, we assume only a min-entropy bound and also explore the effect of entanglement. We find that classical information is strongly locked almost until it can be completely decoded. Finally, we exhibit a quantum key distribution protocol that is 'secure' in the sense of accessible information but in which leakage of even a logarithmic number of bits compromises the secrecy of all others.

It is known that any two-outcome quantum measurement can be decomposed into a continuous stochastic process using a feedback loop. In this article, we characterize which of these decompositions are possible when each iteration of the feedback loop consists of a weak measurement caused by an interaction with a probe system. We restrict ourselves to the case when the probe is a qubit and the interaction Hamiltonian between the probe and system is constant. We find that even given the ability to perform arbitrary unitary pulses throughout the continuous decomposition, only generalized measurements with two distinct singular values are achievable. However, this is sufficient to decompose a generalized qubit measurement using a qubit probe and a simple interaction Hamiltonian.

We characterize the set of generalized quantum measurements that can be decomposed into a continuous measurement process using a stream of probe qubits and a tunable interaction Hamiltonian. Each probe in the stream interacts weakly with the target quantum system, then is measured projectively in a standard basis. This measurement result is used in a closed feedback loop to tune the interaction Hamiltonian for the next probe. The resulting evolution is a stochastic process with the structure of a one-dimensional random walk. To maintain this structure, and require that at long times the measurement outcomes be independent of the path, the allowed interaction Hamiltonians must lie in a restricted set, such that the Hamiltonian terms on the target system form a finite dimensional Jordan algebra. This algebraic structure of the interaction Hamiltonians yields a large class of generalized measurements that can be continuously performed by our scheme, and we fully describe this set.