Related papers: Entanglement in eight-qubit graph states
Quantifying the entanglement generation of a multipartite unitary operation is a key problem in quantum information processing. We introduce the definition of multipartite entangling, assisted entangling, and disentangling power, which is a…
Graph states are quantum states that can be described by a stabilizer formalism and play an important role in quantum information processing. We consider the action of local unitary operations on graph states and hypergraph states. We focus…
All the states of N qubits can be classified into N-1 entanglement classes from 2-entangled to N-entangled (fully entangled) states. Each class of entangled states is characterized by an entanglement index that depends on the partition of…
We consider a pure 2m-qubit initial state to evolve under a particular quantum me- chanical spin Hamiltonian, which can be written in terms of the adjacency matrix of the Johnson network J(2m;m). Then, by using some techniques such as…
Reiman produced a quadratic inequality for the size of bipartite graphs of girth six. We get its counterpart for girth eight, a cubic inequality. It is optimal in as far as it admits the algebraic structure of generalized quadrangles as…
We introduce a new family of models for measurement-based quantum computation which are deterministic and approximately universal. The resource states which play the role of graph states are prepared via 2-qubit gates of the form…
I consider deterministic distinguishability of a set of orthogonal, bipartite states when only a single copy is available and the parties are restricted to local operations and classical communication, but with the additional requirement…
Graph states are a key resource for a number of applications in quantum information theory. Due to the inherent noise in noisy intermediate-scale quantum (NISQ) era devices, it is important to understand the effects noise has on the…
The compositional techniques of categorical quantum mechanics are applied to analyse 3-qubit quantum entanglement. In particular the graphical calculus of complementary observables and corresponding phases due to Duncan and one of the…
In [Phys. Rev. A 69, 022316 (2004)] we presented a description of the action of local Clifford operations on graph states in terms of a graph transformation rule, known in graph theory as \emph{local complementation}. It was shown that two…
This thesis is an attempt to enhance understanding of the following questions A- Given a multipartite quantum state (possibly mixed), how to find out whether it is entangled or separable? (Detection of entanglement.) B- Given an entangled…
This thesis explores the use of entangled states in quantum computation and quantum information science. Entanglement, a quantum phenomenon with no classical counterpart, has been identified as an important and quantifiable resource in many…
The $N$-qubit Dicke states $|D^N_k\rangle$, of Hamming-weight $k$, are a class of entangled states which play an important role in quantum algorithm optimization. We present a general calculation of entanglement entropy in Dicke states,…
The capacity of a quantum gate to produce entangled states on a bipartite system is quantified in terms of the entangling power. This quantity is defined as the average of the linear entropy of entanglement of the states produced after…
A deep understanding of quantum entanglement is vital for advancing quantum technologies. The strength of entanglement can be quantified by counting the degrees of freedom that are entangled, which results in a quantity called Schmidt…
Graph states are an important class of multipartite entangled states. Previous experimental generation of graph states and in particular the Greenberger-Horne-Zeilinger (GHZ) states in linear optics quantum information schemes is subjected…
We examine the following problem: given a collection of Clifford gates, describe the set of unitaries generated by circuits composed of those gates. Specifically, we allow the standard circuit operations of composition and tensor product,…
We propose schemes to extract arbitrary graph states from two-dimensional cluster states by locally manipulating the qubits solely via single-qubit measurements. We introduce graph state manipulation tools that allow one to increase the…
Entanglement measures quantify the amount of quantum entanglement that is contained in quantum states. Typically, different entanglement measures do not have to be partially ordered. The presence of a definite partial order between two…
We study the reciprocal of the mean quantum Fisher information (RMQFI), $\chi^2$ for general three qubit states, having graph and hypergraph states as special cases, for identifying genuine multi party entanglement characterized by $\chi^2…