arXiv subjects

Abolfazl Ramezanpour

Publications and source records attributed to Abolfazl Ramezanpour.

At least 19 recordsLinked to original sources

arXiv2026

Noise tolerance via reinforcement in the quantum search problem

The Grover lower bound for the unstructured search problem can be surpassed when some information about the data structure is available. Here, we numerically observe that reinforcement can exponentially reduce the number of required evolution layers from $\sqrt{D}$ to $\ln D$ in a $D$-dimensional system, by exploiting the information provided by the quantum state. Therefore, a reinforced quantum search is expected to exhibit a larger noise threshold compared to a standard search algorithm in a noisy environment. We use numerical simulations to characterize the level of noise tolerance via reinforcement in the presence of both coherent and incoherent noise, considering a system of $N$ qubits and a single $D$-level (qudit) system. Our results show that reinforcement significantly enhances the algorithm's success probability and improves the scaling of the number of reinforced evolution layers with system size. These findings indicate that reinforcement offers a promising strategy for error mitigation, especially when a precise noise model is unavailable.

quant-ph↗

arXiv2026

Distance from home matters: Investigation of a basic movement strategy

Discovering the fundamental dynamical rules that generate the main statistical features of human mobility is essential for understanding the mechanisms underlying such processes. A prominent example is the exploration and preferential return model and its generalizations, which successfully reproduce several empirical findings. Here, we exploit another observation: the endpoint distances of a trip from the trajectory's starting point are strongly correlated. We consider a movement process in which each user performs a sequence of trips to satisfy a set of demands, given a spatial distribution of suppliers on a two-dimensional lattice. In each trip, destinations are chosen with a probability that depends on the ratio of the initial and final distances from the user's origin (home). We show that even a single agent with uniformly distributed demands and suppliers qualitatively reproduces key empirical statistics, such as the power-law distribution of traveled distances. The results are also robust to introducing interactions between agents via queues and incorporating more realistic demand and supplier distributions.

physics.soc-ph↗

arXiv2026

Optimal transport by a Lagrangian dynamics of population distribution

Human mobility, enabled by diverse transportation modes, is fundamental to urban functionality. Studying these movements across scales-from microscopic to macroscopic-yields valuable insights into urban dynamics. Local adaptation and (self-)organization in such systems are expected to result in dynamical behaviors that are represented by stationary trajectories of an appropriate effective action. In this study we develop a Lagrangian dynamical model for movement processes, using local population functions as the coordinate variables. An efficient gradient descent algorithm is introduced to estimate the optimal Lagrangian parameters minimizing a local error function of the dynamical process. We show that even a quadratic Lagrangian, incorporating dissipation, effectively captures the dynamics of synthetic and empirical movement data. The inferred models reveal that inertia and dissipation are of comparable importance, while interactions and randomness in the movements induce significant qualitative changes in model parameters. Our results provide an interpretable and generative model for human mobility, with potential applications in movement prediction.

cond-mat.dis-nn↗

arXiv2025

Noise tolerance via reinforcement: Learning a reinforced quantum dynamics

The performance of quantum simulations heavily depends on the efficiency of noise mitigation techniques and error correction algorithms. Reinforcement has emerged as a powerful strategy to enhance the efficiency of learning and optimization algorithms. In this study, we demonstrate that a reinforced quantum dynamics can exhibit significant robustness against interactions with a noisy environment. We study a quantum annealing process where, through reinforcement, the system is encouraged to maintain its current state or follow a noise-free evolution. A learning algorithm is employed to derive a concise approximation of this reinforced dynamics, reducing the total evolution time and, consequently, the system's exposure to noisy interactions. This also avoids the complexities associated with implementing quantum feedback in such reinforcement algorithms. The efficacy of our method is demonstrated through numerical simulations of reinforced quantum annealing with one- and two-qubit systems under Pauli noise.

quant-ph↗

arXiv2024

Messenger size optimality in cellular communications

Living cells presumably employ optimized information transfer methods, enabling efficient communication even in noisy environments. As expected, the efficiency of chemical communications between cells depends on the properties of the molecular messenger. Evidence suggests that proteins from narrow ranges of molecular masses have been naturally selected to mediate cellular communications, yet the underlying communication design principles are not understood. Using a simple physical model that considers the cost of chemical synthesis, diffusion, molecular binding, and degradation, we show that optimal mass values exist that ensure efficient communication of various types of signals. Our findings provide insights into the design principles of biological communications and can be used to engineer chemically communicating biomimetic systems.

