Work extraction from a heat engine in a cycle by a quantum mechanical device (quantum piston) is analyzed. The standard definition of work fails in the quantum domain. The correct extractable work and its efficiency bound are shown to crucially depend on the initial quantum state of the piston. The transient efficiency bound may exceed the standard Carnot bound, although it complies with the second law. Energy gain (e.g. in lasing) is shown to drastically differ from work gain.
Quantum theory allows for randomness generation in a device-independent setting, where no detailed description of the experimental device is required. Here we derive a general upper bound on the amount of randomness that can be generated in such a setting. Our bound applies to any black-box scenario, thus covering a wide range of scenarios from partially characterised to completely uncharacterised devices. Specifically, we prove that the number of random bits that can be generated is limited by the number of different input states that enter the measurement device. We show explicitly that our bound is tight in the simplest case. More generally, our work indicates that the prospects of generating a large amount of randomness by using high-dimensional (or even continuous variable) systems will be extremely challenging in practice.
We identify that quantum coherence is a valuable resource in the quantum heat engine, which is designed in a quantum thermodynamic cycle assisted by a quantum Maxwells demon. This demon is in a superposed state. The quantum work and heat are redefined as the sum of coherent and incoherent parts in the energy representation. The total quantum work and the corresponding efficiency of the heat engine can be enhanced due to the coherence consumption of the demon. In addition, we discuss an universal information heat engine driven by quantum coherence. The extractable work of this heat engine is limited by the quantum coherence, even if it has no classical thermodynamic cost. This resource-driven viewpoint provides a direct and effective way to clarify the thermodynamic processes where the coherent superposition of states cannot be ignored.
The thermodynamic properties of quantum heat engines are stochastic owing to the presence of thermal and quantum fluctuations. We here experimentally investigate the efficiency and nonequilibrium entropy production statistics of a spin-1/2 quantum Otto cycle. We first study the correlations between work and heat within a cycle by extracting their joint distribution for different driving times. We show that near perfect anticorrelation, corresponding to the tight-coupling condition, can be achieved. In this limit, the reconstructed efficiency distribution is peaked at the macroscopic efficiency and fluctuations are strongly suppressed. We further test the second law in the form of a joint fluctuation relation for work and heat. Our results characterize the statistical features of a small-scale thermal machine in the quantum domain and provide means to control them.
We consider the production of charmed baryons and mesons in the proton-antiproton binary reactions at the energies of the future $bar{P}$ANDA experiment. To describe these processes in terms of hadronic interaction models, one needs strong couplings of the initial nucleons with the intermediate and final charmed hadrons. Similar couplings enter the models of binary reactions with strange hadrons. For both charmed and strange hadrons we employ the strong couplings and their ratios calculated from QCD light-cone sum rules. In this method finite masses of $c$ and $s$ quarks are taken into account. Employing the Kaidalovs quark-gluon string model with Regge poles and adjusting the normalization of the amplitudes in this model to the calculated strong couplings, we estimate the production cross section of charmed hadrons. For $pbar{p}to Lambda_cbar{Lambda}_c$ it can reach several tens of $nb$ at $p_{lab}= 15 {GeV}$, whereas the cross sections of $Sigma_c$ and $D$ pair production are predicted to be smaller.
This paper gives a simple proof of why a quantum computer, despite being in all possible states simultaneously, needs at least 0.707 sqrt(N) queries to retrieve a desired item from an unsorted list of items. The proof is refined to show that a quantum computer would need at least 0.785 sqrt(N) queries. The quantum search algorithm needs precisely this many queries.