Search

Classical optimization of parameterized quantum circuits is a widely studied methodology for the preparation of complex quantum states, as well as the solution of machine learning and optimization problems. However, it is well known that many proposed parameterized quantum circuit architectures suffer from drawbacks which limit their utility, such as the hardness of optimization due to their classical simulability or a problem known as "barren plateaus". We propose and study a class of dynamic parameterized quantum circuit architectures. These are parameterized circuits containing intermediate measurements and feedforward operations. In particular, we show that these architectures: 1. Provably do not suffer from barren plateaus. 2. Are expressive enough to describe arbitrarily deep unitary quantum circuits. 3. Are competitive with state of the art methods for the preparation of ground states and facilitate the representation of nontrivial thermal states. These features make the proposed architectures promising candidates for a variety of applications., Comment: 50 pages

In this paper, we address the challenge of certifying the performance of a machine learning model on an unseen target network, using measurements from an available source network. We focus on a scenario where heterogeneous datasets are distributed across a source network of clients, all connected to a central server. Specifically, consider a source network "A" composed of $K$ clients, each holding private data from unique and heterogeneous distributions, which are assumed to be independent samples from a broader meta-distribution $\mu$. Our goal is to provide certified guarantees for the model's performance on a different, unseen target network "B," governed by another meta-distribution $\mu'$, assuming the deviation between $\mu$ and $\mu'$ is bounded by either the Wasserstein distance or an $f$-divergence. We derive theoretical guarantees for the model's empirical average loss and provide uniform bounds on the risk CDF, where the latter correspond to novel and adversarially robust versions of the Glivenko-Cantelli theorem and the Dvoretzky-Kiefer-Wolfowitz (DKW) inequality. Our bounds are computable in polynomial time with a polynomial number of queries to the $K$ clients, preserving client privacy by querying only the model's (potentially adversarial) loss on private data. We also establish non-asymptotic generalization bounds that consistently converge to zero as both $K$ and the minimum client sample size grow. Extensive empirical evaluations validate the robustness and practicality of our bounds across real-world tasks., Comment: 40 pages

The aim of this paper is to address the challenge of gradual domain adaptation within a class of manifold-constrained data distributions. In particular, we consider a sequence of $T\ge2$ data distributions $P_1,\ldots,P_T$ undergoing a gradual shift, where each pair of consecutive measures $P_i,P_{i+1}$ are close to each other in Wasserstein distance. We have a supervised dataset of size $n$ sampled from $P_0$, while for the subsequent distributions in the sequence, only unlabeled i.i.d. samples are available. Moreover, we assume that all distributions exhibit a known favorable attribute, such as (but not limited to) having intra-class soft/hard margins. In this context, we propose a methodology rooted in Distributionally Robust Optimization (DRO) with an adaptive Wasserstein radius. We theoretically show that this method guarantees the classification error across all $P_i$s can be suitably bounded. Our bounds rely on a newly introduced {\it {compatibility}} measure, which fully characterizes the error propagation dynamics along the sequence. Specifically, for inadequately constrained distributions, the error can exponentially escalate as we progress through the gradual shifts. Conversely, for appropriately constrained distributions, the error can be demonstrated to be linear or even entirely eradicated. We have substantiated our theoretical findings through several experimental results., Comment: Published at Proceedings of Neural Information Processing Systems (NeurIPS) 2024

This paper presents Auriga Robotics' autonomous vehicle, developed at Shahid Beheshti University's Robotics and Intelligent Automation Lab, as part of the team's entry for the 2024 RoboCup IranOpen competition. The vehicle is a 1:10 scale car equipped with a custom-designed chassis, a stepper motor for precision, and a range of sensors for autonomous navigation. Key hardware includes ESP32 microcontrollers that manage motor control and sensor data acquisition. The software system integrates computer vision, including YOLOv8 for sign detection and PiNet for lane detection, combined with control algorithms such as the Stanley, PID, and Pure Pursuit controllers. The vehicle's design emphasizes real-time decision-making, environmental mapping, and efficient localization, ensuring its ability to navigate complex driving scenarios.

