Explore the vast range of titles available.

A distributed sensing protocol uses a network of local sensing nodes to estimate a global feature of the network, such as a weighted average of locally detectable parameters. In the noiseless case, continuous-variable (CV) multipartite entanglement shared by the nodes can improve the precision of parameter estimation relative to the precision attainable by a network without shared entanglement; for an entangled protocol, the root mean square estimation error scales like 1/M with the number M of sensing nodes, the so-called Heisenberg scaling, while for protocols without entanglement, the error scales like 1 M . However, in the presence of loss and other noise sources, although multipartite entanglement still has some advantages for sensing displacements and phases, the scaling of the precision with M is less favorable. In this paper, we show that using CV error correction codes can enhance the robustness of sensing protocols against imperfections and reinstate Heisenberg scaling up to moderate values of M. Furthermore, while previous distributed sensing protocols could measure only a single quadrature, we construct a protocol in which both quadratures can be sensed simultaneously. Our work demonstrates the value of CV error correction codes in realistic sensing scenarios.

We study genuine multipartite entanglement (GME) and multipartite k-entanglement based on q-concurrence. Well-defined parameterized GME measures and measures of multipartite k-entanglement are presented for arbitrary dimensional n-partite quantum systems. Our GME measures show that the GHZ state is more entangled than the W state. Moreover, our measures are shown to be inequivalent to the existing measures according to entanglement ordering. Detailed examples show that our measures characterize the multipartite entanglement finer than some existing measures, in the sense that our measures identify the difference of two different states while the latter fail.

The laws of quantum mechanics allow for the distribution of a secret random key between two parties. Here we analyse the security of a protocol for establishing a common secret key between N parties (i.e. a conference key), using resource states with genuine N-partite entanglement. We compare this protocol to conference key distribution via bipartite entanglement, regarding the required resources, achievable secret key rates and threshold qubit error rates. Furthermore we discuss quantum networks with bottlenecks for which our multipartite entanglement-based protocol can benefit from network coding, while the bipartite protocol cannot. It is shown how this advantage leads to a higher secret key rate.

We study the acceleration effect on the genuine tripartite entanglement for one or two accelerated detector(s) coupled to the vacuum field. Surprisingly, we find that the increase and decrease in entanglement have no definite correspondence with the Unruh and anti-Unruh effects. Specifically, Unruh effect can not only decrease but also enhance the tripartite entanglement between detectors; also, anti-Unruh effect can not only enhance but also decrease the tripartite entanglement. We give an explanation of this phenomenon. Finally, we extend the discussion from tripartite to N -partite systems.

We investigate the fundamental limitations imposed by thermodynamics for creating correlations. Considering a collection of initially uncorrelated thermal quantum systems, we ask how much classical and quantum correlations can be obtained via a cyclic Hamiltonian process. We derive bounds on both the mutual information and entanglement of formation, as a function of the temperature of the systems and the available energy. While for a finite number of systems there is a maximal temperature allowing for the creation of entanglement, we show that genuine multipartite entanglement-the strongest form of entanglement in multipartite systems-can be created at any finite temperature when sufficiently many systems are considered. This approach may find applications, e.g. in quantum information processing, for physical platforms in which thermodynamic considerations cannot be ignored.

Recently, there has been considerable interest in the application of information geometry to quantum many body physics. This interest has been driven by three separate lines of research, which can all be understood as different facets of quantum information geometry. First, the study of topological phases of matter characterized by Chern number is rooted in the symplectic structure of the quantum state space, known in the physics literature as Berry curvature. Second, in the study of quantum phase transitions, the fidelity susceptibility has gained prominence as a universal probe of quantum criticality, even for systems that lack an obviously discernible order parameter. Finally, the study of quantum Fisher information in many body systems has seen a surge of interest due to its role as a witness of genuine multipartite entanglement and owing to its utility as a quantifier of quantum resources, in particular those useful in quantum sensing. Rather than a thorough review, our aim is to connect key results within a common conceptual framework that may serve as an introductory guide to the extensive breadth of applications, and deep mathematical roots, of quantum information geometry, with an intended audience of researchers in quantum many body and condensed matter physics.

We consider quantum metrology with several copies of bipartite and multipartite quantum states. We characterize the metrological usefulness by determining how much the state outperforms separable states. We identify a large class of entangled states that become maximally useful for metrology in the limit of large number of copies, even if the state is weakly entangled and not even more useful than separable states. This way we activate metrologically useful genuine multipartite entanglement. Remarkably, not only that the maximally achievable metrological usefulness is attained exponentially fast in the number of copies, but it can be achieved by the measurement of few simple correlation observables. We also make general statements about the usefulness of a single copy of pure entangled states. We surprisingly find that the multiqubit states presented in Hyllus et al (2010 Phys. Rev. A 82 012337), which are not useful, become useful if we embed the qubits locally in qutrits. We discuss the relation of our scheme to error correction, and its possible use for quantum metrology in a noisy environment.

Finding ways to test the behaviour of quantum devices is a timely enterprise, especially in light of the rapid development of quantum technologies. Device-independent self-testing is one desirable approach, as it makes minimal assumptions on the devices being tested. In this work, we address the question of which states can be self-tested. This has been answered recently in the bipartite case (Coladangelo et al 2017 Nat. Commun. 8 15485), while it is largely unexplored in the multipartite case, with only a few scattered results, using a variety of different methods: maximal violation of a Bell inequality, numerical SWAP method, stabiliser self-testing etc. In this work, we investigate a simple, and potentially unifying, approach: combining projections onto two-qubit spaces (projecting parties or degrees of freedom) and then using maximal violation of the tilted CHSH inequalities. This allows one to obtain self-testing of Dicke states and partially entangled GHZ states with two measurements per party, and also to recover self-testing of graph states (previously known only through stabiliser methods). Finally, we give the first self-test of a class of multipartite qudit states: we generalise the self-testing of partially entangled GHZ states by adapting techniques from (Coladangelo et al 2017 Nat. Commun. 8 15485), and show that all multipartite states which admit a Schmidt decomposition can be self-tested with few measurements.

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 local vertex degree and to merge subgraphs. We utilize these tools together with the previously introduced zipper scheme that generates multiple edges between distant vertices to extract the desired graph state from a two-dimensional cluster state. We show how to minimize overheads by avoiding multiple edges, and compare with a local manipulation strategy based on measurement-based quantum computation together with transport. These schemes have direct applications in entanglement-based quantum networks, sensor networks, and distributed quantum computing in general.

It remains an open question whether every pure multipartite state that is genuinely entangled is also genuinely nonlocal. Recently, a new general construction of Bell inequalities allowing the detection of genuine multipartite nonlocality (GMNL) in quantum states was proposed in Curchod et al (2019 New J. Phys. 21 023016) with the aim of addressing the above problem. Here we show how, in a simple manner, one can improve this construction to deliver finer Bell inequalities for detection of GMNL. Remarkably, we then prove one of the improved Bell inequalities to be powerful enough to detect GMNL in every three-qubit genuinely entangled state. We also generalize some of these inequalities to detect not only GMNL but also nonlocality depth in multipartite states and we present a possible way of generalizing them to the case of more outcomes.