Related papers: Quantum marginals, faces, and coatoms
Qubit-efficient optimization studies how large combinatorial problems can be addressed with quantum circuits whose width is far smaller than the number of logical variables. In quadratic unconstrained binary optimization (QUBO), objective…
Traditional quantum physics solves ground states for a given Hamiltonian, while quantum information science asks for the existence and construction of certain Hamiltonians for given ground states. In practical situations, one would be…
This paper concerns the characterisation of second order marginals for random sets in a discrete setting. Under the instance of unit covariances, this problem possesses a combinatorial symmetry, exploited jointly in the companion paper to…
We search for faces of the convex set consisting of all separable states, which are affinely isomorphic to simplices, to get separable states with unique decompositions. In the two-qutrit case, we found that six product vectors spanning a…
Near term quantum devices have recently garnered significant interest as promising candidates for investigating difficult-to-probe regimes in many-body physics. To this end, various qubit encoding schemes targeting second quantized…
Limits of densities belonging to an exponential family appear in many applications, {e.g.} Gibbs models in Statistical Physics, relaxed combinatorial optimization, coding theory, critical likelihood computations, Bayes priors with singular…
The quantum marginal problem asks, given a set of reduced quantum states of a multipartite system, whether there exists a joint quantum state consistent with these reduced states. The quantum marginal problem is known to be hard to solve in…
We present a basis-set-free approach to the variational quantum eigensolver using an adaptive representation of the spatial part of molecular wavefunctions. Our approach directly determines system-specific representations of qubit…
The construction of parent Hamiltonians that possess a given state as their ground state is a well-studied problem. In this work, we generalize this notion by considering simple quantum states and examining the local Hamiltonians that have…
Using a finite geometric framework for studying the pentagon and heptagon codes we show that the concepts of quantum secret sharing and contextuality can be studied in a nice and unified manner. The basic idea is a careful study of the…
Faces play a central role in the combinatorial and computational aspects of polyhedra. In this paper, we present the first formalization of faces of polyhedra in the proof assistant Coq. This builds on the formalization of a library…
In this paper, we consider polynomials associated with faces and internal quadrilaterals of a cuboctahedron and classify them under the requirement that they are consistent. These polynomials give rise to a system of partial difference…
Probabilistic graphical models such as Bayesian networks are widely used to model stochastic systems to perform various types of analysis such as probabilistic prediction, risk analysis, and system health monitoring, which can become…
Ever since entanglement was identified as a computational and cryptographic resource, effort has been made to find an efficient way to tell whether a given density matrix represents an unentangled, or separable, state. Essentially, this is…
We analyze faces generated by points in an arbitrary convex set and their relative algebraic interiors, which are nonempty as we shall prove. We show that by intersecting a convex set with a sublevel or level set of a generalized affine…
An observer-based Hamiltonian identification algorithm for quantum systems is proposed. For the 2-level case an exponential convergence result based on averaging arguments and some relevant transformations is provided. The convergence for…
This paper investigates the problem of listing faces of combinatorial polytopes, such as hypercubes, permutahedra, associahedra, and their generalizations. Firstly, we consider the face lattice, which is the inclusion order of all faces of…
Many-body entangled quantum states studied in condensed matter physics can be primary resources for quantum information, allowing any quantum computation to be realized using measurements alone, on the state. Such a universal state would be…
We present a simple quantum many-body system - a two-dimensional lattice of qubits with a Hamiltonian composed of nearest-neighbor two-body interactions - such that the ground state is a universal resource for quantum computation using…
By studying ``points of the underlying quantum groups''of coquasitriangular Hopf (face) algebras, we construct ribbon categories for each lattice models without spectral parameter of both vertex and face type. Also, we give a classification…