The effects of disorder in dimerized quantum magnets in mean field approximations

15 p.

Symmetry restoration and quantumness reestablishment

A realistic quantum many-body system, characterized by a generic microscopic Hamiltonian, is accessible only through approximation methods. The mean field theories, as the simplest practices of approximation methods, commonly serve as a powerful tool, but unfortunately often violate the symmetry of the Hamiltonian. The conventional BCS theory, as an excellent mean field approach, violates the particle number conservation and completely erases quantumness characterized by concurrence and quantum discord between different modes. We restore the symmetry by using the projected BCS theory and the exact numerical solution and find that the lost quantumness is synchronously reestablished. We show that while entanglement remains unchanged with the particle numbers, quantum discord behaves as an extensive quantity with respect to the system size. Surprisingly, discord is hardly dependent on the interaction strengths. The new feature of discord offers promising applications in modern quantum technologies.

Sampling and learning the Mallows and Generalized Mallows models under the Cayley distance

[EN]The Mallows and Generalized Mallows models are compact yet powerful and natural ways of representing a probability distribution over the space of permutations. In this paper we deal with the problems of sampling and learning (estimating) such distributions when the metric on permutations is the Cayley distance. We propose new methods for both operations, whose performance is shown through several experiments. We also introduce novel procedures to count and randomly generate permutations at a given Cayley distance both with and without certain structural restrictions. An application in the field of biology is given to motivate the interest of this model.

Extending Distance-based Ranking Models In Estimation of Distribution Algorithms

Recently, probability models on rankings have been proposed in the field of estimation of distribution algorithms in order to solve permutation-based combinatorial optimisation problems. Particularly, distance-based ranking models, such as Mallows and Generalized Mallows under the Kendall’s-t distance, have demonstrated their validity when solving this type of problems. Nevertheless, there are still many trends that deserve further study. In this paper, we extend the use of distance-based ranking models in the framework of EDAs by introducing new distance metrics such as Cayley and Ulam. In order to analyse the performance of the Mallows and Generalized Mallows EDAs under the Kendall, Cayley and Ulam distances, we run them on a benchmark of 120 instances from four well known permutation problems. The conducted experiments showed that there is not just one metric that performs the best in all the problems. However, the statistical test pointed out that Mallows-Ulam EDA is the most stable algorithm among the studied proposals.

Digital Quantum Rabi and Dicke Models in Superconducting Circuits

We propose the analog-digital quantum simulation of the quantum Rabi and Dicke models using circuit quantum electrodynamics (QED). We find that all physical regimes, in particular those which are impossible to realize in typical cavity QED setups, can be simulated via unitary decomposition into digital steps. Furthermore, we show the emergence of the Dirac equation dynamics from the quantum Rabi model when the mode frequency vanishes. Finally, we analyze the feasibility of this proposal under realistic superconducting circuit scenarios.

Proposal and validation of methodologies for the categorisation of continuous variables in the development of prediction models

158 p.

Calibrating Analytical Models for Semilocal Strings

In this work we calibrate two different analytic models of semilocal strings by constraining the values of their free parameters. In order to do so, we use data obtained from the largest and most accurate field theory simulations of semilocal strings to date, and compare several key properties with the predictions of the models. As this is still work in progress, we present some preliminary results together with descriptions of the methodology we are using in the characterisation of semilocal string networks.