Search

Global emissions from fossil fuel combustion and cement production were recorded in 2022, signaling a resurgence to pre-pandemic levels and providing an apodictic indication that emission peaks have not yet been achieved. Significant contributions to this upward trend are made by the Information and Communication Technology (ICT) industry due to its substantial energy consumption. This shows the need for further exploration of swarm intelligence applications to measure and optimize the carbon footprint within ICT. All causative factors are evaluated based on the quality of data collection; variations from each source are quantified; and an objective function related to carbon footprint in ICT energy management is optimized. Emphasis is placed on the asyndetic integration of data sources to construct a convex optimization problem. An apodictic necessity to prevent the erosion of accuracy in carbon footprint assessments is addressed. Complexity percentages ranged from 5.25% for the Bat Algorithm to 7.87% for Fast Bacterial Swarming, indicating significant fluctuations in resource intensity among algorithms. These findings suggest that we were able to quantify the environmental impact of various swarm algorithms.

One requirement of maintaining digital information is storage. With the latest advances in the digital world, new emerging media types have required even more storage space to be kept than before. In fact, in many cases it is required to have larger amounts of storage to keep up with protocols that support more types of information at the same time. In contrast, compression algorithms have been integrated to facilitate the transfer of larger data. Numerical representations are construed as embodiments of information. However, this correct association of a sequence could feasibly be inverted to signify an elongated series of numerals. In this work, a novel mathematical paradigm was introduced to engineer a methodology reliant on iterative logarithmic transformations, finely tuned to numeric sequences. Through this fledgling approach, an intricate interplay of polymorphic numeric manipulations was conducted. By applying repeated logarithmic operations, the data were condensed into a minuscule representation. Approximately thirteen times surpassed the compression method, ZIP. Such extreme compaction, achieved through iterative reduction of expansive integers until they manifested as single-digit entities, conferred a novel sense of informational embodiment. Instead of relegating data to classical discrete encodings, this method transformed them into a quasi-continuous, logarithmically. By contrast, this introduced approach revealed that morphing data into deeply compressed numerical substrata beyond conventional boundaries was feasible. A holistic perspective emerges, validating that numeric data can be recalibrated into ephemeral sequences of logarithmic impressions. It was not merely a matter of reducing digits, but of reinterpreting data through a resolute numeric vantage.

We describe our contribution to the Strict and Strict-Small tracks of the 2nd iteration of the BabyLM Challenge. The shared task is centered around efficient pre-training given data constraints motivated by human development. In response, we study the effect of synthetic story data in language pre-training using TinyStories: a recently introduced dataset of short stories. Initially, we train GPT-Neo models on subsets of TinyStories, while varying the amount of available data. We find that, even with access to less than 100M words, the models are able to generate high-quality, original completions to a given story, and acquire substantial linguistic knowledge. To measure the effect of synthetic story data, we train LTG-BERT encoder models on a combined dataset of: a subset of TinyStories, story completions generated by GPT-Neo, and a subset of the BabyLM dataset. Our experimentation reveals that synthetic data can occasionally offer modest gains, but overall have a negative influence on linguistic understanding. Our work offers an initial study on synthesizing story data in low resource settings and underscores their potential for augmentation in data-constrained language modeling. We publicly release our models and implementation on our GitHub.

Following Hollins et al. [J. Phys.: Condens. Matter 29, 04LT01 (2017)], we invert the electronic ground state densities for various semiconducting and insulating solids calculated using several density functional approximations within the generalised Kohn-Sham (GKS) scheme, Hartree-Fock (HF) theory and the LDA+$U$ method, and benchmark against standard (semi-)local functionals. The band structures from the resulting local exchange-correlation (LXC) Kohn-Sham potential for these densities are then compared with the band structures of the original GKS method. We find the LXC potential obtained from the HF density systematically predicts band gaps in good agreement with experiment, even in strongly correlated transition metal monoxides (TMOs). Furthermore, we find that the HSE06 and PBE0 hybrid functionals yield similar densities and LXC potentials, and in weakly correlated systems, these potentials are similar to PBE. For LDA+$U$ densities, the LXC potential effectively reverses the flattening of bands caused by over-localisation by a large Hubbard-$U$ value, while for meta-GGAs, we find only small differences between the GKS and LXC results demonstrating that the non-locality of meta-GGAs is weak., Comment: 26 pages, 17 figures, 4 tables

