Searcharxiv⌕ Search

arXiv subjects

Otfried Gühne

Publications and source records attributed to Otfried Gühne.

At least 37 records · Page 2Linked to original sources

Qubits in second quantisation in fermionic simulators

Simulating many-body fermionic systems in conventional qubit-based quantum computers poses significant challenges due to the overheads associated with the encoding of fermionic statistics in qubits, leading to the proposal of native fermionic simulators as an alternative. While allowing for fermionic problems to be simulated efficiently, this class of fermionic simulators carries also specific constraints with them and poses other challenges unfamiliar to qubit systems. Here, we propose to pair fermionic modes to form a so-called qubit in second quantisation representation. This allows fermionic gates to be represented as rotations of these second quantised qubits, enabling adaptation of methods for qubit systems. As an application, we use this pairing scheme to represent the measurement of two- and four-point correlators in fermionic simulators with its native gates as a graph problem. Optimising measurement settings is then analysed with various analytical and algorithmic methods.

quant-ph↗

Robust entanglement buffers based on SWAP interactions

Quantum entanglement is the essential resource for quantum communication and distributed information processing in a quantum network. However, the remote generation over a network suffers from inevitable transmission loss and other technical difficulties. This paper introduces the concept of entanglement buffers as a potential primitive for preparing long-distance entanglement. We investigate the filling of entanglement buffers with either one Bell state or a stream of Bell states via SWAP interactions. We illustrate their resilience to imperfect interactions, noise, and losses, making the buffers suitable for a realistic quantum network scenario. Additionally, larger entanglement buffers can always enhance these benefits.

quant-ph↗

Entanglement Superactivation in Multiphoton Distillation Networks

In quantum networks, after passing through noisy channels or information processing, residual states may lack sufficient entanglement for further tasks, yet they may retain hidden quantum resources that can be recycled. Efficiently recycling these states to extract entanglement resources such as genuine multipartite entanglement or Einstein-Podolsky-Rosen pairs is essential for optimizing network performance. Here, we develop a tripartite entanglement distillation scheme using an eight-photon quantum platform, demonstrating entanglement superactivation phenomena which are unique to multipartite systems. We successfully generate a three-photon genuinely entangled state from two bi-separable states via local operations and classical communication, demonstrating superactivation of genuine multipartite entanglement. Furthermore, we extend our scheme to generate a three-photon state capable of extracting an Einstein-Podolsky-Rosen pair from two initial states lacking this capability, revealing a previously unobserved entanglement superactivation phenomenon. Our methods and findings offer not only practical applications for quantum networks, but also lead to a deeper understanding of multipartite entanglement structures.

quant-ph↗

Quantifying entanglement from the geometric perspective

Quantum entanglement between several particles is essential for applications like quantum metrology or quantum cryptography, but it is also central for foundational phenomena like quantum non-locality. This leads to the problem of quantifying the amount of entanglement in a quantum state. We present a review on the geometric measure of entanglement, being a quantifier based on the distance of a state to the nearest separable state. We explain basic properties, existing methods to compute it, its operational interpretations, as well as scaling and complexity issues. We point out intimate relations to fundamental problems in mathematics concerning eigenvalues and norms of tensors. Consequently, the geometric measure of entanglement provides a playground where physical intuition and mathematical rigor benefit from each other.

quant-ph↗

Optimal Overlapping Tomography

