English
Related papers

Related papers: A State Polytope Decomposition Formula

200 papers

Motivated by the Kronecker product approximation technique, we have developed a very simple method to assess the inseparability of bipartite quantum systems, which is based on a realigned matrix constructed from the density matrix. For any…

Quantum Physics · Physics 2007-05-23 Kai Chen , Ling-An Wu

Dephasing of one-particle states in closed quantum dots is analyzed within the framework of random matrix theory and Master equation. Combination of this analysis with recent experiments on the magnetoconductance allows for the first time…

Mesoscale and Nanoscale Physics · Physics 2009-11-07 Eli Eisenberg , Karsten Held , Boris L. Altshuler

This paper presents a method for expressing the determinant of an N {\times} N complex block matrix in terms of its constituent blocks. The result allows one to reduce the determinant of a matrix with N^2 blocks to the product of the…

Rings and Algebras · Mathematics 2011-12-22 Philip D. Powell

The method of numerical symmetrization of state of identical particles proposed by us before is clarified and discussed.

High Energy Physics - Phenomenology · Physics 2008-11-26 Oleg Utyuzh , Grzegorz Wilk , Zbigniew Wlodarczyk

We propose a sufficient and necessary separability criterion for pure states in multipartite and high dimensional systems. Its main advantage is operational and computable. The obvious expressions of this criterion can be given out by the…

Quantum Physics · Physics 2007-05-23 An Min Wang

We present an understandable, efficient, and streamlined proof of the Holonomy Decomposition for finite transformation semigroups and automata. This constructive proof closely follows the existing computational implementation. Its novelty…

Group Theory · Mathematics 2015-08-27 Attila Egri-Nagy , Chrystopher L. Nehaniv

We construct atomic decompositions for crystals of type $C_{2}$ and define a charge statistic on them, thus providing positive combinatorial formulas for Kostka-Foulkes polynomials associated to them together with a natural geometric…

Representation Theory · Mathematics 2023-03-29 Leonardo Patimo , Jacinta Torres

A monolithic process is a single recursive equation with data parameters, which only uses non-determinism, action prefixing, and recursion. We present a technique that decomposes such a monolithic process into multiple processes where each…

Logic in Computer Science · Computer Science 2021-10-04 Maurice Laveaux , Tim A. C. Willemse

There is a simple formula for the Ehrhart polynomial of a cyclic polytope. The purpose of this paper is to show that the same formula holds for a more general class of polytopes, lattice-face polytopes. We develop a way of decomposing any…

Combinatorics · Mathematics 2007-05-23 Fu Liu

We present an approach of constructing invariants under local unitary transformations for multipartite quantum systems. The invariants constructed in this way can be complement to that in [Science 340 (2013) 1205-1208]. Detailed examples…

Quantum Physics · Physics 2015-06-23 Jing Wang , Ming Li , Shao-Ming Fei , Xianqing Li-Jost

The separability and entanglement of quantum mixed states in $\Cb^2 \otimes \Cb^3 \otimes \Cb^N$ composite quantum systems are investigated. It is shown that all quantum states $\rho$ with positive partial transposes and rank $r(\rho)\leq…

Quantum Physics · Physics 2009-11-10 S. M. Fei , X. H. Gao , X. H. Wang , Z. X. Wang , K. Wu

We show how the separability problem is dual to that of decomposing any given matrix into a conic combination of rank-one partial isometries, thus offering a duality approach different to the positive maps characterization problem. Several…

Quantum Physics · Physics 2007-05-23 D. Salgado , J. L. Sanchez-Gomez , M. Ferrero

The optimal state determination (or tomography) is studied for a composite system of two qubits when measurements can be performed on one of the qubits and interactions of the two qubits can be implemented. The goal is to minimize the…

Quantum Physics · Physics 2009-11-13 D. Petz , K. M. Hangos , A. Szanto , F. Szollosi

A slice decomposition is an expression of a homogeneous polynomial as a sum of forms with a linear factor. A strength decomposition is an expression of a homogeneous polynomial as a sum of reducible forms. The slice rank and strength of a…

Algebraic Geometry · Mathematics 2022-05-04 Arthur Bik , Alessandro Oneto

We describe a method for reconstructing multi-scale entangled states from a small number of efficiently-implementable measurements and fast post-processing. The method only requires single particle measurements and the total number of…

Quantum Physics · Physics 2014-12-02 Olivier Landon-Cardinal , David Poulin

Rook polynomials are a powerful tool in the theory of restricted permutations. It is known that the rook polynomial of any board can be computed recursively, using a cell decomposition technique of Riordan. In this paper, we give a new…

Combinatorics · Mathematics 2007-05-23 Abigail G. Mitchell

We present a review of the problem of finding out whether a quantum state of two or more parties is entangled or separable. After a formal definition of entangled states, we present a few criteria for identifying entangled states and…

Quantum Physics · Physics 2017-01-10 Sreetama Das , Titas Chanda , Maciej Lewenstein , Anna Sanpera , Aditi Sen De , Ujjwal Sen

We describe a decomposition of the Lie group of unitary evolutions for a bipartite quantum system of arbitrary dimensions. The decomposition is based on a recursive procedure which systematically uses the Cartan classification of the…

Quantum Physics · Physics 2015-06-26 Domenico D'Alessandro , Raffaele Romano

We obtain Lewenstein-Sanpera decomposition of iso-concurrence decomposable states of $2\otimes 2$ quantum systems. It is shown that in these systems average concurrence of the decomposition is equal to the concurrence of the state and also…

Quantum Physics · Physics 2007-05-23 S. J. Akhtarshenas , M. A. Jafarizadeh

We describe a technique to obtain linear descriptions for polytopes from extended formulations. The simple idea is to first define a suitable lifting function and then to find linear constraints that are valid for the polytope and guarantee…

Combinatorics · Mathematics 2011-09-06 Volker Kaibel , Andreas Loos