A combinatorial criterion for k-separability of multipartite Dicke states

We derive a combinatorial criterion for detecting k-separability of N-partite Dicke states. The criterion is efficiently computable and implementable without full state tomography. We give examples in which the criterion succeeds, where known criteria fail

On Greedy Algorithms for Binary de Bruijn Sequences

We propose a general greedy algorithm for binary de Bruijn sequences, called Generalized Prefer-Opposite (GPO) Algorithm, and its modifications. By identifying specific feedback functions and initial states, we demonstrate that most previously-known greedy algorithms that generate binary de Bruijn sequences are particular cases of our new algorithm

Drip Paintings and Fractal Analysis

It has been claimed [1-6] that fractal analysis can be applied to unambiguously characterize works of art such as the drip paintings of Jackson Pollock. This academic issue has become of more general interest following the recent discovery of a cache of disputed Pollock paintings. We definitively demonstrate here, by analyzing paintings by Pollock and others, that fractal criteria provide no information about artistic authenticity. This work has also led to two new results in fractal analysis of more general scientific significance. First, the composite of two fractals is not generally scale invariant and exhibits complex multifractal scaling in the small distance asymptotic limit. Second the statistics of box-counting and related staircases provide a new way to characterize geometry and distinguish fractals from Euclidean objects

The Hyperdeterminant and Triangulations of the 4-Cube

The hyperdeterminant of format 2 x 2 x 2 x 2 is a polynomial of degree 24 in 16 unknowns which has 2894276 terms. We compute the Newton polytope of this polynomial and the secondary polytope of the 4-cube. The 87959448 regular triangulations of the 4-cube are classified into 25448 D-equivalence classes, one for each vertex of the Newton polytope. The 4-cube has 80876 coarsest regular subdivisions, one for each facet of the secondary polytope, but only 268 of them come from the hyperdeterminant.Comment: 30 pages, 6 figures; An author's name changed, typos fixe

Entanglement of four qubit systems: a geometric atlas with polynomial compass I (the finite world)

We investigate the geometry of the four qubit systems by means of algebraic geometry and invariant theory, which allows us to interpret certain entangled states as algebraic varieties. More precisely we describe the nullcone, i.e., the set of states annihilated by all invariant polynomials, and also the so called third secant variety, which can be interpreted as the generalization of GHZ-states for more than three qubits. All our geometric descriptions go along with algorithms which allow us to identify any given state in the nullcone or in the third secant variety as a point of one of the 47 varieties described in the paper. These 47 varieties correspond to 47 non-equivalent entanglement patterns, which reduce to 15 different classes if we allow permutations of the qubits.Comment: 48 pages, 7 tables, 13 figures, references and remarks added (v2

On the singular homology of one class of simply-connected cell-like spaces

In our earlier papers we constructed examples of 2-dimensional nonaspherical simply-connected cell-like Peano continua, called {\sl Snake space}. In the sequel we introduced the functor $SC(-,-)$ defined on the category of all spaces with base points and continuous mappings. For the circle $S^1$, the space $SC(S^1, \ast)$ is a Snake space. In the present paper we study the higher-dimensional homology and homotopy properties of the spaces $SC(Z, \ast)$ for any path-connected compact spaces $Z$

Realization of universal nonadiabatic geometric control on decoherence-free qubits in the XY model

A fundamental requirement of quantum information processing is the protection from the adverse effects of decoherence and noise. Decoherence-free subspaces and geometric processing are important steps of quantum information protection. Here, we provide a new experimentally feasible scheme to combine decoherence-free subspaces with nonadiabatic geometric manipulations to attain a universal quantum computation. The proposed scheme is different from previous proposals and is based on the typical XY interaction coupling, which can be set up in various nano-engineered systems and therefore open up for realization of nonadiabatic holonomic quantum computation in decoherence-free subspaces.Comment: 21 pages, 5 figure