اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدCycle Flux Ranking of Network Analysis in Quantum Thermal Device
71
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Manipulating quantum thermal transport relies on uncovering the principle working cycles of quantum devices. Here, we apply the cycle flux ranking of network analysis to nonequilibrium thermal devices described by graphs of quantum state transitions. To excavate the principal mechanism out of complex transport behaviors, we decompose the quantum-transition network into cycles, calculate the cycle flux by algebraic graph theory, and pick out the dominant cycles with top-ranked fluxes, i.e., the cycle trajectories with highest probabilities. We demonstrate the cycle flux ranking in typical quantum device models, such as a thermal-drag spin-Seebeck pump, and a quantum thermal transistor as thermal switch or heat amplifier. The dominant cycle trajectories indeed elucidate the principal working mechanisms of those quantum devices. The cycle flux analysis provides an alternative perspective that naturally describes the working cycle corresponding to the main functionality of quantum thermal devices, which would further guide the device optimization with desired performance
قيم البحث
اقرأ أيضاً
We present a quantum algorithm for ranking the nodes on a network in their order of importance. The algorithm is based on a directed discrete-time quantum walk, and works on all directed networks. This algorithm can theoretically be applied to the en
tire internet, and thus can function as a quantum PageRank algorithm. Our analysis shows that the hierarchy of quantum rank matches well with the hierarchy of classical rank for directed tree network and for non-trivial cyclic networks, the hierarchy of quantum ranks do not exactly match to the hierarchy of the classical rank. This highlights the role of quantum interference and fluctuations in networks and the importance of using quantum algorithms to rank nodes in quantum networks. Another application this algorithm can envision is to model the dynamics on networks mimicking the chemical complexes and rank active centers in order of reactivities. Since discrete-time quantum walks are implementable on current quantum processing systems, this algorithm will also be of practical relevance in analysis of quantum architecture.
Theoretical treatments of periodically-driven quantum thermal machines (PD-QTMs) are largely focused on the limit-cycle stage of operation characterized by a periodic state of the system. Yet, this regime is not immediately accessible for experimenta
l verification. Here, we present a general thermodynamic framework that can handle the performance of PD-QTMs both before and during the limit-cycle stage of operation. It is achieved by observing that periodicity may break down at the ensemble average level, even in the limit-cycle phase. With this observation, and using conventional thermodynamic expressions for work and heat, we find that a complete description of the first law of thermodynamics for PD-QTMs requires a new contribution, which vanishes only in the limit-cycle phase under rather weak system-bath couplings. Significantly, this contribution is substantial at strong couplings even at limit cycle, thus largely affecting the behavior of the thermodynamic efficiency. We demonstrate our framework by simulating a quantum Otto engine building upon a driven resonant level model. Our results provide new insights towards a complete description of PD-QTMs, from turn-on to the limit-cycle stage and, particularly, shed light on the development of quantum thermodynamics at strong coupling.
Community detection helps us simplify the complex configuration of networks, but communities are reliable only if they are statistically significant. To detect statistically significant communities, a common approach is to resample the original netwo
rk and analyze the communities. But resampling assumes independence between samples, while the components of a network are inherently dependent. Therefore, we must understand how breaking dependencies between resampled components affects the results of the significance analysis. Here we use scientific communication as a model system to analyze this effect. Our dataset includes citations among articles published in journals in the years 1984-2010. We compare parametric resampling of citations with non-parametric article resampling. While citation resampling breaks link dependencies, article resampling maintains such dependencies. We find that citation resampling underestimates the variance of link weights. Moreover, this underestimation explains most of the differences in the significance analysis of ranking and clustering. Therefore, when only link weights are available and article resampling is not an option, we suggest a simple parametric resampling scheme that generates link-weight variances close to the link-weight variances of article resampling. Nevertheless, when we highlight and summarize important structural changes in science, the more dependencies we can maintain in the resampling scheme, the earlier we can predict structural change.
We study the impact of finite-size effects on the key rate of continuous-variable (CV) measurement-device-independent (MDI) quantum key distribution (QKD). Inspired by the parameter estimation technique developed in [Rupert textit{et al.} Phys. Rev.
A textbf{90}, 062310 (2014)]~we adapt it to study CV-MDI-QKD and, assuming realistic experimental conditions, we analyze the impact of finite-size effects on the key rate. We find that, increasing the block-size, the performance of the protocol converges towards the ideal one, and that block-sizes between $10^{6}$ and $10^{9}$ data points can already provide a key rate $sim10^{-2}$ bit/use over metropolitan distances.
Quantum repeater networks have attracted attention for the implementation of long-distance and large-scale sharing of quantum states. Recently, researchers extended classical network coding, which is a technique for throughput enhancement, into quant
um information. The utility of quantum network coding (QNC) has been shown under ideal conditions, but it has not been studied previously under conditions of noise and shortage of quantum resources. We analyzed QNC on a butterfly network, which can create end-to-end Bell pairs at twice the rate of the standard quantum network repeater approach. The joint fidelity of creating two Bell pairs has a small penalty for QNC relative to entanglement swapping. It will thus be useful when we care more about throughput than fidelity. We found that the output fidelity drops below 0.5 when the initial Bell pairs have fidelity F < 0.90, even with perfect local gates. Local gate errors have a larger impact on quantum network coding than on entanglement swapping.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
