English
Related papers

Related papers: Entanglement, randomness and chaos

200 papers

Multipartite entanglement is a key resource for quantum computation. It is expected theoretically that entanglement transition may happen for multipartite random quantum states, however, which is still absent experimentally. Here, we report…

Quantum communication networks are emerging as a promising technology that could constitute a key building block in future communication networks in the 6G era and beyond. These networks have an inherent feature of parallelism that allows…

Networking and Internet Architecture · Computer Science 2021-06-01 Mahdi Chehimi , Walid Saad

Bound entanglement is a special form of quantum entanglement that cannot be used for distillation, i.e., the local transformation of copies of arbitrarily entangled states into a smaller number of approximately maximally entangled states.…

Quantum Physics · Physics 2025-08-01 Beatrix C. Hiesmayr , Christopher Popp , Tobias C. Sutter

Controlling entanglement and coherence is central to quantum information, yet the two resources often exhibit antagonistic trends and are difficult to optimize within a single platform. Here we show that chaos enables switchable eigenstate…

Quantum Physics · Physics 2025-12-23 Kyu-Won Park , Soojoon Lee , Kabgyun Jeong

The entanglement production in bipartite quantum systems is studied for initially unentangled product eigenstates of the subsystems, which are assumed to be quantum chaotic. Based on a perturbative computation of the Schmidt eigenvalues of…

For carrying out many quantum information protocols entanglement must be established in advance between two distant parties. Practically, inevitable interaction of entangled subsystems with their environments during distribution and storage…

Quantum Physics · Physics 2015-01-19 Xin-Wen Wang , Shi-Qing Tang , Ji-Bing Yuan , Le-Man Kuang

Entanglement and magic are among the most fundamental properties unique to quantum systems. Each quantity captures a different aspect of non-classical behavior, and each can be regarded as a resource within its own operational setting.…

Quantum Physics · Physics 2025-12-19 Mao Kaneyasu , Yoshihiko Hasegawa

A key problem in quantum information science is to determine optimal protocols for the interconversion of entangled states shared between remote parties. While for two parties a large number of results in this direction is available, the…

Quantum Physics · Physics 2025-05-26 Alexander Streltsov

The central philosophy of statistical mechanics (stat-mech) and random-matrix theory of complex systems is that while individual instances are essentially intractable to simulate, the statistical properties of random ensembles obey simple…

Quantum Physics · Physics 2022-10-04 Andrew C. Potter , Romain Vasseur

Entanglement is one of the pillars of quantum mechanics and quantum information processing, and as a result the quantumness of nonentangled states has typically been overlooked and unrecognized. We give a robust definition for the…

Quantum Physics · Physics 2007-05-23 Berry Groisman , Dan Kenigsberg , Tal Mor

The production of quantum entanglement between weakly coupled mapping systems, whose classical counterparts are both strongly chaotic, is investigated. In the weak coupling regime, it is shown that time correlation functions of the…

Quantum Physics · Physics 2009-03-19 Atushi Tanaka , Hiroshi Fujisaki , Takayuki Miyadera

In a quantum computation with pure states, the generation of large amounts of entanglement is known to be necessary for a speedup with respect to classical computations. However, examples of quantum computations with mixed states are known,…

Quantum Physics · Physics 2007-05-23 Animesh Datta , Guifre Vidal

Entanglement lies at the core of quantum algorithms designed to solve problems that are intractable by classical approaches. One such algorithm, quantum annealing (QA), provides a promising path to a practical quantum processor. We have…

Entanglement is a striking feature of quantum mechanics, and it has a key property called unextendibility. In this paper, we present a framework for quantifying and investigating the unextendibility of general bipartite quantum states.…

Quantum Physics · Physics 2024-03-28 Kun Wang , Xin Wang , Mark M. Wilde

Non-stabilizerness - also colloquially referred to as magic - is the a resource for advantage in quantum computing and lies in the access to non-Clifford operations. Developing a comprehensive understanding of how non-stabilizerness can be…

The degree of entanglement is determined for an arbitrary state of a broad class of PT-symmetric bipartite composite systems. Subsequently we quantify the rate with which entangled states are generated and show that this rate can be…

High Energy Physics - Theory · Physics 2013-05-23 Christian Zielinski , Qing-hai Wang

The generation of a large amount of entanglement is a necessary condition for a quantum computer to achieve quantum advantage. In this paper, we propose a method to efficiently generate pseudo-random quantum states, for which the degree of…

Quantum Physics · Physics 2023-04-05 Gabriele Cenedese , Maria Bondani , Dario Rosa , Giuliano Benenti

We analyze the optimal basis for generating the maximum relative entropy of quantum coherence by an arbitrary gate on a two-qubit system. The optimal basis is not unique, and the high quantum coherence generating gates are also typically…

Quantum Physics · Physics 2023-03-14 Aparajita Bhattacharyya , Ahana Ghoshal , Ujjwal Sen

Quantum entanglement is an indispensable resource for many significant quantum information processing tasks. However, because of the noise in quantum channels, it is difficult to distribute quantum entanglement over a long distance in…

Quantum Physics · Physics 2018-01-31 Zhaofeng Su , Ji Guan , Lvzhou Li

We comment on the investigation of the connection between chaos and dynamically generated entanglement in Phys. Rev. E, \textbf{83}, 016207, (2011). While, in the referred paper, the authors give an explicit example of a state initially…

Quantum Physics · Physics 2016-01-06 Vaibhav Madhok