We explore the important task of applying a phase $exp(i f(x))$ to a computational basis state $\left| x \right>$. The closely related task of rotating a target qubit by an angle depending on $f(x)$ is also studied. Such operations are key in many quantum subroutines, and often the function $f$ can be well-approximated by a piecewise linear composition. Examples range from the application of diagonal Hamiltonian terms (such as the Coulomb interaction) in grid-based many-body simulation, to derivative pricing algorithms. Here we exploit a parallelisation of the piecewise approach so that all constituent elementary rotations are performed simultaneously, that is, we achieve a total rotation depth of one. Moreover, we explore the use of recursive catalyst 'towers' to implement these elementary rotations efficiently. Depending on the choice of implementation strategy, we find a depth as low as $O(log n + log S)$ for a register of $n$ qubits and a piecewise approximation of $S$ sections. In the limit of multiple repetitions of the oracle, we find that catalyst tower approaches have an $O(S \cdot n)$ T-count, whereas linear interpolation with QROM has an $O(n^{log_2(3)})$ T-count., Comment: 14 pages, references added, table I updated, code for table I added

We demonstrate that the problem of amplitude estimation, a core subroutine used in many quantum algorithms, can be mapped directly to a problem in signal processing called direction of arrival (DOA) estimation. The DOA task is to determine the direction of arrival of an incoming wave with the fewest possible measurements. The connection between amplitude estimation and DOA allows us to make use of the vast amount of signal processing algorithms to post-process the measurements of the Grover iterator at predefined depths. Using an off-the-shelf DOA algorithm called ESPRIT together with a compressed-sensing based sampling approach, we create a phase-estimation free, parallel quantum amplitude estimation (QAE) algorithm with a total query complexity of $\sim 4.9/\varepsilon$ and a parallel query complexity of $\sim 0.40/\varepsilon$ at 95% confidence. This performance is a factor of $1.1\times$ and $14\times$ improvement over Rall and Fuller [Quantum 7, 937 (2023)], for worst-case complexity, which to our knowledge is the best published result for amplitude estimation. The approach presented here provides a simple, robust, parallel method to performing QAE, with many possible avenues for improvement borrowing ideas from the wealth of literature in classical signal processing., Comment: 12 pages, 6 figures

We introduce two quantum algorithms to compute the Value at Risk (VaR) and Conditional Value at Risk (CVaR) of financial derivatives using quantum computers: the first by applying existing ideas from quantum risk analysis to derivative pricing, and the second based on a novel approach using Quantum Signal Processing (QSP). Previous work in the literature has shown that quantum advantage is possible in the context of individual derivative pricing and that advantage can be leveraged in a straightforward manner in the estimation of the VaR and CVaR. The algorithms we introduce in this work aim to provide an additional advantage by encoding the derivative price over multiple market scenarios in superposition and computing the desired values by applying appropriate transformations to the quantum system. We perform complexity and error analysis of both algorithms, and show that while the two algorithms have the same asymptotic scaling the QSP-based approach requires significantly fewer quantum resources for the same target accuracy. Additionally, by numerically simulating both quantum and classical VaR algorithms, we demonstrate that the quantum algorithm can extract additional advantage from a quantum computer compared to individual derivative pricing. Specifically, we show that under certain conditions VaR estimation can lower the latest published estimates of the logical clock rate required for quantum advantage in derivative pricing by up to $\sim 30$x. In light of these results, we are encouraged that our formulation of derivative pricing in the QSP framework may be further leveraged for quantum advantage in other relevant financial applications, and that quantum computers could be harnessed more efficiently by considering problems in the financial sector at a higher level.

