Entanglement In Quantum Systems Research Articles

Enhancing Quantum Information Processing – SU(2) Operator Model Development for Three-Qubit Quantum Systems Entanglement Classification

The study introduces the development of the operator model within the Local Unitary (LU) protocol for entanglement classification, specifically of the pure three-qubit quantum systems. Addressing the challenge of accurately distinguishing different classes of entanglement, this research aims to enhance the understanding and utilization of entangled quantum states in quantum information processing. A systematic approach was employed in the development of the model, designed to effectively distinguish different classes of entanglement. This study contributes significantly to quantum information processing, by providing valuable insights into the nature of entangled quantum states and enabling researchers to gain a better understanding, utilizing them effectively in various quantum applications. The developed operator model holds significant potential for the advancements in entanglement classification and broaderscope of quantum information processing. The model marks a notable achievement in enabling a more precise and efficient entanglement of entangled quantum systems, which is crucial for advancing various quantum technologies. Future research should extends this model to a higher-qubit and higher-dimensional quantum systems and explore its integration with several other entanglement classification protocols and Lie groups to further advance the field.

All real projective measurements can be self-tested

Entangled quantum systems feature non-local correlations that are stronger than could be realized classically. This property makes it possible to perform self-testing, the strongest form of quantum functionality verification, which allows a classical user to deduce the quantum state and measurements used to produce a given set of measurement statistics. While self-testing of quantum states is well understood, self-testing of measurements, especially in high dimensions, remains relatively unexplored. Here we prove that every real projective measurement can be self-tested. Our approach employs the idea that existing self-tests can be extended to verify additional untrusted measurements, known as post-hoc self-testing. We formalize the method of post-hoc self-testing and establish the condition under which it can be applied. Using this condition, we construct self-tests for all real projective measurements. We build on this result to develop an iterative self-testing technique that provides a clear methodology for constructing new self-tests from pre-existing ones.

Inverse Hamiltonian design of highly entangled quantum systems

Solving inverse problems to identify Hamiltonians with desired properties holds promise for the discovery of fundamental principles. In quantum systems, quantum entanglement plays a pivotal role in not only characterizing the quantum nature but also developing quantum technology such as quantum computing. Nonetheless, the design principles of the quantum entanglement are yet to be clarified. Here we apply an inverse design framework using automatic differentiation to quantum spin systems, aiming to construct Hamiltonians with large quantum entanglement. We show that the method automatically finds the Kitaev model with bond-dependent anisotropic interactions, whose ground state is a quantum spin liquid, on both honeycomb and square-octagon lattices. On triangular and maple-leaf lattices with geometrical frustration, it generates numerous solutions with spatially inhomogeneous interactions rather than converging to a specific model, but it still helps to construct unprecedented models. The comparative study reveals that bond-dependent anisotropic interactions, rather than isotropic Heisenberg interactions, amplify quantum entanglement, even in the systems with geometrical frustration. The present study paves the way for the automatic design of new quantum systems with desired quantum nature and functionality. Published by the American Physical Society 2024

Entanglement catalysis for quantum states and noisy channels

Many applications of the emerging quantum technologies, such as quantum teleportation and quantum key distribution, require singlets, maximally entangled states of two quantum bits. It is thus of utmost importance to develop optimal procedures for establishing singlets between remote parties. As has been shown very recently, singlets can be obtained from other quantum states by using a quantum catalyst, an entangled quantum system which is not changed in the procedure. In this work we take this idea further, investigating properties of entanglement catalysis and its role for quantum communication. For transformations between bipartite pure states, we prove the existence of a universal catalyst, which can enable all possible transformations in this setup. We demonstrate the advantage of catalysis in asymptotic settings, going beyond the typical assumption of independent and identically distributed systems. We further develop methods to estimate the number of singlets which can be established via a noisy quantum channel when assisted by entangled catalysts. For various types of quantum channels our results lead to optimal protocols, allowing to establish the maximal number of singlets with a single use of the channel.

Quantum physics cannot be captured by classical linear hidden variable theories even in the absence of entanglement

