相关论文: Transforming graph states to Bell-pairs is NP-Comp…
Remote quantum entanglement can enable numerous applications including distributed quantum computation, secure communication, and precision sensing. In this paper, we consider how a quantum network-nodes equipped with limited quantum…
Quantum repeaters provide an efficient solution to distribute Bell pairs over arbitrarily long distances. While scalable architectures are demanding regarding the number of qubits that need to be controlled, here we present a quantum…
We consider the problem of optimising the achievable EPR-pair distribution rate between multiple source-destination pairs in a quantum internet, where the repeaters may perform a probabilistic bell-state measurement and we may impose a…
We present the construction of a new family of coherent states for quantum theories of connections obtained following the polymer quantization. The realization of these coherent states is based on the notion of graph change, in particular…
Graph states are widely used in quantum information theory, including entanglement theory, quantum error correction, and one-way quantum computing. Graph states have a nice structure related to a certain graph, which is given by either a…
We investigate the exploitation of various combinatorial properties of graphs and set systems to study several issues in quantum information theory. We characterize the combinatorics of distributed EPR pairs for preparing multi-partite…
Scalable quantum computing and communication requires the protection of quantum information from the detrimental effects of decoherence and noise. Previous work tackling this problem has relied on the original circuit model for quantum…
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…
We investigate the amount of communication that must augment classical local hidden variable models in order to simulate the behaviour of entangled quantum systems. We consider the scenario where a bipartite measurement is given from a set…
We propose a setup that transforms a photon pair in arbitrary rank-four mixed state, which could also be unknown, to a Bell state. The setup involves two linear optical circuits processing the individual photons and a parity gate working…
This article delves into an analysis of the intrinsic entanglement and separability feature in quantum states as depicted by graph Laplacian. We show that the presence or absence of edges in the graph plays a pivotal role in defining the…
Quantum networks are natural scenarios for the communication of information among distributed parties, and the arena of promising schemes for distributed quantum computation. Measurement-based quantum computing is a prominent example of how…
Recent advances have led towards first prototypes of quantum networks in which entanglement is distributed by sources producing bipartite entangled states. This raises the question of which states can be generated in quantum networks based…
One of the most fascinating aspects of quantum networks is their capability to distribute entanglement as a nonlocal communication resource. In a first step, this requires network-ready devices that can generate and store entangled states.…
Graph states are computationally powerful quantum states with many applications including use as resource states for measurement-based quantum computing (MBQC). We demonstrate construction of graph states on a Rydberg atom quantum analogue…
The all-photonic quantum repeater scheme, utilizing a type of graph state called the repeater graph state (RGS), promises resilience to photon losses and operational errors, offering a fast Bell pair generation rate limited only by the RGS…
We consider entanglement-based quantum networks, where multipartite entangled resource states are distributed and stored among the nodes and locally manipulated upon request to establish the desired target configuration. Separating the…
Diagrammatic representation and manipulation of tensor networks has proven to be a useful tool in mathematics, physics, and computer science. Here we present several important and mostly well-known theorems regarding the dualities between…
We study the computational complexity of quantum state isomorphism problems under group actions: given two quantum circuits that prepare pure or mixed states, decide whether the two states are related by a group action. This can be seen as…
The optimal entanglement manipulation for a single copy of mixed states of two qubits is to transform it to a Bell diagonal state. In this paper we derive an explicit form of the local operation that can realize such a transformation. The…