The maximum efficiency of nano heat engines depends on more than temperature

Sadi Carnot's theorem regarding the maximum efficiency of heat engines is considered to be of fundamental importance in thermodynamics. This theorem famously states that the maximum efficiency depends only on the temperature of the heat baths used by the engine, but not on the specific structure of baths. Here, we show that when the heat baths are finite in size, and when the engine operates in the quantum nanoregime, a revision to this statement is required. We show that one may still achieve the Carnot efficiency, when certain conditions on the bath structure are satisfied; however if that is not the case, then the maximum achievable efficiency can reduce to a value which is strictly less than Carnot. We derive the maximum efficiency for the case when one of the baths is composed of qubits. Furthermore, we show that the maximum efficiency is determined by either the standard second law of thermodynamics, analogously to the macroscopic case, or by the non increase of the max relative entropy, which is a quantity previously associated with the single shot regime in many quantum protocols. This relative entropic quantity emerges as a consequence of additional constraints, called generalized free energies, that govern thermodynamical transitions in the nanoregime. Our findings imply that in order to maximize efficiency, further considerations in choosing bath Hamiltonians should be made, when explicitly constructing quantum heat engines in the future. This understanding of thermodynamics has implications for nanoscale engineering aiming to construct small thermal machines.Comment: Main text 14 pages. Appendix 60 pages. Accepted in Journal Quantu

Knowledge-based vision for space station object motion detection, recognition, and tracking

Computer vision, especially color image analysis and understanding, has much to offer in the area of the automation of Space Station tasks such as construction, satellite servicing, rendezvous and proximity operations, inspection, experiment monitoring, data management and training. Knowledge-based techniques improve the performance of vision algorithms for unstructured environments because of their ability to deal with imprecise a priori information or inaccurately estimated feature data and still produce useful results. Conventional techniques using statistical and purely model-based approaches lack flexibility in dealing with the variabilities anticipated in the unstructured viewing environment of space. Algorithms developed under NASA sponsorship for Space Station applications to demonstrate the value of a hypothesized architecture for a Video Image Processor (VIP) are presented. Approaches to the enhancement of the performance of these algorithms with knowledge-based techniques and the potential for deployment of highly-parallel multi-processor systems for these algorithms are discussed

Entropic uncertainty relations and locking: tight bounds for mutually unbiased bases

We prove tight entropic uncertainty relations for a large number of mutually unbiased measurements. In particular, we show that a bound derived from the result by Maassen and Uffink for 2 such measurements can in fact be tight for up to sqrt{d} measurements in mutually unbiased bases. We then show that using more mutually unbiased bases does not always lead to a better locking effect. We prove that the optimal bound for the accessible information using up to sqrt{d} specific mutually unbiased bases is log d/2, which is the same as can be achieved by using only two bases. Our result indicates that merely using mutually unbiased bases is not sufficient to achieve a strong locking effect, and we need to look for additional properties.Comment: 9 pages, RevTeX, v3: complete rewrite, new title, many new results, v4: minor changes, published versio

A time-dependent Tsirelson's bound from limits on the rate of information gain in quantum systems

We consider the problem of distinguishing between a set of arbitrary quantum states in a setting in which the time available to perform the measurement is limited. We provide simple upper bounds on how well we can perform state discrimination in a given time as a function of either the average energy or the range of energies available during the measurement. We exhibit a specific strategy that nearly attains this bound. Finally, we consider several applications of our result. First, we obtain a time-dependent Tsirelson's bound that limits the extent of the Bell inequality violation that can be in principle be demonstrated in a given time t. Second, we obtain a Margolus-Levitin type bound when considering the special case of distinguishing orthogonal pure states.Comment: 15 pages, revtex, 1 figur

Work and reversibility in quantum thermodynamics