Recent experimental tests of Bell inequalities confirm that entangled quantum systems cannot be described by local classical theories but still do not answer the question whether or not quantum systems could, in principle, be modeled by linear hidden variable theories. In this paper, we study the quantum trajectories of a single qubit that experiences a sequence of repeated generalized measurements. It is shown that this system, which constitutes a hidden quantum Markov model, is more likely to produce complex time correlations than any classical hidden Markov model with two output symbols. From this, we conclude that quantum physics cannot be replaced by linear hidden variable theories. Indeed, it has already been recognized that not only entanglement but also non-classical time correlations of quantum systems with quantum feedback are a valuable resource for quantum technology applications.

Non-local temporal interference

Although position and time have different mathematical roles in quantum mechanics, with one being an operator and the other being a parameter, there is a space–time duality in quantum phenomena—a lot of quantum phenomena that were first observed in the spatial domain were later observed in the temporal domain as well. In this context, we propose a modified version of the double-double-slit experiment using entangled atom pairs to observe a non-local interference in the arrival time distribution, which is analogous to the non-local interference observed in the arrival position distribution. However, computing the arrival time distribution in quantum mechanics is a challenging open problem, and so to overcome this problem we employ a Bohmian treatment. Based on this approach, we numerically demonstrate that there is a complementary relationship between the one-particle and two-particle interference visibilities in the arrival time distribution, which is analogous to the complementary relationship observed in the position distribution. These results can be used to test the Bohmian arrival time distribution in a strict manner, i.e., where the semiclassical approximation breaks down. Moreover, our approach to investigating this experiment can be applied to a wide range of phenomena, and it seems that the predicted non-local temporal interference and associated complementary relationship are universal behaviors of entangled quantum systems that may manifest in various phenomena.

On the condition of Setting Independence

Quantum mechanics predicts non-local correlations in spatially extended entangled quantum systems, and these correlations are empirically very well confirmed. This raises philosophical questions of how nature could be that way, prompting the study of purported completions of quantum mechanics by hidden variables. Bell-type theorems connect assumptions about hidden variables with empirical predictions for the outcome of quantum correlation experiments. From among these assumptions, the Setting Independence assumption has received the least formal attention. Its violation is, however, central in the recent discussion about super-deterministic models for quantum correlation experiments. In this paper, we focus on the non-local modal correlations in the GHZ experiment. We model the introduction of hidden variables in the form of instruction sets via structure extensions in the framework of Branching Space-Times. This framework allows us to show in formal detail how the introduction of non-contextual instruction sets results in a specific violation of Setting Independence; a similar result is derived for contextual instruction sets. Our discussion provides additional reasons for foregoing the introduction of local hidden variables, and for accepting non-local quantum correlations as a resource provided by nature.

Experimental certification of more than one bit of quantum randomness in the two inputs and two outputs scenario

One of the striking properties of quantum mechanics is the occurrence of the Bell-type non-locality. They are a fundamental feature of the theory that allows two parties that share an entangled quantum system to observe correlations stronger than possible in classical physics. In addition to their theoretical significance, non-local correlations have practical applications, such as device-independent randomness generation, providing private unpredictable numbers even when they are obtained using devices delivered by an untrusted vendor. Thus, determining the quantity of certifiable randomness that can be produced using a specific set of non-local correlations is of significant interest. In this paper, we present an experimental realization of recent Bell-type operators designed to provide private random numbers that are secure against adversaries with quantum resources. We use semi-definite programming to provide lower bounds on the generated randomness in terms of both min-entropy and von Neumann entropy in a device-independent scenario. We compare experimental setups providing Bell violations close to the Tsirelson’s bound with lower rates of events, with setups having slightly worse levels of violation but higher event rates. Our results demonstrate the first experiment that certifies close to two bits of randomness from binary measurements of two parties. Apart from single-round certification, we provide an analysis of finite-key protocol for quantum randomness expansion using the Entropy Accumulation theorem and show its advantages compared to existing solutions.

Tapping into Permutation Symmetry for Improved Detection of k-Symmetric Extensions.

Symmetric extensions are essential in quantum mechanics, providing a lens through which to investigate the correlations of entangled quantum systems and to address challenges like the quantum marginal problem. Though semi-definite programming (SDP) is a recognized method for handling symmetric extensions, it struggles with computational constraints, especially due to the large real parameters in generalized qudit systems. In this study, we introduce an approach that adeptly leverages permutation symmetry. By fine-tuning the SDP problem for detecting k-symmetric extensions, our method markedly diminishes the searching space dimensionality and trims the number of parameters essential for positive-definiteness tests. This leads to an algorithmic enhancement, reducing the complexity from O(d2k) to O(kd2) in the qudit k-symmetric extension scenario. Additionally, our approach streamlines the process of verifying the positive definiteness of the results. These advancements pave the way for deeper insights into quantum correlations, highlighting potential avenues for refined research and innovations in quantum information theory.

