Analyzing Quantum Entanglement with the Schmidt Decomposition in Operator Space.

Characterizing entanglement is central for quantum information science. Special observables which indicate entanglement, so-called entanglement witnesses, are a widely used tool for this task. The construction of these witnesses typically relies on the observation that quantum states with a high fidelity to some entangled target state are entangled, too. We introduce a general method to construct entanglement witnesses based on the Schmidt decomposition of observables. The method works for two-particle and multiparticle systems and is strictly stronger than fidelity-based constructions. The resulting witnesses can also be used to quantify entanglement and to characterize its dimensionality. Finally, we present experimentally relevant examples, where our approach improves entanglement detection significantly.

Collective Randomized Measurements in Quantum Information Processing.

The concept of randomized measurements on individual particles has proven to be useful for analyzing quantum systems and is central for methods like shadow tomography of quantum states. We introduce collective randomized measurements as a tool in quantum information processing. Our idea is to perform measurements of collective angular momentum on a quantum system and actively rotate the directions using simultaneous multilateral unitaries. Based on the moments of the resulting probability distribution, we propose systematic approaches to characterize quantum entanglement in a collective-reference-frame-independent manner. First, we show that existing spin-squeezing inequalities can be accessible in this scenario. Next, we present an entanglement criterion based on three-body correlations, going beyond spin-squeezing inequalities with two-body correlations. Finally, we apply our method to characterize entanglement between spatially separated two ensembles.

Certifying the Topology of Quantum Networks: Theory and Experiment.

Distributed quantum information in networks is paramount for global secure quantum communication. Moreover, it finds applications as a resource for relevant tasks, such as clock synchronization, magnetic field sensing, and blind quantum computation. For quantum network analysis and benchmarking of implementations, however, it is crucial to characterize the topology of networks in a way that reveals the nodes between which entanglement can be reliably distributed. Here, we demonstrate an efficient scheme for this topology certification. Our scheme allows for distinguishing, in a scalable manner, different networks consisting of bipartite and multipartite entanglement sources. It can be applied to semi-device-independent scenarios also, where the measurement devices and network nodes are not well characterized and trusted. We experimentally demonstrate our approach by certifying the topology of different six-qubit networks generated with polarized photons, employing active feed-forward and time multiplexing. Our methods can be used for general simultaneous tests of multiple hypotheses with few measurements, being useful for other certification scenarios in quantum technologies.

Quantum Speed Limit for States and Observables of Perturbed Open Systems.

Quantum speed limits provide upper bounds on the rate with which a quantum system can move away from its initial state. Here, we provide a different kind of speed limit, describing the divergence of a perturbed open system from its unperturbed trajectory. In the case of weak coupling, we show that the divergence speed is bounded by the quantum Fisher information under a perturbing Hamiltonian, up to an error which can be estimated from system and bath timescales. We give three applications of our speed limit. First, it enables experimental estimation of quantum Fisher information in the presence of decoherence that is not fully characterized. Second, it implies that large quantum work fluctuations are necessary for a thermal system to be driven quickly out of equilibrium under a quench. Moreover, it can be used to bound the response to perturbations of expectation values of observables in open systems.

Contextuality as a Precondition for Quantum Entanglement.

Quantum theory features several phenomena which can be considered as resources for information processing tasks. Some of these effects, such as entanglement, arise in a nonlocal scenario, where a quantum state is distributed between different parties. Other phenomena, such as contextuality, can be observed if quantum states are prepared and then subjected to sequences of measurements. We use robust remote state preparation to connect the nonlocal and sequential scenarios and provide an intimate connection between different resources: We prove that entanglement in a nonlocal scenario can arise only if there is preparation and measurement contextuality in the corresponding sequential scenario and that the absence of entanglement implies the absence of contextuality. As a direct consequence, our result allows us to translate any inequality for testing preparation and measurement contextuality into an entanglement test; in addition, entanglement witnesses can be used to design novel contextuality inequalities.

Randomness Certification from Multipartite Quantum Steering for Arbitrary Dimensional Systems.