This paper proposes an observer-based event-driven approach to decrease the overuse of communication networks. The suggested approach aims to estimate the required data for sharing between units in line with as much communication reduction as possible. In other words, the proposed approach effectively determines which state variables should be shared (observer concept) among the units during specific time intervals (event-triggered concept). This strategy significantly reduces the overall communication load. It is shown that the estimation error remains bounded and Zeno behavior, characterized by an endless number of transmissions occurring within a limited time frame, does not occur. The proposed methodology can be systematically applied to any communication-based secondary controller in alternating current (AC) microgrids. Simulation results demonstrate a high degree of precision in estimating the states under the proposed approach. Also, the secondary controller performance under the proposed method is evaluated in MATLAB/Simulink environment., Comment: 2024 IEEE PES Innovative Smart Grid Technologies Europe (ISGT Europe)

Recent advancements in deep learning, particularly in medical imaging, have significantly propelled the progress of healthcare systems. However, examining the robustness of medical images against adversarial attacks is crucial due to their real-world applications and profound impact on individuals' health. These attacks can result in misclassifications in disease diagnosis, potentially leading to severe consequences. Numerous studies have explored both the implementation of adversarial attacks on medical images and the development of defense mechanisms against these threats, highlighting the vulnerabilities of deep neural networks to such adversarial activities. In this study, we investigate adversarial attacks on images associated with Alzheimer's disease and propose a defensive method to counteract these attacks. Specifically, we examine adversarial attacks that employ frequency domain transformations on Alzheimer's disease images, along with other well-known adversarial attacks. Our approach utilizes a convolutional neural network (CNN)-based autoencoder architecture in conjunction with the two-dimensional Fourier transform of images for detection purposes. The simulation results demonstrate that our detection and defense mechanism effectively mitigates several adversarial attacks, thereby enhancing the robustness of deep neural networks against such vulnerabilities., Comment: 10 pages, 4 figures, conference