With the current progress of quantum computing, quantum annealing is being introduced as a powerful method to solve hard computational problems. In this paper, we study the potential capability of quantum annealing in solving the phase unwrapping problem, an instance of hard computational problems. To solve the phase unwrapping problem using quantum annealing, we deploy the D-Wave Advantage machine which is currently the largest available quantum annealer. The structure of this machine, however, is not compatible with our problem graph structure. Consequently, the problem graph needs to be mapped onto the target (Pegasus) graph, and this embedding significantly affects the quality of the results. Based on our experiment and also D-Wave's reports, the lower chain lengths can result in a better performance of quantum annealing. In this paper, we propose a new embedding algorithm that has the lowest possible chain length for embedding the graph of the phase unwrapping problem onto the Pegasus graph. The obtained results using this embedding strongly outperform the results of Auto-embedding provided by D-Wave. Besides the phase unwrapping problem, this embedding can be used to embed any subset of our problem graph to the Pegasus graph.

Pricing financial derivatives on quantum computers typically includes quantum arithmetic components which contribute heavily to the quantum resources required by the corresponding circuits. In this manuscript, we introduce a method based on Quantum Signal Processing (QSP) to encode financial derivative payoffs directly into quantum amplitudes, alleviating the quantum circuits from the burden of costly quantum arithmetic. Compared to current state-of-the-art approaches in the literature, we find that for derivative contracts of practical interest, the application of QSP significantly reduces the required resources across all metrics considered, most notably the total number of T-gates by $\sim 16$x and the number of logical qubits by $\sim 4$x. Additionally, we estimate that the logical clock rate needed for quantum advantage is also reduced by a factor of $\sim 5$x. Overall, we find that quantum advantage will require $4.7$k logical qubits, and quantum devices that can execute $10^9$ T-gates at a rate of $45$MHz. While in this work we focus specifically on the payoff component of the derivative pricing process where the method we present is most readily applicable, similar techniques can be employed to further reduce the resources in other applications, such as state preparation.

A way to improve the accuracy of the spectral properties in density functional theory (DFT) is to impose constraints on the effective, Kohn-Sham (KS), local potential [J. Chem. Phys. {\bf 136}, 224109 (2012)]. As illustrated, a convenient variational quantity in that approach is the ``screening'' or ``electron repulsion'' density, $\rho_{\rm rep}$, corresponding to the local, KS Hartree, exchange and correlation potential through Poisson's equation. Two constraints, applied to this minimization, largely remove self-interaction errors from the effective potential: (i) $\rho_{\rm rep}$ integrates to $N-1$, where $N$ is the number of electrons, and (ii) $\rho_{\rm rep}\geq 0$ everywhere. In the present work, we introduce an effective ``screening'' amplitude, $f$, as the variational quantity, with the screening density being $\rho_{\rm rep}=f^2$. In this way, the positivity condition for $\rho_{\rm rep}$ is automatically satisfied and the minimization problem becomes more efficient and robust. We apply this technique to molecular calculations employing several approximations in DFT and in reduced density matrix functional theory. We find that the proposed development is an accurate, yet robust, variant of the constrained effective potential method.