Characterising large-scale quantum systems is central to fundamental physics and essential for applications of quantum technologies. While a full characterisation requires exponentially increasing resources, focusing on application-relevant information can often lead to significantly simplified analysis. Overlapping tomography is such a scheme, allowing one to obtain all the information contained in specific subsystems of multiparticle quantum systems in an efficient manner, but the ultimate limits of this approach remain elusive. We present protocols for overlapping tomography that are optimal with respect to the number of measurement settings. First, by providing algorithmic approaches based on graph theory we find the minimal number of Pauli settings, relating overlapping tomography to the problem of covering arrays in combinatorics. This significantly reduces the number of measurement settings, showing for instance that two-body overlapping tomography of nearest neighbours in qubit systems with planar topologies can always be performed with nine Pauli settings. Second, we prove that using general projective measurements, all $k$-body marginals can be reconstructed with only $3^k$ settings, independently of the system size. Finally, we demonstrate the practical applicability of our methods in a six-photon experiment. Our results will find applications in learning noise and interaction patterns in quantum computers as well as characterising fermionic systems in quantum chemistry.

quant-ph↗

Real randomized measurements for analyzing properties of quantum states

Randomized measurements are useful for analyzing quantum systems especially when quantum control is not fully perfect. However, their practical realization typically requires multiple rotations in the complex space due to the adoption of random unitaries. Here, we introduce two simplified randomized measurements that limit rotations in a subspace of the complex space. The first is \textit{real randomized measurements} (RRMs) with orthogonal evolution and real local observables. The second is \textit{partial real randomized measurements} (PRRMs) with orthogonal evolution and imaginary local observables. We show that these measurement protocols exhibit different abilities in capturing correlations of bipartite systems. We explore various applications of RRMs and PRRMs in different quantum information tasks such as characterizing high-dimensional entanglement, quantum imaginarity, and predicting properties of quantum states with classical shadow.

quant-ph↗

$su(d)$-squeezing and many-body entanglement geometry in finite-dimensional systems

Generalizing the well-known spin-squeezing inequalities, we study the relation between squeezing of collective $N$-particle $su(d)$ operators and many-body entanglement geometry in multi-particle systems. For that aim, we define the set of pseudo-separable states, which are mixtures of products of single-particle states that lie in the $(d^2-1)$-dimensional Bloch sphere but are not necessarily positive semidefinite. We obtain a set of necessary conditions for states of $N$ qudits to be of the above form. Any state that violates these conditions is entangled. We also define a corresponding $su(d)$-squeezing parameter that can be used to detect entanglement in large particle ensembles. Geometrically, this set of conditions defines a convex set of points in the space of first and second moments of the collective $N$-particle $su(d)$ operators. We prove that, in the limit $N\gg 1$, such set is filled by pseudo-separable states, while any state corresponding to a point outside of this set is necessarily entangled. We also study states that are detected by these inequalities: We show that states with a bosonic symmetry are detected if and only if the two-body reduced state violates the positive partial transpose (PPT) criterion. On the other hand, highly mixed states states close to the $su(d)$ singlet are detected which have a separable two-body reduced state and are also PPT with respect to all possible bipartitions. We also provide numerical examples of thermal equilibrium states that are detected by our set of inequalities, comparing the spin-squeezing inequalities with the $su(3)$-squeezing inequalities.

quant-ph↗

Quantifying information flow in quantum processes

We present a framework for quantifying information flow within general quantum processes. For this purpose, we introduce the signaling power of quantum channels and discuss its relevant operational properties. This function supports extensions to higher-order maps, enabling the evaluation of information flow in general quantum causal networks and also processes with indefinite causal order. Furthermore, our results offer a rigorous approach to information dynamics in open systems that applies also in the presence of initial system-environment correlations, and allows for the distinction between classical and quantum information backflow.

quant-ph↗

Quantum Graph States: Bridging Classical Theory and Quantum Innovation, Workshop Summary

This workshop brought together experts in classical graph theory and quantum information science to explore the intersection of these fields, with a focus on quantum graph states and their applications in computing, networking, and sensing. The sessions highlighted the foundational role of graph-theoretic structure, such as rank-width, vertex-minors, and hypergraphs, in enabling measurement-based quantum computation, fault-tolerant architectures, and distributed quantum sensing. Key challenges identified include the need for scalable entanglement generation, robust benchmarking methods, and deeper theoretical understanding of generalized graph states. The workshop concluded with targeted research recommendations, emphasizing interdisciplinary collaboration to address open problems in entanglement structure, simulation complexity, and experimental realization across diverse quantum platforms.