Entanglement in bipartite systems has been applied to generate secure random numbers, which are playing an important role in cryptography or scientific numerical simulations. Here, we propose to use multipartite entanglement distributed between trusted and untrusted parties for generating randomness of arbitrary dimensional systems. We show that the distributed structure of several parties leads to additional protection against possible attacks by an eavesdropper, resulting in more secure randomness generated than in the corresponding bipartite scenario. Especially, randomness can be certified in the group of untrusted parties, even when there is no randomness in either of them individually. We prove that the necessary and sufficient resource for quantum randomness in this scenario is multipartite quantum steering when each untrusted party has a choice between only two measurements. However, the sufficiency no longer holds with more measurement settings. Finally, we apply our analysis to some experimentally realized states and show that more randomness can be extracted compared with the existing analysis.

Complete Characterization of Quantum Correlations by Randomized Measurements.

The fact that quantum mechanics predicts stronger correlations than classical physics is an essential cornerstone of quantum information processing. Indeed, these quantum correlations are a valuable resource for various tasks, such as quantum key distribution or quantum teleportation, but characterizing these correlations in an experimental setting is a formidable task, especially in scenarios where no shared reference frames are available. By definition, quantum correlations are reference-frame independent, i.e., invariant under local transformations; this physically motivated invariance implies, however, a dedicated mathematical structure and, therefore, constitutes a roadblock for an efficient analysis of these correlations in experiments. Here we provide a method to directly measure any locally invariant property of quantum states using locally randomized measurements, and we present a detailed toolbox to analyze these correlations for two quantum bits. We implement these methods experimentally using pairs of entangled photons, characterizing their usefulness for quantum teleportation and their potential to display quantum nonlocality in its simplest form. Our results can be applied to various quantum computing platforms, allowing simple analysis of correlations between arbitrary distant qubits in the architecture.

Covariance-Matrix-Based Criteria for Network Entanglement.

Quantum networks offer a realistic and practical scheme for generating multiparticle entanglement and implementing multiparticle quantum communication protocols. However, the correlations that can be generated in networks with quantum sources and local operations are not yet well understood. Covariance matrices, which are powerful tools in entanglement theory, have been also applied to the network scenario. We present simple proofs for the decomposition of such matrices into the sum of positive semi-definite block matrices and, based on that, develop analytical and computable necessary criteria for preparing states in quantum networks. These criteria can be applied to networks where nodes share at most one source, such as all bipartite networks.

Complete Hierarchy for High-Dimensional Steering Certification.

High-dimensional quantum steering can be seen as a test for the dimensionality of entanglement, where the devices at one side are not characterized. As such, it is an important component in quantum informational protocols that make use of high-dimensional entanglement. Although it has been recently observed experimentally, the phenomenon of high-dimensional steering is lacking a general certification procedure. We provide necessary and sufficient conditions to certify the entanglement dimension in a steering scenario. These conditions are stated in terms of a hierarchy of semidefinite programs, which can also be used to quantify the phenomenon using the steering dimension robustness. To demonstrate the practical viability of our method, we characterize the dimensionality of entanglement in steering scenarios prepared with maximally entangled states measured in mutually unbiased bases. Our methods give significantly stronger bounds on the noise robustness necessary to experimentally certify high-dimensional entanglement.

Scalable Generation and Detection of on-Demand W States in Nanophotonic Circuits.

Quantum physics phenomena, entanglement and coherence, are crucial for quantum information protocols, but understanding these in systems with more than two parts is challenging due to increasing complexity. The W state, a multipartite entangled state, is notable for its robustness and benefits in quantum communication. Here, we generate eight-mode on-demand single-photon W states, using nanowire quantum dots and a silicon nitride photonic chip. We demonstrate a reliable and scalable technique for reconstructing the W state in photonic circuits using Fourier and real-space imaging, supported by the Gerchberg-Saxton phase retrieval algorithm. Additionally, we utilize an entanglement witness to distinguish between mixed and entangled states, thereby affirming the entangled nature of our generated state. The study provides a new imaging approach of assessing multipartite entanglement in W states, paving the way for further progress in image processing and Fourier-space analysis techniques for complex quantum systems.