Recent years have seen a rise in the popularity of quality diversity (QD) optimization, a branch of optimization that seeks to find a collection of diverse, high-performing solutions to a given problem. To grow further, we believe the QD community faces two challenges: developing a framework to represent the field's growing array of algorithms, and implementing that framework in software that supports a range of researchers and practitioners. To address these challenges, we have developed pyribs, a library built on a highly modular conceptual QD framework. By replacing components in the conceptual framework, and hence in pyribs, users can compose algorithms from across the QD literature; equally important, they can identify unexplored algorithm variations. Furthermore, pyribs makes this framework simple, flexible, and accessible, with a user-friendly API supported by extensive documentation and tutorials. This paper overviews the creation of pyribs, focusing on the conceptual framework that it implements and the design principles that have guided the library's development., Comment: Published as a conference paper at the 2023 Genetic and Evolutionary Computation Conference (GECCO '23); Pyribs is available at https://pyribs.org

Franke's reconstruction functor R is known to provide examples of triangulated equivalences between homotopy categories of stable model categories, which are exotic in the sense that the underlying model categories are not Quillen equivalent. We show that, while not being a tensor-triangulated functor in general, R is compatible with monoidal products., Comment: 39 pages, minor changes, to appear in Algebraic & Geometric Topology

We study quantum interior point methods (QIPMs) for second-order cone programming (SOCP), guided by the example use case of portfolio optimization (PO). We provide a complete quantum circuit-level description of the algorithm from problem input to problem output, making several improvements to the implementation of the QIPM. We report the number of logical qubits and the quantity/depth of non-Clifford T-gates needed to run the algorithm, including constant factors. The resource counts we find depend on instance-specific parameters, such as the condition number of certain linear systems within the problem. To determine the size of these parameters, we perform numerical simulations of small PO instances, which lead to concrete resource estimates for the PO use case. Our numerical results do not probe large enough instance sizes to make conclusive statements about the asymptotic scaling of the algorithm. However, already at small instance sizes, our analysis suggests that, due primarily to large constant pre-factors, poorly conditioned linear systems, and a fundamental reliance on costly quantum state tomography, fundamental improvements to the QIPM are required for it to lead to practical quantum advantage., Comment: 40 pages, 15 figures. v2: minor corrections and updates to match journal version

We derive a closed-form expression capturing the degree of Relative Risk Aversion (RRA) of investors for non-"fair" lotteries. We argue that our formula is superior to earlier methods that have been proposed, as it is a function of only three variables. Namely, the Treasury yields, the returns and the market capitalization of a specific market index. Our formula, is tested on CAC 40, EURO, S&P 500 and STOXX 600, with respect to the market capitalization of each index, for different time periods. We deduce that the investors in these markets exhibit Decreasing Absolute Risk Aversion (DARA) through all the different time periods that we consider, while the degree of RRA has altered between being constant, decreasing or increasing. Furthermore, we propose a simple and intuitive way to measure the degree to which a wrong assumption with respect to the utility function of an investor will affect the structure of his portfolio. Our method is built on a two asset portfolio framework. Namely, a portfolio consisting of one risky and one risk-free asset. Applying our method, the empirical findings indicate that the weight invested in the risky asset varies substantially even among utility functions with similar characteristics.

We study the necessary and sufficient conditions under which the Mean-Variance Criterion (MVC) is equivalent to the Maximum Expected Utility Criterion (MEUC), for two lotteries. Based on Chamberlain (1983), we conclude that the MVC is equivalent to the Second-order Stochastic Dominance Rule (SSDR) under any symmetric Elliptical distribution. We then discuss the work of Schuhmacher et al. (2021). Although their theoretical findings deduce that the Mean-Variance Analysis remains valid under Skew-Elliptical distributions, we argue that this does not entail that the MVC coincides with the SSDR. In fact, generating multiple MV-pairs that follow a Skew-Normal distribution it becomes evident that the MVC fails to coincide with the SSDR for some types of risk-averse investors. In the second part of this work, we examine the premise of Levy and Markowitz (1979) that "the MVC deduces the maximization of the expected utility of an investor, under any approximately quadratic utility function, without making any further assumption on the distribution of the lotteries". Using Monte Carlo Simulations, we find out that the set of approximately quadratic utility functions is too narrow. Specifically, our simulations indicate that $\log{(a+Z)}$ and $(1+Z)^a$ are almost quadratic, while $-e^{-a(1+Z)}$ and $-(1+Z)^{-a}$ fail to approximate a quadratic utility function under either an Extreme Value or a Stable Pareto distribution.

Spatiotemporal sculpturing of light pulse with ultimately sophisticated structures represents the holy grail of the human everlasting pursue of ultrafast information transmission and processing as well as ultra-intense energy concentration and extraction. It also holds the key to unlock new extraordinary fundamental physical effects. Traditionally, spatiotemporal light pulses are always treated as spatiotemporally separable wave packet as solution of the Maxwell's equations. In the past decade, however, more generalized forms of spatiotemporally nonseparable solution started to emerge with growing importance for their striking physical effects. This roadmap intends to highlight the recent advances in the creation and control of increasingly complex spatiotemporally sculptured pulses, from spatiotemporally separable to complex nonseparable states, with diverse geometric and topological structures, presenting a bird's eye viewpoint on the zoology of spatiotemporal light fields and the outlook of future trends and open challenges., Comment: This is the version of the article before peer review or editing, as submitted by an author to Journal of Optics. IOP Publishing Ltd is not responsible for any errors or omissions in this version of the manuscript or any version derived from it