Related papers: Entanglement, quantum correlators and connectivity…
We present an experimental analysis of quadrature entanglement produced from a pair of amplitude squeezed beams. The correlation matrix of the state is characterized within a set of reasonable assumptions, and the strength of the…
We initiate a rigorous study of computational entanglement theory, inspired by the emerging usefulness of ideas from quantum information theory in computational complexity. We define new operational computational measures of entanglement --…
We develop a method for visualizing the internal structure of multipartite entanglement in pure stabilizer states. Our algorithm graphically organizes the many-body correlations in a hierarchical structure. This provides a rich taxonomy…
Multi-qubit quantum states corresponding to bipartite graphs $G(U,V,E)$ are examined. These states are constructed by applying $CNOT$ gates to an arbitrary separable multi-qubit quantum state. The entanglement distance of the resulting…
We propose new entanglement measures as the detection performance based on the hypothesis testing setting. We clarify how our measures work for detecting an entangled state by extending the quantum Sanov theorem. Our analysis covers the…
Entanglement is one of the physical properties of quantum systems responsible for the computational hardness of simulating quantum systems. But while the runtime of specific algorithms, notably tensor network algorithms, explicitly depends…
Topological quantum field theories (TQFT) encode properties of quantum states in the topological features of abstract manifolds. One can use the topological avatars of quantum states to develop intuition about different concepts and…
In this paper we present the novel qualities of entanglement of formation for general (so also infinite dimensional) quantum systems and we introduce the notion of coefficient of quantum correlations. Our presentation stems from rigorous…
We consider graph states of arbitrary number of particles undergoing generic decoherence. We present methods to obtain lower and upper bounds for the system's entanglement in terms of that of considerably smaller subsystems. For an…
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…
Fathoming out quantum state space is a challenging endeavor due to its exponentially growing dimensionality. At the expense of being bound in its expressiveness, the discrete and finite subspace of graph states is easier to investigate via…
The practical utility of a quantum network depends on its ability to establish entanglement between arbitrary node pairs with quality sufficient to execute entanglement enabled tasks. This capability can be assessed globally, through…
We introduce a class of mixed multiqubit states, that corresponds to a randomized version of graph states. Such states arise when a graph state is prepared with noisy or imperfect controlled-Z gates. We study the entanglement features of…
Quantum hypergraph states form a generalisation of the graph state formalism that goes beyond the pairwise (dyadic) interactions imposed by remaining inside the Gaussian approximation. Networks of such states are able to achieve…
We consider a collection of bosonic modes corresponding to the vertices of a graph $\Gamma.$ Quantum tunneling can occur only along the edges of $\Gamma$ and a local self-interaction term is present. Quantum entanglement of one vertex with…
Entanglement are the non-local correlations permitted by quantum theory, believed to play a fundamental role in a quantum computer. We have investigated these correlations in a number of theoretical models for condensed matter systems. Such…
The construction of large-scale quantum computers will require modular architectures that allow physical resources to be localized in easy-to-manage packages. In this work, we examine the impact of different graph structures on the…
The achievement of quantum supremacy boosted the need for a robust medium of quantum information. In this task, higher-dimensional qudits show remarkable noise tolerance and enhanced security for quantum key distribution applications.…
It has been known for some time that graph isomorphism reduces to the hidden subgroup problem (HSP). What is more, most exponential speedups in quantum computation are obtained by solving instances of the HSP. A common feature of the…
Statistical verification of a quantum state aims to certify whether a given unknown state is close to the target state with confidence. So far, sample-optimal verification protocols based on local measurements have been found only for…