Related papers: Fast optimization algorithms and the cosmological …
We study spatial search with continuous-time quantum walks on real-world complex networks. We use smaller replicas of the Internet network obtained with a recent geometric renormalization method introduced by Garc\'ia-P\'erez et al., Nat.…
There has been increasing interest in developing efficient quantum algorithms for hard classical problems. The Network Signal Coordination (NSC) problem is one such problem known to be NP complete. We implement Grover's search algorithm to…
The cosmological constant problem is usually considered an inevitable feature of any effective theory capturing well-tested gravitational and matter physics, without regard to the details of short-distance gravitational couplings. In this…
In the paper, the global optimization problem of a multidimensional "black-box" function satisfying the Lipschitz condition over a hyperinterval with an unknown Lipschitz constant is considered. A new efficient algorithm for solving this…
The cosmological constant and its phenomenology remain among the greatest puzzles in theoretical physics. We review how modifications of Einstein's general relativity could alleviate the different problems associated with it that result…
The value of the cosmological constant arising from a crystalline model for vacuum cosmic space with lattice parameter of the order of the neutron radius [1] has been calculated. The model allows to solve, in an easy way, the problem of the…
One hope to solve the cosmological constant problem is to identify a symmetry principle, based on which the cosmological constant can be reduced either to zero, or to a tiny value. Here, we note that requiring that the vacuum state is…
Computing an optimal cycle in a given homology class, also referred to as the homology localization problem, is known to be an NP-hard problem in general. Furthermore, there is currently no known optimality criterion that localizes classes…
This paper investigates and bounds the expected solution quality of combinatorial optimization problems when feasible solutions are chosen at random. Loose general bounds are discovered, as well as families of combinatorial optimization…
The nonlinear space-fractional problems often allow multiple stationary solutions, which can be much more complicated than the corresponding integer-order problems. In this paper, we systematically compute the solution landscapes of…
We have recently introduced an approach for studying perturbatively classical and quantum canonical general relativity. The perturbative technique appears to preserve many of the attractive features of the non-perturbative quantization…
The cosmological constant and many other possible origins for acceleration of the cosmic expansion possess variations in the dark energy properties slow on the Hubble time scale. Given that models with more rapid variation, or even phase…
Recent astronomical observations indicate that the Universe is presently almost flat and undergoing a period of accelerated expansion. Basing on Einstein's general relativity all these observations can be explained by the hypothesis of a…
In this note we investigate the relationship between worst-case quantum query complexity and average-case classical query complexity. Specifically, we show that if a quantum computer can evaluate a total Boolean function f with bounded…
Universe structure emerges in the unreduced, complex-dynamical interaction process with the simplest initial configuration (two attracting homogeneous fields). The unreduced interaction analysis avoiding any perturbative model gives…
We start with a brief account of the latest analysis of the Oklo phenomenon providing the still most stringent constraint on time-variability of the fine- structure constant $\alpha$. Comparing this with the recent result from the…
We study possible advantages of randomized and quantum computing over deterministic computing for scalar initial-value problems for ordinary differential equations of order k. For systems of equations of the first order this question has…
In a quest to explain the small value of the today's cosmological constant, following the approach introduced in [1], we show that the theoretical value of cosmological constant is consistent with its observational value. In more detail, we…
In the number partitioning problem (NPP) one aims to partition a given set of $N$ real numbers into two subsets with approximately equal sum. The NPP is a well-studied optimization problem and is famous for possessing a…
After a short history of the $\Lambda$-term it is explained why the (effective) cosmological constant is expected to obtain contributions from short-distance-physics, corresponding to an energy scale of at least 100 GeV. The actual tiny…