Central charge is a fundamental quantity in conformal field theories (CFT), and plays a crucial role in determining universality classes of critical points in two-dimensional systems. Despite its significance, the measurement of central charge has remained elusive thus far. In this work, we present the first experimental determination of the central charge using a universal quantum processor. Using a classically optimized variational quantum circuit and employing advanced error mitigation techniques, we successfully prepare ground states of various $1+1D$ quantum spin chain models at their critical point. Leveraging the heavy-hex structure of IBM quantum processors, we are able to implement periodic boundary conditions and mitigate boundary effects. We then extract the central charge from the scaling behavior of the sub-leading term of R{\'{e}}nyi generalizations of classical Shannon entropy, computed for local Pauli measurements in the conformal bases ($\sigma^{z}$ and $\sigma^x$). The experimental results are consistent with the known central charge values for the transverse field Ising (TFI) chain ($c=0.5$) and the XXZ chain ($c=1$), achieving relative errors as low as 5 percent., Comment: 7 + 13 pages, 4 + 11 figures

Quantum phase transitions offer profound insights into fundamental quantum phenomena and enhance our understanding of complex materials and systems. However, identifying quantum phase transitions in the absence of conventional order parameters poses a significant challenge. To address this, we utilize reduced fidelity susceptibility (RFS) vector field to construct phase diagrams of various quantum systems and then demonstrate its efficacy in reproducing the phase diagrams of established models with known order parameter. To this end, we propose a new method for discovering the necessary order parameters for a given quantum model and illustrate its capability by identifying a suitable order parameter for the Axial Next Nearest Neighbour Interaction (ANNNI) Model. Our analysis, which includes decomposing the observable into its eigen-projectors alongside the finite-size scaling, confirms that our method successfully can determine order parameters and thus its capable of characterizing quantum phase transitions.

The neutron-rich unbound fluorine isotope $^{30}$F$_{21}$ has been observed for the first time by measuring its neutron decay at the SAMURAI spectrometer (RIBF, RIKEN) in the quasi-free proton knockout reaction of $^{31}$Ne nuclei at 235 MeV/nucleon. The mass and thus one-neutron-separation energy of $^{30}$F has been determined to be $S_n = -472\pm 58 \mathrm{(stat.)} \pm 33 \mathrm{(sys.)}$ keV from the measurement of its invariant-mass spectrum. The absence of a sharp drop in $S_n$($^{30}$F) shows that the ``magic'' $N=20$ shell gap is not restored close to $^{28}$O, which is in agreement with our shell-model calculations that predict a near degeneracy between the neutron $d$ and $fp$ orbitals, with the $1p_{3/2}$ and $1p_{1/2}$ orbitals becoming more bound than the $0f_{7/2}$ one. This degeneracy and reordering of orbitals has two potential consequences: $^{28}$O behaves like a strongly superfluid nucleus with neutron pairs scattering across shells, and both $^{29,31}$F appear to be good two-neutron halo-nucleus candidates., Comment: 9 pages, 2 figures, accepted for publication in Physical Review Letters

Recent Baryon Acoustic Oscillation (BAO) measurements released by DESI, when combined with Cosmic Microwave Background (CMB) data from Planck and two different samples of Type Ia supernovae (Pantheon-Plus and DESY5) reveal a preference for Dynamical Dark Energy (DDE) characterized by a present-day quintessence-like equation of state that crossed into the phantom regime in the past. A core ansatz for this result is assuming a linear Chevallier-Polarski-Linder (CPL) parameterization $w(a) = w_0 + w_a (1-a)$ to describe the evolution of the DE equation of state (EoS). In this paper, we test if and to what extent this assumption impacts the results. To prevent broadening uncertainties in cosmological parameter inference and facilitate direct comparison with the baseline CPL case, we focus on 4 alternative well-known models that, just like CPL, consist of only two free parameters: the present-day DE EoS ($w_0$) and a parameter quantifying its dynamical evolution ($w_a$). We demonstrate that the preference for DDE remains robust regardless of the parameterization: $w_0$ consistently remains in the quintessence regime, while $w_a$ consistently indicates a preference for a dynamical evolution towards the phantom regime. This tendency is significantly strengthened by DESY5 SN measurements. By comparing the best-fit $\chi^2$ obtained within each DDE model, we notice that the linear CPL parameterization is not the best-fitting case. Among the models considered, the EoS proposed by Barboza and Alcaniz consistently leads to the most significant improvement., Comment: 44 pages, 7 figures, 7 tables. V2: additional references, more details and discussion on the results and their interpretation, added a new Appendix presenting additional constraints on interesting properties of the DE EoS across the different models analyzed. Version accepted for publication in JCAP

A spatiotemporal deep learning framework is proposed that is capable of 2D full-field prediction of fracture in concrete mesostructures. This framework not only predicts fractures but also captures the entire history of the fracture process, from the crack initiation in the interfacial transition zone to the subsequent propagation of the cracks in the mortar matrix. In addition, a convolutional neural network is developed which can predict the averaged stress-strain curve of the mesostructures. The UNet modeling framework, which comprises an encoder-decoder section with skip connections, is used as the deep learning surrogate model. Training and test data are generated from high-fidelity fracture simulations of randomly generated concrete mesostructures. These mesostructures include geometric variabilities such as different aggregate particle geometrical features, spatial distribution, and the total volume fraction of aggregates. The fracture simulations are carried out in Abaqus, utilizing the cohesive phase-field fracture modeling technique as the fracture modeling approach. In this work, to reduce the number of training datasets, the spatial distribution of three sets of material properties for three-phase concrete mesostructures, along with the spatial phase-field damage index, are fed to the UNet to predict the corresponding stress and spatial damage index at the subsequent step. It is shown that after the training process using this methodology, the UNet model is capable of accurately predicting damage on the unseen test dataset by using 470 datasets. Moreover, another novel aspect of this work is the conversion of irregular finite element data into regular grids using a developed pipeline. This approach allows for the implementation of less complex UNet architecture and facilitates the integration of phase-field fracture equations into surrogate models for future developments.

The measurements of the cosmic microwave background (CMB) have played a significant role in understanding the nature of dark energy. In this article, we investigate the dynamics of the dark energy equation of state, utilizing high-precision CMB data from multiple experiments. We begin by examining the Chevallier-Polarski-Linder (CPL) parametrization, a commonly used and recognized framework for describing the dark energy equation of state. We then explore the general Exponential parametrization, which incorporates CPL as its first-order approximation, and extensions of this parametrization that incorporate nonlinear terms. We constrain these scenarios using CMB data from various missions, including the Planck 2018 legacy release, the Wilkinson Microwave Anisotropy Probe (WMAP), the Atacama Cosmology Telescope (ACT), and the South Pole Telescope (SPT), as well as combinations with low-redshift cosmological probes such as Baryon Acoustic Oscillations (BAO) and the Pantheon sample. While the $\Lambda$CDM cosmology remains consistent within the 68\% confidence level, we observe that the extensions of the CPL parametrization are indistinguishable for Planck data. However, for ACT and SPT data, the inclusion of additional terms begins to reveal a peak in $w_{\rm a, DE}$ that was previously unconstrained., Comment: 14 pages, 6 tables and 4 captioned figures; version published in Phys. Dark. Univ

Heavy-tailed distributions are infamously difficult to estimate because their moments tend to infinity as the shape of the tail decay increases. Nevertheless, this study shows the utilization of a modified group of moments for estimating a heavy-tailed distribution. These modified moments are determined from powers of the original distribution. The nth-power distribution is guaranteed to have finite moments up to n-1. Samples from the nth-power distribution are drawn from n-tuple Independent Approximates, which are the set of independent samples grouped into n-tuples and sub-selected to be approximately equal to each other. We show that Independent Approximates are a maximum likelihood estimator for the generalized Pareto and the Student's t distributions, which are members of the family of coupled exponential distributions. We use the first (original), second, and third power distributions to estimate their zeroth (geometric mean), first, and second power-moments respectively. In turn, these power-moments are used to estimate the scale and shape of the distributions. A least absolute deviation criteria is used to select the optimal set of Independent Approximates. Estimates using higher powers and moments are possible though the number of n-tuples that are approximately equal may be limited., Comment: 23 pages, 2 figures

In neural network (NN) security, safeguarding model integrity and resilience against adversarial attacks has become paramount. This study investigates the application of stochastic computing (SC) as a novel mechanism to fortify NN models. The primary objective is to assess the efficacy of SC to mitigate the deleterious impact of attacks on NN results. Through a series of rigorous experiments and evaluations, we explore the resilience of NNs employing SC when subjected to adversarial attacks. Our findings reveal that SC introduces a robust layer of defense, significantly reducing the susceptibility of networks to attack-induced alterations in their outcomes. This research contributes novel insights into the development of more secure and reliable NN systems, essential for applications in sensitive domains where data integrity is of utmost concern., Comment: 3 pages, 1 figure, 2 tables

We report an observation of ultra-high energy (UHE) gamma rays from the Galactic Center region, using seven years of data collected by the High-Altitude Water Cherenkov (HAWC) Observatory. The HAWC data are best described as a point-like source (HAWC J1746-2856) with a power-law spectrum ($\mathrm{d}N/\mathrm{d}E=\phi(E/26 \,\text{TeV})^{\gamma}$), where $\gamma=-2.88 \pm 0.15_{\text{stat}} - 0.1_{\text{sys}} $ and $\phi=1.5 \times 10^{-15}$ (TeV cm$^{2}$s)$^{-1}$ $\pm\, 0.3_{\text{stat}}\,^{+0.08_{\text{sys}}}_{-0.13_{\text{sys}}}$ extending from 6 to 114 TeV. We find no evidence of a spectral cutoff up to $100$ TeV using HAWC data. Two known point-like gamma-ray sources are spatially coincident with the HAWC gamma-ray excess: Sgr A$^{*}$ (HESS J1745-290) and the Arc (HESS J1746-285). We subtract the known flux contribution of these point sources from the measured flux of HAWC J1746-2856 to exclude their contamination and show that the excess observed by HAWC remains significant ($>$5$\sigma$) with the spectrum extending to $>$100 TeV. Our result supports that these detected UHE gamma rays can originate via hadronic interaction of PeV cosmic-ray protons with the dense ambient gas and confirms the presence of a proton PeVatron at the Galactic Center.

We propose integral representations and analytical solutions for the propagator of the $1+1$ dimensional Salpeter Hamiltonian, describing a relativistic quantum particle with no spin. We explore the exact Green function and an exact solution for a given initial condition, and also find the asymptotic solutions in some limiting cases. The analytical extension of the Hamiltonian in the complex plane allows us to formulate the equivalent stochastic problem, namely the B\"aumer equation. This equation describes \textit{relativistic} stochastic processes with time-changing anomalous diffusion. This B\"aumer propagator corresponds to the Green function of a relativistic diffusion process that interpolates between Cauchy distributions for small times and Gaussian diffusion for large times, providing a framework for stochastic processes where anomalous diffusion is time-dependent., Comment: 10 pages, 5 figures, five appendixes. to be submitted to PRE

Fibonacci string-net condensate, a complex topological state that supports non-Abelian anyon excitations, holds promise for fault-tolerant universal quantum computation. However, its realization by a static-lattice Hamiltonian has remained elusive due to the inherent high-order interactions demanded. Here, we introduce a scalable dynamical string-net preparation (DSNP) approach, suitable even for near-term quantum processors, that can dynamically prepare the state through reconfigurable graphs. DSNP enables the creation and manipulation of the Fibonacci string-net condensate (Fib-SNC). Using a superconducting quantum processor, we couple the DSNP approach with a composite error-mitigation strategy on deep circuits to successfully create, measure, and braid Fibonacci anyons in two spatial dimensions (2D) demonstrating their potential for universal quantum computation. To this end, we measure anyon charges for two species of anyons associated with the doubled topological quantum field theory underlying Fid-SNC, with an average experimental accuracy of 94%. We validate that a scalable 2D braiding operation on a logical qubit encoded on three anyons yields the golden ratio $\phi$ with 98% average accuracy and 8% measurement uncertainty. We further sample the Fib-SNC wavefunction to estimate the chromatic polynomial at $\phi+2$ for various graphs. Given the established computational hardness of the chromatic polynomial, the wavefunction amplitude is classically hard to evaluate. Our results establish the first proof of principle that scalable DSNP can open doors to fault-tolerant universal quantum computation and to classically-hard problems., Comment: 4 pages and 4 figures with Supplemental Materials (47 pages, 18 Figures)

Development of a two-phase incompressible solver for magnetic flows in the magnetostatic case is presented. The proposed numerical toolkit couples the Navier-Stokes equations of hydrodynamics with Maxwell's equations of electromagnetism to model the behaviour of magnetic flows in the presence of a magnetic field. To this end, a rigorous implementation of a second-order two-phase solver for incompressible nonmagnetic flows is introduced first. This solver is implemented in the finite-difference framework, where a fifth-order conservative level set method is employed to capture the evolution of the interface, along with an incompressible solver based on the projection scheme to model the fluids. The solver demonstrates excellent performance even with high density ratios across the interface (Atwood number $\approx 1$), while effectively preserving the mass conservation property. Subsequently, the numerical discretization of Maxwell's equations under the magnetostatic assumption is described in detail, utilizing the vector potential formulation. The primary second-order solver for two-phase flows is extended to the case of magnetic flows, by incorporating the Lorentz force into the momentum equation, accounting for high magnetic permeability ratios across the interface. The implemented solver is then utilized for examining the deformation of ferrofluid droplets in both quiescent and shear flow regimes across various susceptibility values of the droplets. The results suggest that increasing the susceptibility value of the ferrofluid droplet can affect its deformation and rotation in low capillary regimes. In higher capillary flows, increasing the magnetic permeability jump across the interface can further lead to droplet breakup as well. The effect of this property is also investigated for the Rayleigh-Taylor instability growth in magnetic fluids.

Learning faithful representations of quantum states is crucial to fully characterizing the variety of many-body states created on quantum processors. While various tomographic methods such as classical shadow and MPS tomography have shown promise in characterizing a wide class of quantum states, they face unique limitations in detecting topologically ordered two-dimensional states. To address this problem, we implement and study a heuristic tomographic method that combines variational optimization on tensor networks with randomized measurement techniques. Using this approach, we demonstrate its ability to learn the ground state of the surface code Hamiltonian as well as an experimentally realizable quantum spin liquid state. In particular, we perform numerical experiments using MPS ans\"atze and systematically investigate the sample complexity required to achieve high fidelities for systems of sizes up to $48$ qubits. In addition, we provide theoretical insights into the scaling of our learning algorithm by analyzing the statistical properties of maximum likelihood estimation. Notably, our method is sample-efficient and experimentally friendly, only requiring snapshots of the quantum state measured randomly in the $X$ or $Z$ bases. Using this subset of measurements, our approach can effectively learn any real pure states represented by tensor networks, and we rigorously prove that random-$XZ$ measurements are tomographically complete for such states., Comment: 11+35 pages, 4+3 figures; Added additional references

In this paper, we study operator mean inequalities for the weighted arithmetic, geometric and harmonic means. We give a slight modification of Audenaert's result to show the relation between Kwong functions and operator monotone functions. Operator mean inequalities provide some analogs of the geometric concavity property for Kwong functions, operator convex, and operator monotone functions. Moreover, we give our points across by way of some examples which show the usage of our main results., Comment: Accepted by Arch. Math. (Basel)

In this study, we develop a novel multi-fidelity deep learning approach that transforms low-fidelity solution maps into high-fidelity ones by incorporating parametric space information into a standard autoencoder architecture. This method's integration of parametric space information significantly reduces the need for training data to effectively predict high-fidelity solutions from low-fidelity ones. In this study, we examine a two-dimensional steady-state heat transfer analysis within a highly heterogeneous materials microstructure. The heat conductivity coefficients for two different materials are condensed from a 101 x 101 grid to smaller grids. We then solve the boundary value problem on the coarsest grid using a pre-trained physics-informed neural operator network known as Finite Operator Learning (FOL). The resulting low-fidelity solution is subsequently upscaled back to a 101 x 101 grid using a newly designed enhanced autoencoder. The novelty of the developed enhanced autoencoder lies in the concatenation of heat conductivity maps of different resolutions to the decoder segment in distinct steps. Hence the developed algorithm is named microstructure-embedded autoencoder (MEA). We compare the MEA outcomes with those from finite element methods, the standard U-Net, and various other upscaling techniques, including interpolation functions and feedforward neural networks (FFNN). Our analysis shows that MEA outperforms these methods in terms of computational efficiency and error on test cases. As a result, the MEA serves as a potential supplement to neural operator networks, effectively upscaling low-fidelity solutions to high fidelity while preserving critical details often lost in traditional upscaling methods, particularly at sharp interfaces like those seen with interpolation.

Behavioural distances of transition systems modelled via coalgebras for endofunctors generalize traditional notions of behavioural equivalence to a quantitative setting, in which states are equipped with a measure of how (dis)similar they are. Endowing transition systems with such distances essentially relies on the ability to lift functors describing the one-step behavior of the transition systems to the category of pseudometric spaces. We consider the category theoretic generalization of the Kantorovich lifting from transportation theory to the case of lifting functors to quantale-valued relations, which subsumes equivalences, preorders and (directed) metrics. We use tools from fibred category theory, which allow one to see the Kantorovich lifting as arising from an appropriate fibred adjunction. Our main contributions are compositionality results for the Kantorovich lifting, where we show that that the lifting of a composed functor coincides with the composition of the liftings. In addition, we describe how to lift distributive laws in the case where one of the two functors is polynomial (with finite coproducts). These results are essential ingredients for adapting up-to-techniques to the case of quantale-valued behavioural distances. Up-to techniques are a well-known coinductive technique for efficiently showing lower bounds for behavioural distances. We illustrate the results of our paper in two case studies.

Whilst holding great promise for low noise, ease of operation and networking, useful photonic quantum computing has been precluded by the need for beyond-state-of-the-art components, manufactured by the millions. Here we introduce a manufacturable platform for quantum computing with photons. We benchmark a set of monolithically-integrated silicon photonics-based modules to generate, manipulate, network, and detect photonic qubits, demonstrating dual-rail photonic qubits with $99.98\% \pm 0.01\%$ state preparation and measurement fidelity, Hong-Ou-Mandel quantum interference between independent photon sources with $99.50\%\pm0.25\%$ visibility, two-qubit fusion with $99.22\%\pm0.12\%$ fidelity, and a chip-to-chip qubit interconnect with $99.72\%\pm0.04\%$ fidelity, not accounting for loss. In addition, we preview a selection of next generation technologies, demonstrating low-loss silicon nitride waveguides and components, fabrication-tolerant photon sources, high-efficiency photon-number-resolving detectors, low-loss chip-to-fiber coupling, and barium titanate electro-optic phase shifters., Comment: 8 pages, 5 figures

In this paper we introduce a new type of preferential attachment network, the growth of which is based on the eigenvalue centrality. In this network, the agents attach most probably to the nodes with larger eigenvalue centrality which represents that the agent has stronger connections. A new network is presented, namely a dandelion network, which shares some properties of star-like structure and also a hierarchical network. We show that this network, having hub-and-spoke topology is not generally scale free, and shows essential differences with respect to the Barab{\'a}si-Albert preferential attachment model. Most importantly, there is a super hub agent in the system (identified by a pronounced peak in the spectrum), and the other agents are classified in terms of the distance to this super-hub. We explore a plenty of statistical centralities like the nodes degree, the betweenness and the eigenvalue centrality, along with various measures of structure like the community and hierarchical structures, and the clustering coefficient. Global measures like the shortest path statistics and the self-similarity are also examined., Comment: 15 pages, 16 figures

To obtain fast solutions for governing physical equations in solid mechanics, we introduce a method that integrates the core ideas of the finite element method with physics-informed neural networks and concept of neural operators. This approach generalizes and enhances each method, learning the parametric solution for mechanical problems without relying on data from other resources (e.g. other numerical solvers). We propose directly utilizing the available discretized weak form in finite element packages to construct the loss functions algebraically, thereby demonstrating the ability to find solutions even in the presence of sharp discontinuities. Our focus is on micromechanics as an example, where knowledge of deformation and stress fields for a given heterogeneous microstructure is crucial for further design applications. The primary parameter under investigation is the Young's modulus distribution within the heterogeneous solid system. Our investigations reveal that physics-based training yields higher accuracy compared to purely data-driven approaches for unseen microstructures. Additionally, we offer two methods to directly improve the process of obtaining high-resolution solutions, avoiding the need to use basic interpolation techniques. First is based on an autoencoder approach to enhance the efficiency for calculation on high resolution grid point. Next, Fourier-based parametrization is utilized to address complex 2D and 3D problems in micromechanics. The latter idea aims to represent complex microstructures efficiently using Fourier coefficients. Comparisons with other well-known operator learning algorithms, further emphasize the advantages of the newly proposed method.

This research investigates the impact of the nature of Dark Energy (DE) on structure formation, focusing on the matter power spectrum and the Integrated Sachs-Wolfe effect (ISW). By analyzing the matter power spectrum at redshifts $z = 0$ and $z = 5$, as well as the ISW effect on the scale of $\ell = 10-100$, the study provides valuable insights into the influence of DE equations of state (EoS) on structure formation. The findings reveal that dynamical DE models exhibit a stronger matter power spectrum compared to constant DE models, with the JBP model demonstrating the highest amplitude and the CPL model the weakest. Additionally, the study delves into the ISW effect, highlighting the time evolution of the ISW source term $\mathcal{F}(a)$ and its derivative $d\mathcal{F}(a)/da$, and demonstrating that models with constant DE EoS exhibit a stronger amplitude of $\mathcal{F}(a)$ overall, while dynamical models such as CPL exhibit the highest amplitude among the dynamical models, whereas JBP has the lowest. The study also explores the ISW auto-correlation power spectrum and the ISW cross-correlation power spectrum, revealing that dynamical DE models dominate over those with constant DE EoS across various surveys. Moreover, it emphasizes the potential of studying the non-linear matter power spectrum and incorporating datasets from the small scales to further elucidate the dynamical nature of dark energy. This comprehensive analysis underscores the significance of both the matter power spectrum and the ISW signal in discerning the nature of dark energy, paving the way for future research to explore the matter power spectrum at higher redshifts and in the non-linear regime, providing deeper insights into the dynamical nature of dark energy.

Modern digital engineering design process commonly involves expensive repeated simulations on varying three-dimensional (3D) geometries. The efficient prediction capability of neural networks (NNs) makes them a suitable surrogate to provide design insights. Nevertheless, few available NNs can handle solution prediction on varying 3D shapes. We present a novel deep operator network (DeepONet) variant called Geom-DeepONet, which encodes parameterized 3D geometries and predicts full-field solutions on an arbitrary number of nodes. To the best of the authors' knowledge, this is the first attempt in the literature and is our primary novelty. In addition to expressing shapes using mesh coordinates, the signed distance function for each node is evaluated and used to augment the inputs to the trunk network of the Geom-DeepONet, thereby capturing both explicit and implicit representations of the 3D shapes. The powerful geometric encoding capability of a sinusoidal representation network (SIREN) is also exploited by replacing the classical feedforward neural networks in the trunk with SIREN. Additional data fusion between the branch and trunk networks is introduced by an element-wise product. A numerical benchmark was conducted to compare Geom-DeepONet to PointNet and vanilla DeepONet, where results show that our architecture trains fast with a small memory footprint and yields the most accurate results among the three with less than 2 MPa stress error. Results show a much lower generalization error of our architecture on unseen dissimilar designs than vanilla DeepONet. Once trained, the model can predict vector solutions, and speed can be over $10^5$ times faster than implicit finite element simulations for large meshes.

We introduce a novel field theory representation for the Sum of Powers of Principal Minors (SPPM), a mathematical construct with profound implications in quantum mechanics and statistical physics. We begin by establishing a Berezin integral formulation of the SPPM problem, showcasing its versatility through various symmetries including $SU(n)$, its subgroups, and particle-hole symmetry. This representation not only facilitates new analytical approaches but also offers deeper insights into the symmetries of complex quantum systems. For instance, it enables the representation of the Hubbard model's partition function in terms of the SPPM problem. We further develop three mean field techniques to approximate SPPM, each providing unique perspectives and utilities: the first method focuses on the evolution of symmetries post-mean field approximation, the second, based on the bosonic representation, enhances our understanding of the stability of mean field results, and the third employs a variational approach to establish a lower bound for SPPM. These methods converge to identical consistency relations and values for SPPM, illustrating their robustness. The practical applications of our theoretical advancements are demonstrated through two compelling case studies. First, we exactly solve the SPPM problem for the Laplacian matrix of a chain, a symmetric tridiagonal matrix, allowing for precise benchmarking of mean-field theory results. Second, we present the first analytical calculation of the Shannon-R\'enyi entropy for the transverse field Ising chain, revealing critical insights into phase transitions and symmetry breaking in the ferromagnetic phase. This work not only bridges theoretical gaps in understanding principal minors within quantum systems but also sets the stage for future explorations in more complex quantum and statistical physics models., Comment: 52 pages 15 figures

This paper proposes a high-performance and energy-efficient optical near-sensor accelerator for vision applications, called Lightator. Harnessing the promising efficiency offered by photonic devices, Lightator features innovative compressive acquisition of input frames and fine-grained convolution operations for low-power and versatile image processing at the edge for the first time. This will substantially diminish the energy consumption and latency of conversion, transmission, and processing within the established cloud-centric architecture as well as recently designed edge accelerators. Our device-to-architecture simulation results show that with favorable accuracy, Lightator achieves 84.4 Kilo FPS/W and reduces power consumption by a factor of ~24x and 73x on average compared with existing photonic accelerators and GPU baseline., Comment: 6 pages, 10 figures

Pre-trained Language Models (PLMs) can be accurately fine-tuned for downstream text processing tasks. Recently, researchers have introduced several parameter-efficient fine-tuning methods that optimize input prompts or adjust a small number of model parameters (e.g LoRA). In this study, we explore the impact of altering the input text of the original task in conjunction with parameter-efficient fine-tuning methods. To most effectively rewrite the input text, we train a few-shot paraphrase model with a Maximum-Marginal Likelihood objective. Using six few-shot text classification datasets, we show that enriching data with paraphrases at train and test time enhances the performance beyond what can be achieved with parameter-efficient fine-tuning alone. The code used for our experiments can be found at https://github.com/SaeedNajafi/RIFF., Comment: Final Version (Findings of ACL2024)