Approaching the Ground State of a Quantum Spin Glass using a Zero-Temperature Quantum Monte Carlo

Here we discuss the annealing behavior of an infinite-range $\pm J$ Ising spin glass in presence of a transverse field using a zero-temperature quantum Monte Carlo. Within the simulation scheme, we demonstrate that quantum annealing not only helps finding the ground state of a classical spin glass, but can also help simulating the ground state of a quantum spin glass, in particularly, when the transverse field is low, much more efficiently.Comment: 8 pages, 6 fig

Thermoconvection in magnetized ferrofluids: the influence of boundaries with finite heat conductivity

Realistic boundaries of finite heat conductivity Realistic boundaries of finite heat conductivity for thermoconvection in a Rayleigh-B\'enard setup with magnetized ferrofluids are investigated. A linear stability analysis of the conductive state is performed with a shooting method. It shows that the critical wave number is for any magnetic field stronly influenced by the conductivity of the boundaries. Linear as well as nonlinear coefficients of a Ginzburg Landau amplitude equation for convection shortly above the onset are evaluated as functions of the magnetic Rayleigh number, the boundary conductivities, and the fluid Prandtl number.Comment: 10 pages, 9figure

Quantum Computation of a Complex System : the Kicked Harper Model

The simulation of complex quantum systems on a quantum computer is studied, taking the kicked Harper model as an example. This well-studied system has a rich variety of dynamical behavior depending on parameters, displays interesting phenomena such as fractal spectra, mixed phase space, dynamical localization, anomalous diffusion, or partial delocalization, and can describe electrons in a magnetic field. Three different quantum algorithms are presented and analyzed, enabling to simulate efficiently the evolution operator of this system with different precision using different resources. Depending on the parameters chosen, the system is near-integrable, localized, or partially delocalized. In each case we identify transport or spectral quantities which can be obtained more efficiently on a quantum computer than on a classical one. In most cases, a polynomial gain compared to classical algorithms is obtained, which can be quadratic or less depending on the parameter regime. We also present the effects of static imperfections on the quantities selected, and show that depending on the regime of parameters, very different behaviors are observed. Some quantities can be obtained reliably with moderate levels of imperfection, whereas others are exponentially sensitive to imperfection strength. In particular, the imperfection threshold for delocalization becomes exponentially small in the partially delocalized regime. Our results show that interesting behavior can be observed with as little as 7-8 qubits, and can be reliably measured in presence of moderate levels of internal imperfections

Nonaffine rubber elasticity for stiff polymer networks

We present a theory for the elasticity of cross-linked stiff polymer networks. Stiff polymers, unlike their flexible counterparts, are highly anisotropic elastic objects. Similar to mechanical beams stiff polymers easily deform in bending, while they are much stiffer with respect to tensile forces (``stretching''). Unlike in previous approaches, where network elasticity is derived from the stretching mode, our theory properly accounts for the soft bending response. A self-consistent effective medium approach is used to calculate the macroscopic elastic moduli starting from a microscopic characterization of the deformation field in terms of ``floppy modes'' -- low-energy bending excitations that retain a high degree of non-affinity. The length-scale characterizing the emergent non-affinity is given by the ``fiber length'' $l_f$, defined as the scale over which the polymers remain straight. The calculated scaling properties for the shear modulus are in excellent agreement with the results of recent simulations obtained in two-dimensional model networks. Furthermore, our theory can be applied to rationalize bulk rheological data in reconstituted actin networks.Comment: 12 pages, 10 figures, revised Section II

Almost-Tight Distributed Minimum Cut Algorithms

We study the problem of computing the minimum cut in a weighted distributed message-passing networks (the CONGEST model). Let $\lambda$ be the minimum cut, $n$ be the number of nodes in the network, and $D$ be the network diameter. Our algorithm can compute $\lambda$ exactly in $O((\sqrt{n} \log^{*} n+D)\lambda^4 \log^2 n)$ time. To the best of our knowledge, this is the first paper that explicitly studies computing the exact minimum cut in the distributed setting. Previously, non-trivial sublinear time algorithms for this problem are known only for unweighted graphs when $\lambda\leq 3$ due to Pritchard and Thurimella's $O(D)$-time and $O(D+n^{1/2}\log^* n)$-time algorithms for computing $2$-edge-connected and $3$-edge-connected components. By using the edge sampling technique of Karger's, we can convert this algorithm into a $(1+\epsilon)$-approximation $O((\sqrt{n}\log^{*} n+D)\epsilon^{-5}\log^3 n)$-time algorithm for any $\epsilon>0$. This improves over the previous $(2+\epsilon)$-approximation $O((\sqrt{n}\log^{*} n+D)\epsilon^{-5}\log^2 n\log\log n)$-time algorithm and $O(\epsilon^{-1})$-approximation $O(D+n^{\frac{1}{2}+\epsilon} \mathrm{poly}\log n)$-time algorithm of Ghaffari and Kuhn. Due to the lower bound of $\Omega(D+n^{1/2}/\log n)$ by Das Sarma et al. which holds for any approximation algorithm, this running time is tight up to a $\mathrm{poly}\log n$ factor. To get the stated running time, we developed an approximation algorithm which combines the ideas of Thorup's algorithm and Matula's contraction algorithm. It saves an $\epsilon^{-9}\log^{7} n$ factor as compared to applying Thorup's tree packing theorem directly. Then, we combine Kutten and Peleg's tree partitioning algorithm and Karger's dynamic programming to achieve an efficient distributed algorithm that finds the minimum cut when we are given a spanning tree that crosses the minimum cut exactly once

