Related papers: Designing lattice structures with maximal nearest-…
By focusing on the X-matrix part of a density matrix of two qubits we provide an algebraic lower bound for the concurrence. The lower bound is generalized for cases beyond two qubits and can serve as a sufficient condition for…
In this paper we describe an algorithm that quickly computes a maximal a-valued lattice in an F-vector space equipped with a non-degenerate bilinear form, where a is a fractional ideal in a number field F. We then apply this construction to…
Most differential privacy mechanisms are applied (i.e., composed) numerous times on sensitive data. We study the design of optimal differential privacy mechanisms in the limit of a large number of compositions. As a consequence of the law…
We prove that enhanced entanglement percolation via lattice transformation is possible even if the new lattice is more poorly connected in that: i) the coordination number (a local property) decreases, or ii) the classical percolation…
We consider the problem of finding the closest lattice point to a vector in n-dimensional Euclidean space when each component of the vector is available at a distinct node in a network. Our objectives are (i) minimize the communication cost…
Multipartite entanglement holds great importance in quantum information processing. The distribution of entanglement among subsystems can be characterized by monogamy relations. Based on the $\beta$th power of concurrence and negativity, we…
Near isometric orthogonal embeddings to lower dimensions are a fundamental tool in data science and machine learning. In this paper, we present the construction of such embeddings that minimizes the maximum distortion for a given set of…
The advent of quantum computing necessitates the transition of worldwide cryptosystems to post-quantum cryptography (PQC), which is founded upon the problem of finding short vectors in high-dimensional structured lattices. It is assumed…
In the quantum world correlations can take form of entanglement which is known to be monogamous. In this work we show that another type of correlations, indistinguishability, is also restricted by some form of monogamy. Namely, if particles…
We introduce a computational framework for the topology optimization of cellular structures with spatially varying architecture, which is applied to functionally graded truss lattices under quasistatic loading. We make use of a first-order…
We use computer simulation to study the layer-by-layer growth of particle structures in a lattice gas, taking the number of incorporated vacancies as a measure of the quality of the grown structure. By exploiting a dynamic scaling relation…
Addressable self-assembly is the formation of a target structure from a set of unique molecular or colloidal building-blocks, each of which occupies a defined location in the target. The requirement that each type of building-block appears…
In this paper we present a comprehensive study on the multi-objective optimization of two-dimensional porous phononic crystals (PnCs) in both square and triangular lattices with the reduced topology symmetry of the unit-cell. The fast…
In this paper, we propose a novel class of parameterized entanglement measures which are named as $G_\omega$-concurrence ($G_\omega$C) ($0<\omega\leq1$), and demonstrate comprehensively that they satisfy all the necessary axiomatic…
Quantum entanglement is a crucial resource in quantum information processing, advancing quantum technologies. The greater the uncertainty in subsystems' pure states, the stronger the quantum entanglement between them. From the dual form of…
We investigate entanglement of strongly interacting fermions in spatially inhomogeneous environments. To quantify entanglement in the presence of spatial inhomogeneity, we propose a local-density approximation (LDA) to the entanglement…
We devise an inverse statistical-mechanical methodology to find optimized interaction potentials that lead spontaneously to a target many-particle configuration. Target structures can possess varying degrees of disorder, thus extending the…
We argue that a complete characterisation of quantum correlations in bipartite systems of many dimensions may require a quantity which, even for pure states, does not reduce to a single number. Subsequently, we introduce multi-dimensional…
We present a method of optimizing recently designed protocols for implementing an arbitrary nonlocal unitary gate acting on a bipartite system. These protocols use only local operations and classical communication with the assistance of…
We address differential privacy for fully distributed optimization subject to a shared inequality constraint. By co-designing the distributed optimization mechanism and the differential-privacy noise injection mechanism, we propose the…