Optimizing Shadow Tomography with Generalized Measurements.

Advances in quantum technology require scalable techniques to efficiently extract information from a quantum system. Traditional tomography is limited to a handful of qubits, and shadow tomography has been suggested as a scalable replacement for larger systems. Shadow tomography is conventionally analyzed based on outcomes of ideal projective measurements on the system upon application of randomized unitaries. Here, we suggest that shadow tomography can be much more straightforwardly formulated for generalized measurements, or positive operator valued measures. Based on the idea of the least-square estimator shadow tomography with generalized measurements is both more general and simpler than the traditional formulation with randomization of unitaries. In particular, this formulation allows us to analyze theoretical aspects of shadow tomography in detail. For example, we provide a detailed study of the implication of symmetries in shadow tomography. Moreover, with this generalization we also demonstrate how the optimization of measurements for shadow tomography tailored toward a particular set of observables can be carried out.

Symmetries in quantum networks lead to no-go theorems for entanglement distribution and to verification techniques.

Quantum networks are promising tools for the implementation of long-range quantum communication. The characterization of quantum correlations in networks and their usefulness for information processing is therefore central for the progress of the field, but so far only results for small basic network structures or pure quantum states are known. Here we show that symmetries provide a versatile tool for the analysis of correlations in quantum networks. We provide an analytical approach to characterize correlations in large network structures with arbitrary topologies. As examples, we show that entangled quantum states with a bosonic or fermionic symmetry can not be generated in networks; moreover, cluster and graph states are not accessible. Our methods can be used to design certification methods for the functionality of specific links in a network and have implications for the design of future network structures.

Optimal Entanglement Certification from Moments of the Partial Transpose.

For the certification and benchmarking of medium-size quantum devices, efficient methods to characterize entanglement are needed. In this context, it has been shown that locally randomized measurements on a multiparticle quantum system can be used to obtain valuable information on the so-called moments of the partially transposed quantum state. This allows one to infer some separability properties of a state, but how to use the given information in an optimal and systematic manner has yet to be determined. We propose two general entanglement detection methods based on the moments of the partially transposed density matrix. The first method is based on the Hankel matrices and provides a family of entanglement criteria, of which the lowest order reduces to the known p_{3}-positive-partial-transpose criterion proposed in A. Elben et al. [Phys. Rev. Lett. 125, 200501 (2020)PRLTAO0031-900710.1103/PhysRevLett.125.200501]. The second method is optimal and gives necessary and sufficient conditions for entanglement based on some moments of the partially transposed density matrix.

Geometry of Faithful Entanglement.

A typical concept in quantum state analysis is based on the idea that states in the vicinity of some pure entangled state share the same properties, implying that states with a high fidelity must be entangled. States whose entanglement can be detected in this way are also called faithful. We prove a structural result on the corresponding fidelity-based entanglement witnesses, resulting in a simple condition for faithfulness of a two-party state. For the simplest case of two qubits faithfulness can directly be decided and for higher dimensions accurate analytical criteria are given. Finally, our results show that faithful entanglement is, in a certain sense, useful entanglement; moreover, they establish connections to computational complexity and simplify several results in entanglement theory.

Bound Entanglement from Randomized Measurements.

If only limited control over a multiparticle quantum system is available, a viable method to characterize correlations is to perform random measurements and consider the moments of the resulting probability distribution. We present systematic methods to analyze the different forms of entanglement with these moments in an optimized manner. First, we find the optimal criteria for different forms of multiparticle entanglement in three-qubit systems using the second moments of randomized measurements. Second, we present the optimal inequalities if entanglement in a bipartition of a multiqubit system shall be analyzed in terms of these moments. Finally, for higher-dimensional two-particle systems and higher moments, we provide criteria that are able to characterize various examples of bound entangled states, showing that detection of such states is possible in this framework.

A complete hierarchy for the pure state marginal problem in quantum mechanics.

