Journal: Entropy

Loading...

Abbreviation

Entropy

Publisher

MDPI

Journal Volumes

ISSN

1099-4300

Description

Search Results

Publications 1 - 10 of 50
  • Lapidoth, Amos; Yan, Yiming (2022)
    Entropy
    The listsize capacity is computed for the Gaussian channel with a helper that—cognizant of the channel-noise sequence but not of the transmitted message—provides the decoder with a rate-limited description of said sequence. This capacity is shown to equal the sum of the cutoff rate of the Gaussian channel without help and the rate of help. In particular, zero-rate help raises the listsize capacity from zero to the cutoff rate. This is achieved by having the helper provide the decoder with a sufficiently fine quantization of the normalized squared Euclidean norm of the noise sequence.
  • Sobol, Alexander; Güntert, Peter; Riek, Roland (2021)
    Entropy
    A one-dimensional gas comprising N point particles undergoing elastic collisions within a finite space described by a Sinai billiard generating identical dynamical trajectories are calculated and analyzed with regard to strict extensivity of the entropy definitions of Boltzmann–Gibbs. Due to the collisions, trajectories of gas particles are strongly correlated and exhibit both chaotic and periodic properties. Probability distributions for the position of each particle in the one-dimensional gas can be obtained analytically, elucidating that the entropy in this special case is extensive at any given number N. Furthermore, the entropy obtained can be interpreted as a measure of the extent of interactions between molecules. The results obtained for the non-mixable one-dimensional system are generalized to mixable one- and two-dimensional systems, the latter by a simple example only providing similar findings.
  • Riek, Roland; Chatterjee, Atanu (2021)
    Entropy
    Causality describes the process and consequences from an action: a cause has an effect. Causality is preserved in classical physics as well as in special and general theories of relativity. Surprisingly, causality as a relationship between the cause and its effect is in neither of these theories considered a law or a principle. Its existence in physics has even been challenged by prominent opponents in part due to the time symmetric nature of the physical laws. With the use of the reduced action and the least action principle of Maupertuis along with a discrete dynamical time physics yielding an arrow of time, causality is defined as the partial spatial derivative of the reduced action and as such is position- and momentum-dependent and requests the presence of space. With this definition the system evolves from one step to the next without the need of time, while (discrete) time can be reconstructed.
  • Wang, Yongqi; Hutter, Kolumban (2018)
    Entropy
  • Miyashita, Shuhei; Nagy, Zoltán; Nelson, Bradley J.; et al. (2009)
    Entropy
    Self-assembly is a key phenomenon whereby vast numbers of individual components passively interact and form organized structures, as can be seen, for example, in the morphogenesis of a virus. Generally speaking, the process can be viewed as a spatial placement of attractive and repulsive components. In this paper, we report on an investigation of how morphology, i.e., the shape of components, affects a self-assembly process. The experiments were conducted with 3 differently shaped floating tiles equipped with magnets in an agitated water tank. We propose a novel measure involving clustering coefficients, which qualifies the degree of parallelism of the assembly process. The results showed that the assembly processes were affected by the aggregation sequence in their early stages, where shape induces different behaviors and thus results in variations in aggregation speeds.
  • Küng, Bruno; Gustavsson, Simon; Choi, Theodore; et al. (2010)
    Entropy
    Charge sensing with quantum point-contacts (QPCs) is a technique widely used in semiconductor quantum-dot research. Understanding the physics of this measurement process, as well as finding ways of suppressing unwanted measurement back-action, are therefore both desirable. In this article, we present experimental studies targeting these two goals. Firstly, we measure the effect of a QPC on electron tunneling between two InAs quantum dots, and show that a model based on the QPC’s shot-noise can account for it. Secondly, we discuss the possibility of lowering the measurement current (and thus the back-action) used for charge sensing by correlating the signals of two independent measurement channels. The performance of this method is tested in a typical experimental setup.
  • Stoop, Ruedi; Gomez, Florian (2022)
    Entropy
    In the neighborhood of critical states, distinct materials exhibit the same physical behavior, expressed by common simple laws among measurable observables, hence rendering a more detailed analysis of the individual systems obsolete. It is a widespread view that critical states are fundamental to neuroscience and directly favor computation. We argue here that from an evolutionary point of view, critical points seem indeed to be a natural phenomenon. Using mammalian hearing as our example, we show, however, explicitly that criticality does not describe the proper computational process and thus is only indirectly related to the computation in neural systems.
  • Schweitzer, Frank; Behera, Laxmidhar (2015)
    Entropy
    Non-linear voter models assume that the opinion of an agent depends on the opinions of its neighbors in a non-linear manner. This allows for voting rules different from majority voting. While the linear voter model is known to reach consensus, non-linear voter models can result in the coexistence of opposite opinions. Our aim is to derive approximations to correctly predict the time dependent dynamics, or at least the asymptotic outcome, of such local interactions. Emphasis is on a probabilistic approach to decompose the opinion distribution in a second-order neighborhood into lower-order probability distributions. This is compared with an analytic pair approximation for the expected value of the global fraction of opinions and a mean-field approximation. Our reference case is averaged stochastic simulations of a one-dimensional cellular automaton. We find that the probabilistic second-order approach captures the dynamics of the reference case very well for different non-linearities, i.e., for both majority and minority voting rules, which only partly holds for the first-order pair approximation and not at all for the mean-field approximation. We further discuss the interesting phenomenon of a correlated coexistence, characterized by the formation of large domains of opinions that dominate for some time, but slowly change.
  • Aloy, Albert; Müller-Rigat, Guillem; Tura, Jordi; et al. (2024)
    Entropy
    We present strategies to derive Bell inequalities valid for systems composed of many three-level parties. This scenario is formalized by a Bell experiment with N observers, each of which performs one out of two possible three-outcome measurements on their share of the system. As the complexity of the set of classical correlations prohibits its full characterization in this multipartite scenario, we consider its projection to a lower-dimensional subspace spanned by permutationally invariant one- and two-body observables. This simplification allows us to formulate two complementary methods for detecting nonlocality in multipartite three-level systems, both having a complexity independent of N. Our work can have interesting applications in the detection of Bell correlations in paradigmatic spin-1 models, as well as in experiments with solid-state systems or atomic ensembles.
  • John, Manuel; Schuhmacher, Julian; Barkoutsos, Panagiotis; et al. (2023)
    Entropy
    The discovery of quantum algorithms offering provable advantages over the best known classical alternatives, together with the parallel ongoing revolution brought about by classical artificial intelligence, motivates a search for applications of quantum information processing methods to machine learning. Among several proposals in this domain, quantum kernel methods have emerged as particularly promising candidates. However, while some rigorous speedups on certain highly specific problems have been formally proven, only empirical proof-of-principle results have been reported so far for real-world datasets. Moreover, no systematic procedure is known, in general, to fine tune and optimize the performances of kernel-based quantum classification algorithms. At the same time, certain limitations such as kernel concentration effects-hindering the trainability of quantum classifiers-have also been recently pointed out. In this work, we propose several general-purpose optimization methods and best practices designed to enhance the practical usefulness of fidelity-based quantum classification algorithms. Specifically, we first describe a data pre-processing strategy that, by preserving the relevant relationships between data points when processed through quantum feature maps, substantially alleviates the effect of kernel concentration on structured datasets. We also introduce a classical post-processing method that, based on standard fidelity measures estimated on a quantum processor, yields non-linear decision boundaries in the feature Hilbert space, thus achieving the quantum counterpart of the radial basis functions technique that is widely employed in classical kernel methods. Finally, we apply the so-called quantum metric learning protocol to engineer and adjust trainable quantum embeddings, demonstrating substantial performance improvements on several paradigmatic real-world classification tasks.
Publications 1 - 10 of 50