physics.bio-ph↗

arXiv2024

Efficiency of energy-consuming random walkers: Variability in energy helps

Energy considerations can significantly affect the behavior of a population of energy-consuming agents with limited energy budgets, for instance, in the movement process of people in a city. We consider a population of interacting agents with an initial energy budget walking on a graph according to an exploration and return (to home) strategy that is based on the current energy of the person. Each move reduces the available energy depending on the flow of movements and the strength of interactions, and the movement ends when an agent returns home with a negative energy. We observe that a uniform distribution of initial energy budgets results in a larger number of visited sites per consumed energy (efficiency) compared to case that all agents have the same initial energy if return to home is relevant from the beginning of the process. The uniform energy distribution also reduces the amount of uncertainties in the total travel times (entropy production) which is more pronounced when the strength of interactions and exploration play the relevant role in the movement process. That is variability in the energies can help to increase the efficiency and reduce the entropy production specially in presence of strong interactions.

cond-mat.dis-nn↗

arXiv2024

Loop corrections for hard spheres in Hamming space

We begin with an exact expression for the entropy of a system of hard spheres within the Hamming space. This entropy relies on probability marginals, which are determined by an extended set of Belief Propagation (BP) equations. The BP probability marginals are functions of auxiliary variables which are introduced to model the effects of loopy interactions on a tree-structured interaction graph. We explore various reasonable and approximate probability distributions, ensuring they align with the exact solutions of the BP equations. Our approach is based on an ansatz of (in)homogeneous cavity marginals respecting the permutation symmetry of the problem. Through thorough analysis, we aim to minimize errors in the BP equations. Our findings support the conjecture that the maximum packing density asymptotically conforms to the lower bound proposed by Gilbert and Varshamov, further validated by the solution of the loopy BP equations.

cond-mat.dis-nn↗

arXiv2022

Quantum walk in a reinforced free-energy landscape: Quantum annealing with reinforcement

Providing an optimal path to a quantum annealing algorithm is key to finding good approximate solutions to computationally hard optimization problems. Reinforcement is one of the strategies that can be used to circumvent the exponentially small energy gaps of the system in the annealing process. Here a time-dependent reinforcement term is added to the Hamiltonian in order to give lower energies to the most probable states of the evolving system. In this study, we take a local entropy in the configuration space for the reinforcement and apply the algorithm to a number of easy and hard optimization problems. The reinforced algorithm performs better than the standard quantum annealing algorithm in the quantum search problem, where the optimal parameters behave very differently depending on the number of solutions. Moreover, the reinforcements can change the discontinuous phase transitions of the mean-field p-spin model ($p>2$) to a continuous transition. The algorithm's performance in the binary perceptron problem is also superior to that of the standard quantum annealing algorithm, which already works better than a classical simulated annealing algorithm.

cond-mat.dis-nn↗

arXiv2021

Entropy production of selfish drivers: Implications for efficiency and predictability of movements in a city

Characterizing the efficiency of movements is important for a better management of the cities. More specifically, the connection between the efficiency and uncertainty (entropy) production of a transport process is not established yet. In this study, we consider the movements of selfish drivers from their homes (origins) to work places (destinations) to see how interactions and randomness in the movements affect a measure of efficiency and entropy production (uncertainty in the destination time intervals) in this process. We employ realistic models of population distributions and mobility laws to simulate the movement process, where interactions are modelled by dependence of the local travel times on the local flows. We observe that some level of information (the travel times) sharing enhances a measure of predictability in the process without any coordination. Moreover, the larger cities display smaller efficiencies, for the same model parameters and population density, which limits the size of an efficient city. We find that entropy production is a good order parameter to distinguish the low- and high-congestion phases. In the former phase, the entropy production grows monotonically with the probability of random moves, whereas it displays a minimum in the congested phase; that is randomness in the movements can reduce the uncertainty in the destination time intervals. The findings highlight the role of entropy production in the study of efficiency and predictability of similar processes in a complex system like the city.

physics.soc-ph↗

arXiv2020

Efficiency and irreversibility of movements in a city