Adaptive online deployment for resource constrained mobile smart clients

Nowadays mobile devices are more and more used as a platform for applications. Contrary to prior generation handheld devices configured with a predefined set of applications, today leading edge devices provide a platform for flexible and customized application deployment. However, these applications have to deal with the limitations (e.g. CPU speed, memory) of these mobile devices and thus cannot handle complex tasks. In order to cope with the handheld limitations and the ever changing device context (e.g. network connections, remaining battery time, etc.) we present a middleware solution that dynamically offloads parts of the software to the most appropriate server. Without a priori knowledge of the application, the optimal deployment is calculated, that lowers the cpu usage at the mobile client, whilst keeping the used bandwidth minimal. The information needed to calculate this optimum is gathered on the fly from runtime information. Experimental results show that the proposed solution enables effective execution of complex applications in a constrained environment. Moreover, we demonstrate that the overhead from the middleware components is below 2%

Monomer-dimer model in two-dimensional rectangular lattices with fixed dimer density

The classical monomer-dimer model in two-dimensional lattices has been shown to belong to the \emph{``#P-complete''} class, which indicates the problem is computationally ``intractable''. We use exact computational method to investigate the number of ways to arrange dimers on $m \times n$ two-dimensional rectangular lattice strips with fixed dimer density $\rho$. For any dimer density $0 < \rho < 1$, we find a logarithmic correction term in the finite-size correction of the free energy per lattice site. The coefficient of the logarithmic correction term is exactly -1/2. This logarithmic correction term is explained by the newly developed asymptotic theory of Pemantle and Wilson. The sequence of the free energy of lattice strips with cylinder boundary condition converges so fast that very accurate free energy $f_2(\rho)$ for large lattices can be obtained. For example, for a half-filled lattice, $f_2(1/2) = 0.633195588930$, while $f_2(1/4) = 0.4413453753046$ and $f_2(3/4) = 0.64039026$. For $\rho < 0.65$, $f_2(\rho)$ is accurate at least to 10 decimal digits. The function $f_2(\rho)$ reaches the maximum value $f_2(\rho^*) = 0.662798972834$ at $\rho^* = 0.6381231$, with 11 correct digits. This is also the \md constant for two-dimensional rectangular lattices. The asymptotic expressions of free energy near close packing are investigated for finite and infinite lattice widths. For lattices with finite width, dependence on the parity of the lattice width is found. For infinite lattices, the data support the functional form obtained previously through series expansions.Comment: 15 pages, 5 figures, 5 table

Study of multi black hole and ring singularity apparent horizons

We study critical black hole separations for the formation of a common apparent horizon in systems of $N$ - black holes in a time symmetric configuration. We study in detail the aligned equal mass cases for $N=2,3,4,5$, and relate them to the unequal mass binary black hole case. We then study the apparent horizon of the time symmetric initial geometry of a ring singularity of different radii. The apparent horizon is used as indicative of the location of the event horizon in an effort to predict a critical ring radius that would generate an event horizon of toroidal topology. We found that a good estimate for this ring critical radius is $20/(3\pi) M$. We briefly discuss the connection of this two cases through a discrete black hole 'necklace' configuration.Comment: 31 pages, 21 figure

Topological Speed Limits to Network Synchronization

We study collective synchronization of pulse-coupled oscillators interacting on asymmetric random networks. We demonstrate that random matrix theory can be used to accurately predict the speed of synchronization in such networks in dependence on the dynamical and network parameters. Furthermore, we show that the speed of synchronization is limited by the network connectivity and stays finite, even if the coupling strength becomes infinite. In addition, our results indicate that synchrony is robust under structural perturbations of the network dynamics.Comment: 5 pages, 3 figure

Spectrum of the Dirac Operator and Multigrid Algorithm with Dynamical Staggered Fermions

Complete spectra of the staggered Dirac operator \Dirac are determined in quenched four-dimensional $SU(2)$ gauge fields, and also in the presence of dynamical fermions. Periodic as well as antiperiodic boundary conditions are used. An attempt is made to relate the performance of multigrid (MG) and conjugate gradient (CG) algorithms for propagators with the distribution of the eigenvalues of~\Dirac. The convergence of the CG algorithm is determined only by the condition number~$\kappa$ and by the lattice size. Since~$\kappa$'s do not vary significantly when quarks become dynamic, CG convergence in unquenched fields can be predicted from quenched simulations. On the other hand, MG convergence is not affected by~$\kappa$ but depends on the spectrum in a more subtle way.Comment: 19 pages, 8 figures, HUB-IEP-94/12 and KL-TH 19/94; comes as a uuencoded tar-compressed .ps-fil