Can Classical Noise Enhance Quantum Transmission?

A modified quantum teleportation protocol broadens the scope of the classical forbidden-interval theorems for stochastic resonance. The fidelity measures performance of quantum communication. The sender encodes the two classical bits for quantum teleportation as weak bipolar subthreshold signals and sends them over a noisy classical channel. Two forbidden-interval theorems provide a necessary and sufficient condition for the occurrence of the nonmonotone stochastic resonance effect in the fidelity of quantum teleportation. The condition is that the noise mean must fall outside a forbidden interval related to the detection threshold and signal value. An optimal amount of classical noise benefits quantum communication when the sender transmits weak signals, the receiver detects with a high threshold, and the noise mean lies outside the forbidden interval. Theorems and simulations demonstrate that both finite-variance and infinite-variance noise benefit the fidelity of quantum teleportation.Comment: 11 pages, 3 figures, replaced with published version that includes new section on imperfect entanglement and references to J. J. Ting's earlier wor

Consumer Choice and Information: New Experimental Evidence

This paper reports on a series of experiments designed to explore the so-called "information overload" hypothesis. We generally find that our subjects do quite well at screening out irrelevant information. Further, we find that a key element determining the quality of choices made by our subjects is the number of "salient" attributes, not just the number of attributes for which information is provided. Weak evidence is found which suggests a form of overload might occur when the number of salient dimensions is high and information is given on all of them. Finally, we discuss the implications of these results on the disclosure controversy

Optimal and Nonoptimal Satisficing I: A Model of 'Satisfactory' Choice

In this paper the authors report the results of a series of individual choice experiments designed to test the usefulness of a particular theory of satisficing and of conjunctive choice models. Several authors have argued that modeling complicated choice problems by using a conjunctive approach can provide useful simplifications. In fact optimal behavior with these models can involve implementation of extremely complicated strategies. The experiments reported deal with multidimensional search problems structured so that the conjunctive model is appropriate. Four groups of subjects performed the same tasks with similar results. In general, subjects' behavior conforms well to predictions based on optimization and where there is systematic deviation they are consistent with a specific theory of satisficing

Quantum Algorithms for Testing Hamiltonian Symmetry

Symmetries in a Hamiltonian play an important role in quantum physics because they correspond directly with conserved quantities of the related system. In this paper, we propose quantum algorithms capable of testing whether a Hamiltonian exhibits symmetry with respect to a group. We demonstrate that familiar expressions of Hamiltonian symmetry in quantum mechanics correspond directly with the acceptance probabilities of our algorithms. We execute one of our symmetry-testing algorithms on existing quantum computers for simple examples of both symmetric and asymmetric cases.Comment: 11 pages, 3 figures Comments welcome! Revision comment: New results adde

Geothermal probabilistic cost study

A tool is presented to quantify the risks of geothermal projects, the Geothermal Probabilistic Cost Model (GPCM). The GPCM model was used to evaluate a geothermal reservoir for a binary-cycle electric plant at Heber, California. Three institutional aspects of the geothermal risk which can shift the risk among different agents was analyzed. The leasing of geothermal land, contracting between the producer and the user of the geothermal heat, and insurance against faulty performance were examined

Renyi generalizations of the conditional quantum mutual information

The conditional quantum mutual information $I(A;B|C)$ of a tripartite state $\rho_{ABC}$ is an information quantity which lies at the center of many problems in quantum information theory. Three of its main properties are that it is non-negative for any tripartite state, that it decreases under local operations applied to systems $A$ and $B$, and that it obeys the duality relation $I(A;B|C)=I(A;B|D)$ for a four-party pure state on systems $ABCD$. The conditional mutual information also underlies the squashed entanglement, an entanglement measure that satisfies all of the axioms desired for an entanglement measure. As such, it has been an open question to find R\'enyi generalizations of the conditional mutual information, that would allow for a deeper understanding of the original quantity and find applications beyond the traditional memoryless setting of quantum information theory. The present paper addresses this question, by defining different $\alpha$-R\'enyi generalizations $I_{\alpha}(A;B|C)$ of the conditional mutual information, some of which we can prove converge to the conditional mutual information in the limit $\alpha\rightarrow1$. Furthermore, we prove that many of these generalizations satisfy non-negativity, duality, and monotonicity with respect to local operations on one of the systems $A$ or $B$ (with it being left as an open question to prove that monotoniticity holds with respect to local operations on both systems). The quantities defined here should find applications in quantum information theory and perhaps even in other areas of physics, but we leave this for future work. We also state a conjecture regarding the monotonicity of the R\'enyi conditional mutual informations defined here with respect to the R\'enyi parameter $\alpha$. We prove that this conjecture is true in some special cases and when $\alpha$ is in a neighborhood of one.Comment: v6: 53 pages, final published versio

Fluctuations of the local density of states probe localized surface plasmons on disordered metal films

We measure the statistical distribution of the local density of optical states (LDOS) on disordered semi-continuous metal films. We show that LDOS fluctuations exhibit a maximum in a regime where fractal clusters dominate the film surface. These large fluctuations are a signature of surface-plasmon localization on the nanometer scale

Testing symmetry on quantum computers

Symmetry is a unifying concept in physics. In quantum information and beyond, it is known that quantum states possessing symmetry are not useful for certain information-processing tasks. For example, states that commute with a Hamiltonian realizing a time evolution are not useful for timekeeping during that evolution, and bipartite states that are highly extendible are not strongly entangled and thus not useful for basic tasks like teleportation. Motivated by this perspective, this paper details several quantum algorithms that test the symmetry of quantum states and channels. For the case of testing Bose symmetry of a state, we show that there is a simple and efficient quantum algorithm, while the tests for other kinds of symmetry rely on the aid of a quantum prover. We prove that the acceptance probability of each algorithm is equal to the maximum symmetric fidelity of the state being tested, thus giving a firm operational meaning to these latter resource quantifiers. Special cases of the algorithms test for incoherence or separability of quantum states. We evaluate the performance of these algorithms on choice examples by using the variational approach to quantum algorithms, replacing the quantum prover with a parameterized circuit. We demonstrate this approach for numerous examples using the IBM quantum noiseless and noisy simulators, and we observe that the algorithms perform well in the noiseless case and exhibit noise resilience in the noisy case. We also show that the maximum symmetric fidelities can be calculated by semi-definite programs, which is useful for benchmarking the performance of these algorithms for sufficiently small examples. Finally, we establish various generalizations of the resource theory of asymmetry, with the upshot being that the acceptance probabilities of the algorithms are resource monotones and thus well motivated from the resource-theoretic perspective.Comment: v3: 51 pages, 41 figures, 31 tables, final version accepted for publication in Quantum Journa