Related papers: Useful entanglement can be extracted from noisy gr…
Graph and hypergraph states are important resource states for realizing universal quantum computation and diverse non-local physical phenomena. However, noise learning in such states is challenging due to their large entanglement and magic.…
We propose a graph method for systematically searching for schemes that can generate multipartite entanglement in linear bosonic systems with heralding. While heralded entanglement generation offers more tolerable schemes for quantum tasks…
Despite the exponential overhead to describe general multi-qubit quantum states and processes, efficient methods for certain state families and operations have been developed and utilised. The stabilizer formalism and the Gottesman-Knill…
Entanglement is a fundamental resource for many applications in quantum information processing. Here, we investigate how quantum transport in simple quantum graphs, modeled as controlled two-level quantum systems, can be utilized to…
We present a closest separable state to cluster states. We start by considering linear cluster chains and extend our method to cluster states that can be used as a universal resource in quantum computation. We reproduce known results for…
By using highly entangled states, quantum metrology guarantees precision impossible with classical measurements. Unfortunately such states can be very susceptible to noise, and it is a great challenge of the field to maintain quantum…
We present a general theory for the construction of witnesses that detect genuine multipartite entanglement in graph states. First, we present explicit witnesses for all graph states of up to six qubits which are better than all criteria so…
Classical simulations of noisy quantum circuits are instrumental to our understanding of the behavior of real-world quantum systems and the identification of regimes where one expects quantum advantage. In this work, we present a highly…
Entangled qubit pairs can serve as a quantum memory or as a resource for quantum communication. The utility of such pairs is measured by how long they take to disentangle or decohere. To answer the question of whether qubit-qubit…
Bell-network states are loop-quantum-gravity states that glue quantum polyhedra with entanglement. We present an algorithm and a code that evaluates the reduced density matrix of a Bell-network state and computes its entanglement entropy.…
We analyse the use of entangled states to perform quantum computations non locally among distant nodes in a quantum network. The complexity associated with the generation of multiparticle entangled states is quantified in terms of the…
Accurately estimating high-order moments of quantum states is an elementary precondition for many crucial tasks in quantum computing, such as entanglement spectroscopy, entropy estimation, spectrum estimation, and predicting non-linear…
This study explores robust entangled states described using the framework of discrete Wigner functions. Notably, these states are known to outperform the Bell state in measures of entanglement in the presence of non-Markovian noise. Our…
Noisy unsharp measurements incorporated in quantum information protocols may hinder performance, reducing the quantum advantage. However, we show that, unlike projective measurements which completely destroy quantum correlations between…
We investigate the influence of noise on a graph state generation scheme which exploits a mirror inverting spin chain. Within this scheme the spin chain is used repeatedly as an entanglement bus (EB) to create multi-partite entanglement.…
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 are the natural generalization of graph states. Here we investigate and analytically quantify entanglement and nonlocality for large classes of quantum hypergraph states. More specifically, we connect the geometric…
Stabilizer states along with Clifford manipulations (unitary transformations and measurements) thereof -- despite being efficiently simulable on a classical computer -- are an important tool in quantum information processing, with…
Graph states are key resources for measurement-based quantum computing, which is particularly promising for photonic systems. Fusions are probabilistic Bell state measurements, measuring pairs of parity operators of two qubits. Fusions can…
Quantum entanglement is usually revealed via a well aligned, carefully chosen set of measurements. Yet, under a number of experimental conditions, for example in communication within multiparty quantum networks, noise along the channels or…