We know that maximal efficiency in physical systems is attained by reversible processes. It is then interesting to see how irreversibility affects efficiency in other systems, e.g., in a city. In this study, we focus on a cyclic process of movements (home to workplace and back to home) in a city to investigate the above question. To this end, we present a minimal model of the movements, along with plausible definitions for the efficiency and irreversibility of the process; more precisely, we take the inverse of the total travel time per number of trips for efficiency and the relative entropy of the forward and backward flow distributions for the process irreversibility. We perform numerical simulations of the model for reasonable choices of the population distribution, the mobility law, and the movement strategy. The results show that the efficiency of movements is indeed negatively correlated with the above measure of irreversibility. The structure of the network and the impact of the flows on the travel times are the main factors here that affect the time intervals of arriving to destinations and returning to origins, which are usually larger than the time interval of the departures. This in turn gives rise to diverging of the backward flows from the forward ones and results to entropy (disorder or uncertainty) production in the system. The findings of this study might be helpful in characterizing more accurately the city efficiency and in better understanding of the main working principles of these complex systems.

physics.soc-ph↗

arXiv2019

Noisy Toric code and random bond Ising model: The error threshold in a dual picture

It is known that noisy topological quantum codes are related to random bond Ising models where the order-disorder phase transition in the classical model is mapped to the error threshold of the corresponding topological code. On the other hand, there is a dual mapping between classical spin models and quantum Calderbank-Shor-Stean (CSS) states where the partition function of a classical model defined on a hypergraph $H$ is written as an inner product of a product state and a CSS state on dual hypergraph $\tilde{H}$. It is then interesting to see what is the interpretation of the classical phase transition in the random bond Ising model within the framework of the above duality and whether such an interpretation has any connection to the error threshold of the corresponding topological CSS code. In this paper, we consider the above duality relation specifically for a two-dimensional random bond Ising model. We show that the order parameter of this classical system is mapped to a coherence order parameter in a noisy Toric code model. In particular, a quantum phase transition from a coherent phase to a non-coherent phase occurs when the initial coherent state is affected by two sequences of bit-flip quantum channels where a quenched disorder is induced by measurement of the errors after the first channel. On the other hand, the above transition is directly related to error threshold of the Toric code model. Accordingly, and since the noisy process can be applied to other topological CSS states, we conclude that the dual correspondence can also provide a useful tool for the study of error thresholds in different topological CSS codes.

quant-ph↗

arXiv2018

Statistical Physics of Medical Diagnostics: Study of a Probabilistic Model

We study a diagnostic strategy which is based on the anticipation of the diagnostic process by simulation of the dynamical process starting from the initial findings. We show that such a strategy could result in more accurate diagnoses compared to a strategy that is solely based on the direct implications of the initial observations. We demonstrate this by employing the mean-field approximation of statistical physics to compute the posterior disease probabilities for a given subset of observed signs (symptoms) in a probabilistic model of signs and diseases. A Monte Carlo optimization algorithm is then used to maximize an objective function of the sequence of observations, which favors the more decisive observations resulting in more polarized disease probabilities. We see how the observed signs change the nature of the macroscopic (Gibbs) states of the sign and disease probability distributions. The structure of these macroscopic states in the configuration space of the variables affects the quality of any approximate inference algorithm (so the diagnostic performance) which tries to estimate the sign/disease marginal probabilities. In particular, we find that the simulation (or extrapolation) of the diagnostic process is helpful when the disease landscape is not trivial and the system undergoes a phase transition to an ordered phase.

physics.bio-ph↗

arXiv2017

State assignment problem in systems biology and medicine: on the importance of state interaction network topology

A fundamental problem in medicine and biology is to assign states, e.g. healthy or diseased, to cells, organs or individuals. State assignment or making a diagnosis is often a nontrivial and challenging process and, with the advent of omics technologies, the diagnostic challenge is becoming more and more serious. The challenge lies not only in the increasing number of measured properties and dynamics of the system (e.g. cell or human body) but also in the co-evolution of multiple states and overlapping properties, and degeneracy of states. We develop, from first principles, a generic rational framework for state assignment in cell biology and medicine, and demonstrate its applicability with a few simple theoretical case studies from medical diagnostics. We show how disease-related statistical information can be used to build a comprehensive model that includes the relevant dependencies between clinical and laboratory findings (signs) and diseases. In particular, we include disease-disease and sign-sign interactions. We then study how one can infer the probability of a disease in a patient with given signs. We perform comparative analysis with simple benchmark models to check the performances of our models. This first principles approach, as we show, enables the construction of consensus diagnostic flow charts and facilitates the early diagnosis of disease. Additionally, we envision that our approach will find applications in systems biology, and in particular, in characterizing the phenome via the metabolome, the proteome, the transcriptome, and the genome.

