Zobrazeno 1 - 10
of 34
pro vyhledávání: '"Hack, Pedro"'
Belief Propagation (BP) decoders for quantum error correcting codes are not always precise. There is a growing interest in the application of tensor networks to quantum error correction in general and, in particular, in degenerate quantum maximum lik
Externí odkaz:
http://arxiv.org/abs/2411.04957
Autor:
Hack, Pedro
The study of intelligent systems explains behaviour in terms of economic rationality. This results in an optimization principle involving a function or utility, which states that the system will evolve until the configuration of maximum utility is ac
Externí odkaz:
http://arxiv.org/abs/2406.10730
Autor:
Hack, Pedro, Mendl, Christian B.
Elementary thermal operations are thermal operations that act non-trivially on at most two energy levels of a system at the same time. They were recently introduced in order to bring thermal operations closer to experimental feasibility. A key questi
Externí odkaz:
http://arxiv.org/abs/2312.11223
The application of thermodynamic reasoning in the study of learning systems has a long tradition. Recently, new tools relating perfect thermodynamic adaptation to the adaptation process have been developed. These results, known as fluctuation theorem
Externí odkaz:
http://arxiv.org/abs/2209.00941
Majorization is a fundamental model of uncertainty with several applications in areas ranging from thermodynamics to entanglement theory, and constitutes one of the pillars of the resource-theoretic approach to physics. Here, we improve on its relati
Externí odkaz:
http://arxiv.org/abs/2207.11059
Computability on uncountable sets has no standard formalization, unlike that on countable sets, which is given by Turing machines. Some of the approaches to define computability in these sets rely on order-theoretic structures to translate such notio
Externí odkaz:
http://arxiv.org/abs/2206.14484
Although there is a somewhat standard formalization of computability on countable sets given by Turing machines, the same cannot be said about uncountable sets. Among the approaches to define computability in these sets, order-theoretic structures ha
Externí odkaz:
http://arxiv.org/abs/2206.13885
The well-known notion of dimension for partial orders by Dushnik and Miller allows to quantify the degree of incomparability and, thus, is regarded as a measure of complexity for partial orders. However, despite its usefulness, its definition is some
Externí odkaz:
http://arxiv.org/abs/2203.16272
The study of complexity and optimization in decision theory involves both partial and complete characterizations of preferences over decision spaces in terms of real-valued monotones. With this motivation, and following the recent introduction of new
Externí odkaz:
http://arxiv.org/abs/2202.12106
We define common thermodynamic concepts purely within the framework of general Markov chains and derive Jarzynski's equality and Crooks' fluctuation theorem in this setup. In particular, we regard the discrete time case that leads to an asymmetry in
Externí odkaz:
http://arxiv.org/abs/2202.05576