quant-ph↗

Superactivation and Incompressibility of Genuine Multipartite Entanglement

Quantum correlations in the form of entanglement, quantum steering or Bell nonlocality are resources for various information-processing tasks, but their detailed quantification and characterization remain complicated. One counter-intuitive effect is the phenomenon of superactivation, meaning that two copies of a quantum state may exhibit forms of correlations which are absent on the single-copy level. We develop a systematic approach towards a full understanding of this phenomenon using the paradigm of genuine multipartite entanglement. We introduce systematic methods for studying superactivation of entanglement based on symmetries and generalized notions of multipartite distillability. With this, we present novel criteria for superactivation as well as a quantitative theory of it. Finally, we prove the existence of incompressible entanglement, meaning that there are quantum states for which superactivated multipartite entanglement cannot be reduced to the single-copy level.

quant-ph↗

Graphical Framework for Non-Gaussian Quantum States

We provide a graphical method to describe and analyze non-Gaussian quantum states using a hypergraph framework. These states are pivotal resources for quantum computing, communication, and metrology, but their characterization is hindered by their complex high-order correlations. The framework encapsulates transformation rules for a series of typical Gaussian unitary operation and local quadrature measurement, offering a visually intuitive tool for manipulating such states through experimentally feasible pathways. Notably, we develop methods for the generation of complex hypergraph states with more or higher-order hyperedges from simple structures through Gaussian operations only, facilitated by our graphical rules. We present illustrative examples on the preparation of non-Gaussian states rooted in these graph-based formalisms, revealing their potential to advance continuous-variable general quantum computing capabilities.

quant-ph↗

All incompatible measurements on qubits lead to multiparticle Bell nonlocality

Bell nonlocality is a fundamental phenomenon of quantum physics as well as an essential resource for various tasks in quantum information processing. It is known that for the observation of nonlocality the measurements on a quantum system have to be incompatible, but the question which incompatible measurements are useful, remained open. Here we prove that any set of incompatible measurements on qubits leads to a violation of a suitable Bell inequality in a multiparticle scenario, where all parties perform the same set of measurements. Since there exists incompatible measurements on qubits which do not lead to Bell nonlocality for two particles, our results demonstrate a fundamental difference between two-particle and multi-particle nonlocality, pointing at the superactivation of measurement incompatibility as a resource. In addition, our results imply that measurement incompatibility for qubits can always be certified in a device-independent manner.

quant-ph↗

Two-point measurement correlations beyond the quantum regression theorem

Temporal correlations are fundamental in quantum physics, yet their computation is often challenging. The regression theorem (or hypothesis) serves as a key tool in this context, offering a seemingly straightforward approach. However, it fails for systems strongly coupled to their surroundings, where memory effects become significant. Here, we extend the analysis of temporal correlations beyond the regression theorem, revealing what can be learned about open quantum systems when this hypothesis fails. We introduce robust, operationally meaningful methods to explore how the breakdown of the regression hypothesis can uncover fundamental quantum features of non-Markovian open systems, including entanglement, coherence, and quantum memory, namely, the fundamental impossibility of simulating memory in non-Markov processes with classical feedback mechanisms. Finally, we demonstrate how these quantum features are linked to microscopic properties such as the bath spectral density and heat flow.

quant-ph↗

Chiral Symmetries and Multiparticle Entanglement

Bosons and fermions are defined by their exchange properties and the underlying symmetries determine the structure of the corresponding state spaces. For two particles there are two possible exchange symmetries, resulting in symmetric or antisymmetric behaviour, but when exploring multiparticle systems also quantum states with chiral symmetries appear. In this work we demonstrate that chiral symmetries lead to extremal forms of quantum entanglement. More precisely, we show that subspaces with this symmetry are highly entangled with respect to the geometric measure of entanglement, leading to observables which can be useful for entanglement characterization. Along the way, we develop a simple method to solve the problem of genuine multiparticle entanglement for unitarily invariant three-particle states and use it to identify genuine multipartite entangled states whose partial transposes with respect to all bipartitions are positive. Finally, we consider generalizations with less symmetry and discuss potential applications.