It is a central question in quantum thermodynamics to determine how irreversible is a process that transforms an initial state $\rho$ to a final state $\sigma$, and whether such irreversibility can be thought of as a useful resource. For example, we might ask how much work can be obtained by thermalizing $\rho$ to a thermal state $\sigma$ at temperature $T$ of an ambient heat bath. Here, we show that, for different sets of resource-theoretic thermodynamic operations, the amount of entropy produced along a transition is characterized by how reversible the process is. More specifically, this entropy production depends on how well we can return the state $\sigma$ to its original form $\rho$ without investing any work. At the same time, the entropy production can be linked to the work that can be extracted along a given transition, and we explore the consequences that this fact has for our results. We also exhibit an explicit reversal operation in terms of the Petz recovery channel coming from quantum information theory. Our result establishes a quantitative link between the reversibility of thermodynamical processes and the corresponding work gain.Comment: 14 page

A transform of complementary aspects with applications to entropic uncertainty relations

Even though mutually unbiased bases and entropic uncertainty relations play an important role in quantum cryptographic protocols they remain ill understood. Here, we construct special sets of up to 2n+1 mutually unbiased bases (MUBs) in dimension d=2^n which have particularly beautiful symmetry properties derived from the Clifford algebra. More precisely, we show that there exists a unitary transformation that cyclically permutes such bases. This unitary can be understood as a generalization of the Fourier transform, which exchanges two MUBs, to multiple complementary aspects. We proceed to prove a lower bound for min-entropic entropic uncertainty relations for any set of MUBs, and show that symmetry plays a central role in obtaining tight bounds. For example, we obtain for the first time a tight bound for four MUBs in dimension d=4, which is attained by an eigenstate of our complementarity transform. Finally, we discuss the relation to other symmetries obtained by transformations in discrete phase space, and note that the extrema of discrete Wigner functions are directly related to min-entropic uncertainty relations for MUBs.Comment: 16 pages, 2 figures, v2: published version, clarified ref [30

From Supermassive Black Holes to Dwarf Elliptical Nuclei: a Mass Continuum

Considerable evidence suggests that supermassive black holes reside at the centers of massive galactic bulges. At a lower galactic mass range, many dwarf galaxies contain extremely compact nuclei that structurally resemble massive globular clusters. We show that both these types of central massive objects (CMO's) define a single unbroken relation between CMO mass and the luminosity of their host galaxy spheroid. Equivalently, M_CMO is directly proportional to the host spheroid mass over 4 orders of magnitude. We note that this result has been simultaneously and independently identified by Cote et al. (2006), see also Ferrarese et al. (2006). We therefore suggest that the dE,N nuclei may be the low-mass analogs of supermassive black holes, and that these two types of CMO's may have both developed starting from similar initial formation processes. The overlap mass interval between the two types of CMO's is small, and suggests that for M_CMO > 10^7 M_sun, the formation of a black hole was strongly favored, perhaps because the initial gas infall to the center was too rapid and violent for star formation to occur efficiently.Comment: 4 pages, 2 figures, submitted to ApJ

Using deep autoencoders to investigate image matching in visual navigation

This paper discusses the use of deep autoencoder networks to find a compressed representation of an image, which can be used for visual naviga-tion. Images reconstructed from the compressed representation are tested to see if they retain enough information to be used as a visual compass (in which an image is matched with another to recall a bearing/movement direction) as this ability is at the heart of a visual route navigation algorithm. We show that both reconstructed images and compressed representations from different layers of the autoencoder can be used in this way, suggesting that a compact image code is sufficient for visual navigation and that deep networks hold promise for find-ing optimal visual encodings for this task

New Examples of Kochen-Specker Type Configurations on Three Qubits

A new example of a saturated Kochen-Specker (KS) type configuration of 64 rays in 8-dimensional space (the Hilbert space of a triple of qubits) is constructed. It is proven that this configuration has a tropical dimension 6 and that it contains a critical subconfiguration of 36 rays. A natural multicolored generalisation of the Kochen-Specker theory is given based on a concept of an entropy of a saturated configuration of rays.Comment: 24 page