Related papers: Useful entanglement can be extracted from noisy gr…
We address the use of entangled qubits as quantum probes to characterize the noise induced by complex environments. In particular, we show that a joint measurement on entangled probes can improve estimation of the correlation time for a…
We introduce multipartite entanglement distribution protocols that use a quantum switch to deliver stabilizer states to a number of remote end users. As in existing schemes, the first step in our protocols involves Bell pair generation…
Entanglement distillation, a fundamental building block of quantum networks, enables the purification of noisy entangled states shared among distant nodes by local operations and classical communication. Its practical realization presents…
Graph states are multi-particle entangled states that correspond to mathematical graphs, where the vertices of the graph take the role of quantum spin systems and edges represent Ising interactions. They are many-body spin states of…
Entanglement is one of the fundamental properties of a quantum state and is a crucial differentiator between classical and quantum computation. There are many ways to define entanglement and its measure, depending on the problem or…
Graph states, and the entanglement they posses, are central to modern quantum computing and communications architectures. Local complementation---the graph operation that links all local-Clifford equivalent graph states---allows us to…
We propose a scheme to distribute graph states over quantum networks in the presence of noise in the channels and in the operations. The protocol can be implemented efficiently for large graph sates of arbitrary (complex) topology. We…
Graph states are entangled resource states for universal measurement-based quantum computation. Although matter qubits such as superconducting circuits and trapped ions are promising candidates to generate graph states, it is…
Whether noisy quantum devices without error correction can provide quantum advantage over classical computers is a critical issue of current quantum computation. In this work, the random quantum circuits, which are used as the paradigm…
We present methods and results of shot-by-shot correlation of noisy measurements to extract entangled state and process tomography in a superconducting qubit architecture. We show that averaging continuous values, rather than counting…
Many experiments in quantum information aim at creating multi-partite entangled states. Quantifying the amount of entanglement that was actually generated can, in principle, be accomplished using full-state tomography. This method requires…
Starting from several copies of bipartite noisy entangled states, we design a global and optimal local measurement-based protocol in one- and two-dimensional lattices by which any two or more prefix sites can be connected via entanglement.…
Highly entangled multipartite states such as k-uniform (k-UNI) and absolutely maximally entangled (AME) states serve as critical resources in quantum networking and other quantum information applications. However, there does not yet exist a…
In this work we construct tests that allow a classical user to certify high dimensional entanglement in uncharacterized and possibly noisy quantum devices. We present a family of non-local games $\{G_n\}$ that for all $n$ certify states…
Entanglement plays a fundamental role in quantum physics and information processing. Here, we develop an unbiased estimator for mixed-state entanglement in the few-shot scenario and directly estimate it using random unitary evolution in a…
Randomized measurements constitute a simple measurement primitive that exploits the information encoded in the outcome statistics of samples of local quantum measurements defined through randomly selected bases. In this work we exploit the…
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…
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 investigate a novel class of quantum error correcting codes to correct errors on both qubits and higher-state quantum systems represented as qudits. These codes arise from an original graph-theoretic representation of sets of quantum…
Building large-scale quantum computers, essential to demonstrating quantum advantage, is a key challenge. Quantum Networks (QNs) can help address this challenge by enabling the construction of large, robust, and more capable quantum…