quant-ph↗

Distinguishing Graph States by the Properties of Their Marginals

Graph states are a class of multi-partite entangled quantum states that are ubiquitous in quantum information. We study equivalence relations between graph states under local unitaries (LU) to obtain distinguishing methods both in local and in networked settings. Based on the marginal structure of graph states, we introduce a family of easy-to-compute LU-invariants. We show that these invariants uniquely identify the entanglement classes of every graph state up to 8 qubits and discuss their reliability for larger numbers of qubits. To handle larger graphs, we generalize tools to test for local Clifford (LC) equivalence of graph states that work by condensing large graphs into smaller graphs. In turn, we show that statements on the equivalence of these smaller graphs (which are easier to compute) can be used to infer statements on the equivalence of the original, larger graphs. We analyze LU-equivalence in two key settings - with and without allowing for the permutation of qubits. We identify entanglement classes, whose marginal structure does not allow us to distinguish them. As a result, we increase the bound on the number of qubits where the LU-LC conjecture holds from 8 to 10 qubits in the setting where qubit permutations are allowed.

quant-ph↗

No quantum advantage without classical communication: fundamental limitations of quantum networks

Quantum networks connect systems at separate locations via quantum links, enabling a wide range of quantum information tasks between distant parties. Large-scale networks have the potential to enable global secure communication, distributed quantum computation, enhanced clock synchronization, and high-precision multiparameter metrology. For the optimal development of these technologies, however, it is essential to identify the necessary resources and sub-routines that will lead to the quantum advantage, but this is demanding even for the simplest protocols in quantum information processing. Here we show that quantum networks relying on the long-distance distribution of bipartite entanglement, combined with local operations and shared randomness, cannot achieve a relevant quantum advantage. Specifically, we prove that these networks do not help in preparing resourceful quantum states such as Greenberger-Horne-Zeilinger states or cluster states, despite the free availability of long-distance entanglement. At an abstract level, our work points towards a fundamental difference between bipartite and multipartite entanglement. From a practical perspective, our results highlight the need for classical communication combined with quantum memories to fully harness the power of quantum networks.

quant-ph↗

Imprecision plateaus in quantum steering

We study tests of quantum steering in which the trusted party does not have perfect control of their measurements. We report on steering inequalities that remain unaffected when introducing up to a threshold magnitude of measurement imprecision. This phenomenon, which we call an imprecision plateau, thus permits a departure from the standard assumption of idealised measurements without any incuring cost to the detection power of steering experiments. We provide an explanation for why imprecision plateaus are possible, a simple criterion for their existence and tools for analysing their properties. We also demonstrate that these plateaus have natural applications when the assumption of perfect measurements is relaxed: they allow for maintaining both the noise- and loss-robustness of standard steering tests and the performance rate of idealised one-sided device-independent random number generators.

quant-ph↗

Revealing hidden physical nonclassicality with nonnegative polynomials

Understanding quantum phenomena which go beyond classical concepts is a focus of modern quantum physics. Here, we show how the theory of nonnegative polynomials emerging around Hilbert's 17th problem, can be used to optimally exploit data capturing the nonclassical nature of light. Specifically, we show that nonnegative polynomials can reveal nonclassicality in data even when it is hidden from standard detection methods up to now. Moreover, the abstract language of nonnegative polynomials also leads to a unified mathematical approach to nonclassicality for light and spin systems, allowing us to map methods for one to the other. Conversely, the physical problems arising also inspire several mathematical insights into characterisation of nonnegative polynomials.

quant-ph↗