Clarifying the relation between the whole and its parts is crucial for many problems in science. In quantum mechanics, this question manifests itself in the quantum marginal problem, which asks whether there is a global pure quantum state for some given marginals. This problem arises in many contexts, ranging from quantum chemistry to entanglement theory and quantum error correcting codes. In this paper, we prove a correspondence of the marginal problem to the separability problem. Based on this, we describe a sequence of semidefinite programs which can decide whether some given marginals are compatible with some pure global quantum state. As an application, we prove that the existence of multiparticle absolutely maximally entangled states for a given dimension is equivalent to the separability of an explicitly given two-party quantum state. Finally, we show that the existence of quantum codes with given parameters can also be interpreted as a marginal problem, hence, our complete hierarchy can also be used.

Some Quantum Measurements with Three Outcomes Can Reveal Nonclassicality where All Two-Outcome Measurements Fail to Do So.

Measurements serve as the intermediate communication layer between the quantum world and our classical perception. So, the question of which measurements efficiently extract information from quantum systems is of central interest. Using quantum steering as a nonclassical phenomenon, we show that there are instances where the results of all two-outcome measurements can be explained in a classical manner, while the results of some three-outcome measurements cannot. This points to the important role of the number of outcomes in revealing the nonclassicality hidden in a quantum system. Moreover, our methods allow us to improve the understanding of quantum correlations by delivering novel criteria for quantum steering and improved ways to construct local hidden variable models.

Generalizing Optimal Bell Inequalities.

Bell inequalities are central tools for studying nonlocal correlations and their applications in quantum information processing. Identifying inequalities for many particles or measurements is, however, difficult due to the computational complexity of characterizing the set of local correlations. We develop a method to characterize Bell inequalities under constraints, which may be given by symmetry or other linear conditions. This allows one to search systematically for generalizations of given Bell inequalities to more parties. As an example, we find all possible generalizations of the two-particle inequality by Froissart [Nuovo Cimento Soc. Ital. Fis. B 64, 241 (1981)], also known as I3322 inequality, to three particles. For the simplest of these inequalities, we study their quantum mechanical properties and demonstrate that they are relevant, in the sense that they detect nonlocality of quantum states, for which all two-setting inequalities fail to do so.

Proof of the Peres Conjecture for Contextuality.

A central result in the foundations of quantum mechanics is the Kochen-Specker theorem. In short, it states that quantum mechanics cannot be reconciled with classical models that are noncontextual for ideal measurements. The first explicit derivation by Kochen and Specker was rather complex, but considerable simplifications have been achieved thereafter. We propose a systematic approach to find minimal Hardy-type and Greenberger-Horne-Zeilinger-type (GHZ-type) proofs of the Kochen-Specker theorem, these are characterized by the fact that the predictions of classical models are opposite to the predictions of quantum mechanics. Based on our results, we show that the Kochen-Specker set with 18 vectors from Cabello et al. [Phys. Lett. A 212, 183 (1996)PYLAAG0375-960110.1016/0375-9601(96)00134-X] is the minimal set for any dimension, verifying a longstanding conjecture by Peres. Our results allow to identify minimal contextuality scenarios and to study their usefulness for information processing.

Geometry of Einstein-Podolsky-Rosen Correlations.

Correlations between distant particles are central to many puzzles and paradoxes of quantum mechanics and, at the same time, underpin various applications such as quantum cryptography and metrology. Originally in 1935, Einstein, Podolsky, and Rosen (EPR) used these correlations to argue against the completeness of quantum mechanics. To formalize their argument, Schrödinger subsequently introduced the notion of quantum steering. Still, the question of which quantum states can be used for EPR steering and which cannot remained open. Here we show that quantum steering can be viewed as an inclusion problem in convex geometry. For the case of two spin-1/2 particles, this approach completely characterizes the set of states leading to EPR steering. In addition, we discuss the generalization to higher-dimensional systems as well as generalized measurements. Our results find applications in various protocols in quantum information processing, and moreover they are linked to quantum mechanical phenomena such as uncertainty relations and the question of which observables in quantum mechanics are jointly measurable.