CACina Aghamohammadi

Cina Aghamohammadi

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Cina Aghamohammadi has a total of 6 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Not All Fluctuations Are Created Equal: Spontaneous Variations in Thermodynamic Function

    by James P. Crutchfield, Cina Aghamohammadi

    We identify macroscopic functioning arising during a thermodynamic system’s typical and atypical behaviors, thereby describing system operations over the entire set of fluctuations. We show how to use the information processing second law to determine functionality for atypical realizations and how to calculate the probability of distinct modalities occurring via the large-deviation rate function, extended to include highly correlated, memoryful environments and systems. Altogether, the results complete a theory of functional fluctuations for complex thermodynamic nanoscale systems operating over finite periods. In addition to constructing the distribution of functional modalities, one immediate consequence is a cautionary lesson: ascribing a single, unique functional modality to a thermodynamic system, especially one on the nanoscale, can be misleading, likely masking an array of simultaneous, parallel thermodynamic transformations that together may also be functional. In this way, functional fluctuation theory alters how we conceive of the operation of biological cellular processes, the goals of engineering design, and the robustness of evolutionary adaptation.


  • Optimizing Quantum Models of Classical Channels: The Reverse Holevo Problem

    by Samuel P. Loomis, John R. Mahoney, Cina Aghamohammadi, James P. Crutchfield


  • Open Access

    Optimizing Quantum Models of Classical Channels: The reverse Holevo problem

    by S. Loomis, J. R. Mahoney, C. Aghamohammadi, J. P. Crutchfield

    Given a classical channel---a stochastic map from inputs to outputs---the input can often be transformed to an intermediate variable that is informationally smaller than the input. The new channel accurately simulates the original but at a smaller transmission rate. Here, we examine this procedure when the intermediate variable is a quantum state. We determine when and how well quantum simulations of classical channels may improve upon the minimal rates of classical simulation. This inverts Holevo's original question of quantifying the capacity of quantum channels with classical resources. We also show that this problem is equivalent to another, involving the local generation of a distribution from common entanglement.

  • Open Access

    Extreme Quantum Memory Advantage for Rare-Event Sampling

    by Cina Aghamohammadi, Samuel P. Loomis, John R. Mahoney, James P. Crutchfield

    We introduce a quantum algorithm for memory-efficient biased sampling of rare events generated by classical memoryful stochastic processes. Two efficiency metrics are used to compare quantum and classical resources for rare-event sampling. For a fixed stochastic process, the first is the classical-to-quantum ratio of required memory. We show for two example processes that there exists an infinite number of rare-event classes for which the memory ratio for sampling is larger than r, for any large real number r. Then, for a sequence of processes each labeled by an integer size N, we compare how the classical and quantum required memories scale with N. In this setting, since both memories can diverge as N→∞, the efficiency metric tracks how fast they diverge. An extreme quantum memory advantage exists when the classical memory diverges in the limit N→∞, but the quantum memory has a finite bound. We then show that finite-state Markov processes and spin chains exhibit memory advantage for sampling of almost all of their rare-event classes.


  • Open Access

    Extreme Quantum Advantage for Rare-Event Sampling

    by C. Aghamohammadi, S. P. Loomis, J. R. Mahoney, J. P. Crutchfield

    We introduce a quantum algorithm for efficient biased sampling of the rare events generated by classical memoryful stochastic processes. We show that this quantum algorithm gives an extreme advantage over known classical biased sampling algorithms in terms of the memory resources required. The quantum memory advantage ranges from polynomial to exponential and when sampling the rare equilibrium configurations of spin systems the quantum advantage diverges.

  • Open Access

    Extreme Quantum Advantage when Simulating Classical Systems with Long-Range Interaction

    by Cina Aghamohammadi, John R. Mahoney, James P. Crutchfield

    Classical stochastic processes can be generated by quantum simulators instead of the more standard classical ones, such as hidden Markov models. One reason for using quantum simulators has recently come to the fore: they generally require less memory than their classical counterparts. Here, we examine this quantum advantage for strongly coupled spin systems—in particular, the Dyson one-dimensional Ising spin chain with variable interaction length. We find that the advantage scales with both interaction range and temperature, growing without bound as interaction range increases. In particular, simulating Dyson’s original spin chain with the most memory-efficient classical algorithm known requires infinite memory, while a quantum simulator requires only finite memory. Thus, quantum systems can very efficiently simulate strongly coupled one-dimensional classical spin systems.


  • Open Access

    Thermodynamics of random number generation

    by Cina Aghamohammadi, James P. Crutchfield

    We analyze the thermodynamic costs of the three main approaches to generating random numbers via the recently introduced Information Processing Second Law. Given access to a specified source of randomness, a random number generator (RNG) produces samples from a desired target probability distribution. This differs from pseudorandom number generators (PRNGs) that use wholly deterministic algorithms and from true random number generators (TRNGs) in which the randomness source is a physical system. For each class, we analyze the thermodynamics of generators based on algorithms implemented as finite-state machines, as these allow for direct bounds on the required physical resources. This establishes bounds on heat dissipation and work consumption during the operation of three main classes of RNG algorithms—including those of von Neumann, Knuth, and Yao and Roche and Hoshi—and for PRNG methods. We introduce a general TRNG and determine its thermodynamic costs exactly for arbitrary target distributions. The results highlight the significant differences between the three main approaches to random number generation: One is work producing, one is work consuming, and the other is potentially dissipation neutral. Notably, TRNGs can both generate random numbers and convert thermal energy to stored work. These thermodynamic costs on information creation complement Landauer's limit on the irreducible costs of information destruction.


  • Open Access

    Minimum memory for generating rare events

    by Cina Aghamohammadi, James P. Crutchfield

    We classify the rare events of structured, memoryful stochastic processes and use this to analyze sequential and parallel generators for these events. Given a stochastic process, we introduce a method to construct a process whose typical realizations are a given process' rare events. This leads to an expression for the minimum memory required to generate rare events. We then show that the recently discovered classical-quantum ambiguity of simplicity also occurs when comparing the structure of process fluctuations.


  • Open Access

    Thermodynamics of Random Number Generation

    by C. Aghamohammadi, J. P. Crutchfield

    We analyze the thermodynamic costs of the three main approaches to generating random numbers via the recently introduced Information Processing Second Law. Given access to a specified source of randomness, a random number generator (RNG) produces samples from a desired target probability distribution. This differs from pseudorandom number generators (PRNG) that use wholly deterministic algorithms and from true random number generators (TRNG) in which the randomness source is a physical system. For each class, we analyze the thermodynamics of generators based on algorithms implemented as finite-state machines, as these allow for direct bounds on the required physical resources. This establishes bounds on heat dissipation and work consumption during the operation of three main classes of RNG algorithms---including those of von Neumann, Knuth and Yao, and Roche and Hoshi---and for PRNG methods. We introduce a general TRNG and determine its thermodynamic costs exactly for arbitrary target distributions. The results highlight the significant differences between the three main approaches to random number generation: One is work producing, one is work consuming, and the other is potentially dissipation neutral. Notably, TRNGs can both generate random numbers and convert thermal energy to stored work. These thermodynamic costs on information creation complement Landauer's limit on the irreducible costs of information destruction.

  • Open Access

    Not All Fluctuations are Created Equal: Spontaneous Variations in Thermodynamic Function

    by James P. Crutchfield, Cina Aghamohammadi

    Almost all processes -- highly correlated, weakly correlated, or correlated not at all---exhibit statistical fluctuations. Often physical laws, such as the Second Law of Thermodynamics, address only typical realizations -- as highlighted by Shannon's asymptotic equipartition property and as entailed by taking the thermodynamic limit of an infinite number of degrees of freedom. Indeed, our interpretations of the functioning of macroscopic thermodynamic cycles are so focused. Using a recently derived Second Law for information processing, we show that different subsets of fluctuations lead to distinct thermodynamic functioning in Maxwellian Demons. For example, while typical realizations may operate as an engine -- converting thermal fluctuations to useful work -- even "nearby" fluctuations (nontypical, but probable realizations) behave differently, as Landauer erasers -- converting available stored energy to dissipate stored information. One concludes that ascribing a single, unique functional modality to a thermodynamic system, especially one on the nanoscale, is at best misleading, likely masking an array of simultaneous, parallel thermodynamic transformations. This alters how we conceive of cellular processes, engineering design, and evolutionary adaptation.