Integrability and entanglement in quantum systems.

Integrability and entanglement in quantum systems.

Algorithm for evaluating distance-based entanglement measures

Abstract Quantifying entanglement in quantum systems is an important yet challenging task due to its NPhard nature. In this work, we propose an efficient algorithm for evaluating distance-based entanglement measures. Our approach builds on Gilbert’s algorithm for convex optimization, providing a reliable upper bound on the entanglement of a given arbitrary state. We demonstrate the effectiveness of our algorithm by applying it to various examples, such as calculating the squared Bures metric of entanglement as well as the relative entropy of entanglement for GHZ states, W states, Horodecki states, and chessboard states. These results demonstrate that our algorithm is a versatile and accurate tool that can quickly provide reliable upper bounds for entanglement measures.

Loophole-free Bell inequality violation with superconducting circuits

Superposition, entanglement and non-locality constitute fundamental features of quantum physics. The fact that quantum physics does not follow the principle of local causality1–3 can be experimentally demonstrated in Bell tests4 performed on pairs of spatially separated, entangled quantum systems. Although Bell tests, which are widely regarded as a litmus test of quantum physics, have been explored using a broad range of quantum systems over the past 50 years, only relatively recently have experiments free of so-called loopholes5 succeeded. Such experiments have been performed with spins in nitrogen–vacancy centres6, optical photons7–9 and neutral atoms10. Here we demonstrate a loophole-free violation of Bell’s inequality with superconducting circuits, which are a prime contender for realizing quantum computing technology11. To evaluate a Clauser–Horne–Shimony–Holt-type Bell inequality4, we deterministically entangle a pair of qubits12 and perform fast and high-fidelity measurements13 along randomly chosen bases on the qubits connected through a cryogenic link14 spanning a distance of 30 metres. Evaluating more than 1 million experimental trials, we find an average S value of 2.0747 ± 0.0033, violating Bell’s inequality with a P value smaller than 10−108. Our work demonstrates that non-locality is a viable new resource in quantum information technology realized with superconducting circuits with potential applications in quantum communication, quantum computing and fundamental physics15.

Entropy of temporal entanglement

A recently proposed history formalism is used to define temporal entanglement in quantum systems, and compute its entropy. The procedure is based on the time-reduction of the history density operator, and allows a symmetrical treatment of space and time correlations. Temporal entanglement entropy is explicitly calculated in two simple quantum computation circuits.

The randomized measurement toolbox

Increasingly sophisticated programmable quantum simulators and quantum computers are opening unprecedented opportunities for exploring and exploiting the properties of highly entangled complex quantum systems. The complexity of large quantum systems is the source of their power, but also makes them difficult to control precisely or characterize accurately using measured classical data. We review recently developed protocols for probing the properties of complex many-qubit systems using measurement schemes that are practical using today's quantum platforms. In all these protocols, a quantum state is repeatedly prepared and measured in a randomly chosen basis; then a classical computer processes the measurement outcomes to estimate the desired property. The randomization of the measurement procedure has distinct advantages; for example, a single data set can be employed multiple times to pursue a variety of applications, and imperfections in the measurements are mapped to a simplified noise model that can more easily be mitigated. We discuss a range of use cases that have already been realized in quantum devices, including Hamiltonian simulation tasks, probes of quantum chaos, measurements of nonlocal order parameters, and comparison of quantum states produced in distantly separated laboratories. By providing a workable method for translating a complex quantum state into a succinct classical representation that preserves a rich variety of relevant physical properties, the randomized measurement toolbox strengthens our ability to grasp and control the quantum world.

Neuromorphic quantum computing.

