Related papers: Designing lattice structures with maximal nearest-…
Composite systems are large complex systems con- sisting of interconnected agents (subsystems). Agents in a com- posite system interact with each other towards performing an in- tended goal. Controllability is essential to achieve desired…
In this paper, we investigate the hierarchical structure of the $n$-partite quantum states. We present a whole set of hierarchical quantifications as a method of characterizing quantum states, which go beyond genuine multipartite…
In this paper we use the \textit{concurrence vector}, as a measure of entanglement, and investigate lower and upper bounds on the concurrence of a superposition of bipartite states as a function of the concurrence of the superposed states.…
Multipartite entanglement is an indispensable resource in quantum communication and computation, however, it is a challenging task to faithfully quantify this global property of multipartite quantum systems. In this work, we study the…
Nearest neighbour bosons possessing only onsite interactions do not form onsite bound pairs in their quantum walk due to fermionization. We obtain signatures of non-trivial onsite pairing in the quantum walk of strongly interacting two…
We study a system of ultra-cold atoms possessing long range interaction (e.g. dipole-dipole interaction) in a one dimensional optical lattice in the presence of a confining harmonic trap. We have shown that for large enough on-site and…
Most comparisons of preferences are instances of single-crossing dominance. We examine the lattice structure of single-crossing dominance, proving characterisation, existence and uniqueness results for minimum upper bounds of arbitrary sets…
We propose an optimisation method for the inverse structural design of self-assembly of anisotropic patchy particles. The anisotropic interaction can be expressed by the spherical harmonics of the surface pattern on a patchy particle, and…
We introduce with geometric means a density matrix decomposition of a multipartite quantum system of a finite dimension into two density matrices: a separable one, also known as the best separable approximation, and an essentially entangled…
This paper presents tractable reformulations of topology optimization problems of structures subject to frictionless unilateral contact conditions. Specifically, we consider stiffness maximization problems of trusses and continua. Based on…
Let C be the set of all possible quantum states. We study the convex subsets of C with attention focused on the lattice theoretical structure of these convex subsets and, as a result, find a framework capable of unifying several aspects of…
An acknowledged weakness of neural networks is their vulnerability to adversarial perturbations to the inputs. To improve the robustness of these models, one of the most popular defense mechanisms is to alternatively maximize the loss over…
Topological entanglements are abundant, and often detrimental, in polymeric systems in biology and materials science. Here we theoretically investigate the topological simplification of knots by diffusing slip-links (SLs), which may…
We study the short-time evolution of the bipartite entanglement in quantum lattice systems with local interactions in terms of the purity of the reduced density matrix. A lower bound for the purity is derived in terms of the eigenvalue…
In this paper, we investigate spin entanglement in the $XXZ$ model defined on a $d$-dimensional bipartite lattice. The concurrence, a measure of the entanglement between two spins, is analyzed. We prove rigorously that the ground state…
The main concern of this paper is how to define proper measures of multipartite entanglement for mixed quantum states. Since the structure of partial separability and multipartite entanglement is getting complicated if the number of…
Explicit expressions for the concurrence of all positive and trace-preserving ("stochastic") 1-qubit maps are presented. By a new method we find the relevant convex roof pattern. We conclude that two component optimal decompositions always…
Aligning lattices based on local stress distribution is crucial for achieving exceptional structural stiffness. However, this aspect has primarily been investigated under a single load condition, where stress in 2D can be described by two…
This article seeks to contribute to a nuanced understanding of the integration of Design Structure Matrix (DSM) and genetic algorithms in the context of Complex Systems modelling described within Model-Based System Engineering approach. By…
We study the dominating set problem in an online setting. An algorithm is required to guarantee competitiveness against an adversary that reveals the input graph one node at a time. When a node is revealed, the algorithm learns about the…