Results 1  10
of
111
New Invariants and Separability Criterion of the Mixed States: Multipartite Case
, 2001
"... We introduce algebraic sets in the products of the complex projective spaces for the mixed states in a multipartite quantum systems as their invariants under local unitary operations. The algebraic sets have to be the union of the linear subspaces if the mixed state is separable, and thus we give a ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
important ingredients and resources of quantum infromation processing(see [1],[2]), and thus stimulated tremendous studies of quantum entanglements of both bipartite and multipartite systems, for a survey we refer to [3],[8] 1 and [9]. For multipartite case, the criterion of PeresHorodecki said that a
The Minimum Size of Unextendible Product Bases in the Bipartite Case (and Some Multipartite Cases)
, 2013
"... ..."
Generalized multipartitioning
 In Second Annual Los Alamos Computer Science Institute (LACSI) Sy mposisum
, 2001
"... Multipartitioning is a strategy for partitioning multidimensional arrays among a collection of processors. With multipartitioning, computations that require solving onedimensional recurrences along each dimension of a multidimensional array can be parallelized effectively. Previous techniques for ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
that computes an optimal multipartitioning for this general case, which enables multipartitioning to be used for performing efficient parallelizations of linesweep computations under arbitrary conditions. Finally, we describe a prototype implementation of generalized multipartitioning in the Rice dHPF compiler
On bipartite and multipartite . . .
, 2000
"... In this paper,we introduce the maximum edge biclique problem in bipartite graphs and the edge/node weighted multipartite clique problem in multipartite graphs. Our motivation for studying these problems came from abstractions of real manufacturing problems in the computer industry and from formal co ..."
Abstract
 Add to MetaCart
In this paper,we introduce the maximum edge biclique problem in bipartite graphs and the edge/node weighted multipartite clique problem in multipartite graphs. Our motivation for studying these problems came from abstractions of real manufacturing problems in the computer industry and from formal
Noncontextuality in multipartite entanglement
 J. Phys. A: Math. Gen
, 2005
"... Abstract. We discuss several multiport interferometric preparation and measurement configurations and show that they are noncontextual. Generalizations to the n particle case are discussed. ..."
Abstract

Cited by 11 (11 self)
 Add to MetaCart
Abstract. We discuss several multiport interferometric preparation and measurement configurations and show that they are noncontextual. Generalizations to the n particle case are discussed.
Noncontextuality in multipartite entanglement
"... Abstract. We discuss several multiport interferometric preparation and measurementconfigurations and show that they are noncontextual. Generalizations to the n particle case are discussed. ..."
Abstract
 Add to MetaCart
Abstract. We discuss several multiport interferometric preparation and measurementconfigurations and show that they are noncontextual. Generalizations to the n particle case are discussed.
Multipartite Moore Digraphs
, 2006
"... We derive some Moorelike bounds for multipartite digraphs, which extend those of bipartite digraphs, under the assumption that every vertex of a given partite set is adjacent to the same number δ of vertices in each of the other independent sets. We determine when a Moore multipartite digraph is we ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We derive some Moorelike bounds for multipartite digraphs, which extend those of bipartite digraphs, under the assumption that every vertex of a given partite set is adjacent to the same number δ of vertices in each of the other independent sets. We determine when a Moore multipartite digraph
Multipartite entanglement measures
"... the structure of entanglement (interesting for more than two subsystems) the qualification of entanglement (separability criteria) the quantification of entanglement (entanglement measures) These are difficult for mixed states of more than two subsystems. Here we present well motivated answers for t ..."
Abstract
 Add to MetaCart
for these questions. We recall the bipartite case, we show the tripartite case in details, and we refer mainly to [1] for the npartite case. 2. Setting the stage state vector: ψ 〉 ∈ H (normalized) pure state: pi = ψ〉〈ψ  ∈ P mixed state (of an ensemble): % = j pjpij ∈ D = ConvP mixedness: e.g. von Neumann
Generalized multipartitioning for multidimensional arrays
 In Proceedings of the International Parallel and Distributed Processing Symposium, Fort Lauderdale, FL
, 2002
"... Multipartitioning is a strategy for parallelizing computations that require solving 1D recurrences along each dimension of a multidimensional array. Previous techniques for multipartitioning yield efficient parallelizations over 3D domains only when the number of processors is a perfect square. Thi ..."
Abstract

Cited by 18 (2 self)
 Add to MetaCart
. This paper considers the general problem of computing multipartitionings for ddimensional data volumes on an arbitrary number of processors. We describe an algorithm that computes an optimal multipartitioning onto all of the processors for this general case. Finally, we describe how we extended the Rice d
DENSITY CONDITIONS FOR TRIANGLES IN MULTIPARTITE GRAPHS
 COMBINATORICA 26 (2) (2006) 121–131
, 2006
"... We consider the problem of finding a large or dense trianglefree subgraph in a given graph G. In response to a question of P. Erdős, we prove that, if the minimum degree of G is at least 9V (G)/10, the largest trianglefree subgraphs are precisely the largest bipartite subgraphs in G. We investi ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
investigate in particular the case where G is a complete multipartite graph. We prove that a finite tripartite graph with all edge densities greater than the golden ratio has a triangle and that this bound is best possible. Also we show that an infinitepartite graph with finite parts has a triangle, provided
Results 1  10
of
111