Quantum computation builds on the use of correlations. Correlations could also play a central role for artificial intelligence, neuromorphic computing or "biological computing." As a step toward a systematic exploration of "correlated computing" we demonstrate that neuromorphic computing can perform quantum operations. Spiking neurons in the active or silent states are connected to the two states of Ising spins. A quantum density matrix is constructed from the expectation values and correlations of the Ising spins. We show for a two qubit system that quantum gates can be learned as a change of parameters for neural network dynamics. These changes respect restrictions which ensure the quantum correlations. Our proposal for probabilistic computing goes beyond Markov chains and is not based on transition probabilities. Constraints on classical probability distributions relate changes made in one part of the system to other parts, similar to entangled quantum systems.

Tight Analytic Bound on the Trade-Off between Device-Independent Randomness and Nonlocality.

Two parties sharing entangled quantum systems can generate correlations that cannot be produced using only shared classical resources. These nonlocal correlations are a fundamental feature of quantum theory but also have practical applications. For instance, they can be used for device-independent random number generation, whose security is certified independently of the operations performed inside the devices. The amount of certifiable randomness that can be generated from some given nonlocal correlations is a key quantity of interest. Here, we derive tight analytic bounds on the maximum certifiable randomness as a function of the nonlocality as expressed using the Clauser-Horne-Shimony-Holt (CHSH) value. We show that for every CHSH value greater than the local value (2) and up to 3sqrt[3]/2≈2.598 there exist quantum correlations with that CHSH value that certify a maximal two bits of global randomness. Beyond this CHSH value the maximum certifiable randomness drops. We give a second family of Bell inequalities for CHSH values above 3sqrt[3]/2, and show that they certify the maximum possible randomness for the given CHSH value. Our work hence provides an achievable upper bound on the amount of randomness that can be certified for any CHSH value. We illustrate the robustness of our results, and how they could be used to improve randomness generation rates in practice, using a Werner state noise model.

Quantum entanglement of anyon composites

Studying quantum entanglement in systems of indistinguishable particles, in particular anyons, poses subtle challenges. Here, we investigate a model of one-dimensional anyons defined by a generalized algebra. This algebra has the special property that fermions in this model are composites of anyons. A Hubbard-like Hamiltonian is considered that allows hopping between nearest neighbor sites not just for the fundamental anyons, but for the fermionic anyon composites. Some interesting results regarding the quantum entanglement of these particles are obtained.

Entanglement protection in higher-dimensional systems

The inevitable dissipative interaction of an entangled quantum system with its environment causes degradation in quantum correlations present in the system. This can lead to a finite-time disappearance of entanglement, which is known as Entanglement Sudden Death (ESD). Here, we consider an initially entangled qubit-qutrit system and a dissipative noise which leads to ESD, and propose a set of local unitary operations, which when applied on the qubit, qutrit, or both subsystems during the decoherence process, cause ESD to be hastened, delayed, or avoided altogether, depending on its time of application. Delay and avoidance of ESD may find practical application in quantum information processing protocols that would otherwise suffer due to short lifetime of entanglement. The physical implementation of these local unitaries is discussed in the context of an atomic system. The simulation results of such ESD manipulations are presented for two different classes of initially entangled qubit-qutrit systems. A prescription for generalization of this scheme to a qutrit-qutrit system is given. This technique for entanglement protection in the noisy environment is compared with other related techniques such as weak measurement reversal, dynamic decoupling, and quantum Zeno effect.

Quantum entanglement in the one-dimensional anyonic Hubbard model

Issues related to quantum entanglement in systems of indistinguishable particles, as discussed in the information theoretic approach, are extended to anyonic statistics. Local and non-local measurements discussed in this framework are carefully analyzed in the two-site anyonic Hubbard model which provides a concrete case-study. The von Neumann entropy, the single-particle reduced density matrix, the pair correlation function, and the pseudo-momentum distribution function are worked out paying special attention to the dependence on the statistics parameter. Restrictions arising from superselection rules for anyons are outlined.

Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver.

The recognition of entanglement states is a notoriously difficult problem when no prior information is available. Here, we propose an efficient quantum adversarial bipartite entanglement detection scheme to address this issue. Our proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits, where a two-outcome measurement can be used to query a classical binary result about whether the input state is bipartite entangled or not. In principle, for an N-qubit quantum state, the runtime complexity of our proposal is O(poly(N)T) with T being the number of iterations. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states. Our work paves the way for using near-term quantum machines to tackle entanglement detection on multipartite entangled quantum systems.