Related papers: Algorithmic design of self-assembling structures
The convexity of a scalar effective potential is a well known property, and, in the situation of spontaneous symmetry breaking, leads to the so-called Maxwell construction, characterised by a flat effective potential between the minima of…
We consider spaces of trial wavefunctions for ground states and edge excitations in the fractional quantum Hall effect that can be obtained in various ways. In one way, functions are obtained by analyzing the entanglement of the ground…
A method of quantum tomography of arbitrary spin particle states is developed on the basis of the root approach. It is shown that the set of mutually complementary distributions of angular momentum projections can be naturally described by…
We propose a new learning-based approach to solve ill-posed inverse problems in imaging. We address the case where ground truth training samples are rare and the problem is severely ill-posed - both because of the underlying physics and…
Dynamical systems exhibiting both PT and Supersymmetry are analyzed in a general scenario. It is found that, in an appropriate parameter domain, the ground state may or may not respect PT-symmetry. Interestingly, in the domain where…
We compute the effective potential for $\phi^4$ theory with a squeezed coherent state type of construct for the ground state. The method essentially consists in optimising the basis at zero and finite temperatures. The gap equation becomes…
We developed an inverse design framework enabling automated generation of stable multi-component crystal structures by optimizing the formation energies in the latent space based on reversible crystal graphs with continuous representation.…
Much of the theory of entanglement concerns the transformations that are possible to a state under local operations with classical communication (LOCC); however, this set of operations is complicated and difficult to describe…
Using supersymmetric quantum mechanics we develop a new method for constructing quasi-exactly solvable (QES) potentials with two known eigenstates. This method is extended for constructing conditionally-exactly solvable potentials (CES).…
We develop an adaptive method for quantum state preparation that utilizes randomness as an essential component and that does not require classical optimization. Instead, a cost function is minimized to prepare a desired quantum state…
Using a recent reformulation of quantum mechanics where the potential function is not required, we are able to obtain the energy spectrum and wave function associated with the infinite square well analytically. Therefore, this work…
We consider the problem of minimizing a composite convex function with two different access methods: an oracle, for which we can evaluate the value and gradient, and a structured function, which we access only by solving a convex…
Modern experimental methods enable the creation of self-assembly building blocks with tunable interactions, but optimally exploiting this tunability for the self-assembly of desired structures remains an important challenge. Many studies of…
Parallel and cyclic projection algorithms are proposed for minimizing the sum of a finite family of convex functions over the intersection of a finite family of closed convex subsets of a Hilbert space. These algorithms are of…
In the iterative algorithm recently proposed by Waxman for solving eigenvalue problems, we point out that the convergence rate may be improved. For many non-singular symmetric potentials which vanish asymptotically, a simple analytical…
Time-series analysis is fundamental for modeling and predicting dynamical behaviors from time-ordered data, with applications in many disciplines such as physics, biology, finance, and engineering. Measured time-series data, however, are…
We apply a notion of static renormalization to the preparation of entangled states for quantum computing, exploiting ideas from percolation theory. Such a strategy yields a novel way to cope with the randomness of non-deterministic quantum…
Sampling all ground states of a Hamiltonian with equal probability is a desired feature of a sampling algorithm, but recent studies indicate that common variants of transverse field quantum annealing sample the ground state subspace…
The algorithmic self-assembly of shapes has been considered in several models of self-assembly. For the problem of \emph{shape construction}, we consider an extended version of the Two-Handed Tile Assembly Model (2HAM), which contains…
Shape-morphing structures possess the ability to change their shapes from one state to another, and therefore, offer great potential for a broad range of applications. A typical paradigm of morphing is transforming from an initial…