physics.bio-ph↗

arXiv2015

Circuit topology of linear polymers: a statistical mechanical treatment

Circuit topology refers to the arrangement of interactions between objects belonging to a linearly ordered object set. Linearly ordered set of objects are common in nature and occur in a wide range of applications in economics, computer science, social science and chemical synthesis. Examples include linear bio-polymers, linear signaling pathways in cells as well as topological sorts appearing in project management. Using a statistical mechanical treatment, we study circuit topology landscapes of linear polymer chains with intra-chain contacts as a prototype of linearly sorted objects with interactions. We find generic features of the topological space and study the statistical properties of the space under the most basic constraints on the occupancy of arrangements and topological interactions. We observe that a set of correlated contact sites (a sector) could nontrivially influence the entropy of circuits as the number of involved sites increases. Finally, we discuss how constraints can be inferred from the information provided by local contact distributions in presence of a sector.

cond-mat.dis-nn↗

arXiv2015

Distance measures and evolution of polymer chains in their topological space

Conformational transitions are ubiquitous in biomolecular systems, have significant functional roles and are subject to evolutionary pressures. Here we provide a first theoretical framework for topological transition, i.e. conformational transitions that are associated with changes in molecular topology. For folded linear biomolecules, arrangement of intramolecular contacts is identified as a key topological property, termed as circuit topology. Distance measures are proposed as reaction coordinates to represent progress along a pathway from initial topology to final topology. Certain topological classes are shown to be more accessible from a random topology. We study dynamic stability and pathway degeneracy associated with a topological reaction and found that off-pathways might seriously hamper evolution to desired topologies. Finally we present an algorithm for estimating the number of intermediate topologies visited during a topological reaction. The results of this study are relevant to, among others, structural studies of RNA and proteins, analysis of topologically associated domains in chromosomes, and molecular evolution.

cond-mat.dis-nn↗

arXiv2012

Message passing for quantified Boolean formulas

We introduce two types of message passing algorithms for quantified Boolean formulas (QBF). The first type is a message passing based heuristics that can prove unsatisfiability of the QBF by assigning the universal variables in such a way that the remaining formula is unsatisfiable. In the second type, we use message passing to guide branching heuristics of a Davis-Putnam Logemann-Loveland (DPLL) complete solver. Numerical experiments show that on random QBFs our branching heuristics gives robust exponential efficiency gain with respect to the state-of-art solvers. We also manage to solve some previously unsolved benchmarks from the QBFLIB library. Apart from this our study sheds light on using message passing in small systems and as subroutines in complete solvers.

cs.AI↗

arXiv2011

Statistical physics of optimization under uncertainty

Optimization under uncertainty deals with the problem of optimizing stochastic cost functions given some partial information on their inputs. These problems are extremely difficult to solve and yet pervade all areas of technological and natural sciences. We propose a general approach to solve such large-scale stochastic optimization problems and a Survey Propagation based algorithm that implements it. In the problems we consider some of the parameters are not known at the time of the first optimization, but are extracted later independently of each other from known distributions. As an illustration, we apply our method to the stochastic bipartite matching problem, in the two-stage and multi-stage cases. The efficiency of our approach, which does not rely on sampling techniques, allows us to validate the analytical predictions with large-scale numerical simulations.

cond-mat.stat-mech↗

arXiv2011

Stochastic optimization by message passing

Most optimization problems in applied sciences realistically involve uncertainty in the parameters defining the cost function, of which only statistical information is known beforehand. In a recent work we introduced a message passing algorithm based on the cavity method of statistical physics to solve the two-stage matching problem with independently distributed stochastic parameters. In this paper we provide an in-depth explanation of the general method and caveats, show the details of the derivation and resulting algorithm for the matching problem and apply it to a stochastic version of the independent set problem, which is a computationally hard and relevant problem in communication networks. We compare the results with some greedy algorithms and briefly discuss the extension to more complicated stochastic multi-stage problems.

cond-mat.stat-mech↗