Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:0707.0451 · Physical Review Letters

Robust and Efficient Generator of Almost Maximal Multipartite Entanglement

Davide Rossini, Giuliano Benenti

Published Feb 11, 2008• 10 citations
arXivHTMLPDF

Abstract

Quantum chaotic maps can efficiently generate pseudorandom states carrying almost maximal multipartite entanglement, as characterized by the probability distribution of bipartite entanglement between all possible bipartitions of the system. We show that such multipartite entanglement is robust, in the sense that, when realistic noise is considered, distillable entanglement of bipartitions remains almost maximal up to a noise strength that drops only polynomially with the number of qubits.

DOI
10.1103/physrevlett.100.060501

Related papers

Entanglement, randomness and chaos

Giuliano Benenti

Entanglement is not only the most intriguing feature of quantum mechanics, but also a key resource in quantum information science. The entanglement content of random pure quantum states is almost maximal; such states find applications in various quantum information protocols. The preparation of a random state or, equivalently, the implementation of a random unitary operator, requires a number of elementary one- and two-qubit gates that is exponential in the number n_q of qubits, thus becoming rapidly unfeasible when increasing n_q. On the other hand, pseudo-random states approximating to the desired accuracy the entanglement properties of true random states may be generated efficiently, that is, polynomially in n_q. In particular, quantum chaotic maps are efficient generators of multipartite entanglement among the qubits, close to that expected for random states. This review discusses several aspects of the relationship between entanglement, randomness and chaos. In particular, I will focus on the following items: (i) the robustness of the entanglement generated by quantum chaotic maps when taking into account the unavoidable noise sources affecting a quantum computer; (ii) the detection of the entanglement of high-dimensional (mixtures of) random states, an issue also related to the question of the emergence of classicality in coarse grained quantum chaotic dynamics; (iii) the decoherence induced by the coupling of a system to a chaotic environment, that is, by the entanglement established between the system and the environment.

arXiv:0807.4364•Jul 28, 2008•3 citations

Multipartite entanglement in qubit systems

Paolo Facchi

We introduce a potential of multipartite entanglement for a system of n qubits, as the average over all balanced bipartitions of a bipartite entanglement measure, the purity. We study in detail its expression and look for its minimizers, the maximally multipartite entangled states. They have a bipartite entanglement that does not depend on the bipartition and is maximal for all possible bipartitions. We investigate their structure and consider several examples for small n.

arXiv:0811.0702•Rendiconti Lincei Matematica e Applicazioni•Mar 31, 2009•8 citations

Multipartite entanglement that is robust against disposal of particles

Wolfgang Dür

We investigate the entanglement properties of multiparticle systems, concentrating on the case where the entanglement is robust against the disposal of particles. Two qubits---belonging to a multipartite system---are entangled in this sense if their reduced density matrix is entangled. We introduce a family of multiqubit states, for which one can choose for any pair of qubits independently whether they should be entangled or not as well as the relative strength of the entanglement, thus providing the possibility to construct all kinds of ``entanglement molecules.'' For some particular configurations, we also give the maximal amount of entanglement achievable.

arXiv:quant-ph/0006105•Physical Review A•Jan 16, 2001•137 citations

Distributing Multipartite Entanglement over Noisy Quantum Networks

Luís Bugalho, Bruno Coelho Coutinho, Francisco A. Monteiro +1 more

A quantum internet aims at harnessing networked quantum technologies, namely by distributing bipartite entanglement between distant nodes. However, multipartite entanglement between the nodes may empower the quantum internet for additional or better applications for communications, sensing, and computation. In this work, we present an algorithm for generating multipartite entanglement between different nodes of a quantum network with noisy quantum repeaters and imperfect quantum memories, where the links are entangled pairs. Our algorithm is optimal for GHZ states with 3 qubits, maximising simultaneously the final state fidelity and the rate of entanglement distribution. Furthermore, we determine the conditions yielding this simultaneous optimality for GHZ states with a higher number of qubits, and for other types of multipartite entanglement. Our algorithm is general also in the sense that it can optimise simultaneously arbitrary parameters. This work opens the way to optimally generate multipartite quantum correlations over noisy quantum networks, an important resource for distributed quantum technologies.

arXiv:2103.14759•Quantum•Feb 9, 2023•67 citations

Multipartite entanglement in qubit systems

Paolo Facchi A

Abstract We introduce a potential of multipartite entanglement for a system of n qubits, as the average over all balanced bipartitions of a bipartite entanglement measure, the purity. We study in detail its expression and look for its minimizers, the maximally multipartite entangled states. They have a bipartite entanglement that does not depend on the bipartition and is maximal for all possible bipartitions. We investigate their structure and consider several examples for small n. Key words Entanglement, quantum nonlocality, quantum information, Hilbert spaces 1

•Jan 1, 2008•14 citations

Maximally multipartite entangled states

Paolo Facchi A, Giuseppe Florio, Giorgio Parisi A +1 more

We introduce the notion of maximally multipartite entangled states of $n$ qubits as a generalization of the bipartite case. These pure states have a bipartite entanglement that does not depend on the bipartition and is maximal for all possible bipartitions. They are solutions of a minimization problem. Examples for small $n$ are investigated, both analytically and numerically.

arXiv:0710.2868•Physical Review A•Jun 11, 2008•176 citations
Quantum chaotic maps can efficiently generate pseudorandom states carrying almost maximal multipartite entanglement, as characterized by the probability distribution of bipartite entanglement between all possible bipartitions of the system. We show that such multipartite entanglement is robust, in the sense that, when realistic noise is considered, distillable entanglement of bipartitions remains almost maximal up to a noise strength that drops only polynomially with the number of qubits.
Entanglement is not only the most intriguing feature of quantum mechanics, but also a key resource in quantum information science. The entanglement content of random pure quantum states is almost maximal; such states find applications in various quantum information protocols. The preparation of a random state or, equivalently, the implementation of a random unitary operator, requires a number of elementary one- and two-qubit gates that is exponential in the number n_q of qubits, thus becoming rapidly unfeasible when increasing n_q. On the other hand, pseudo-random states approximating to the desired accuracy the entanglement properties of true random states may be generated efficiently, that is, polynomially in n_q. In particular, quantum chaotic maps are efficient generators of multipartite entanglement among the qubits, close to that expected for random states. This review discusses several aspects of the relationship between entanglement, randomness and chaos. In particular, I will focus on the following items: (i) the robustness of the entanglement generated by quantum chaotic maps when taking into account the unavoidable noise sources affecting a quantum computer; (ii) the detection of the entanglement of high-dimensional (mixtures of) random states, an issue also related to the question of the emergence of classicality in coarse grained quantum chaotic dynamics; (iii) the decoherence induced by the coupling of a system to a chaotic environment, that is, by the entanglement established between the system and the environment.
We investigate the entanglement properties of multiparticle systems, concentrating on the case where the entanglement is robust against the disposal of particles. Two qubits---belonging to a multipartite system---are entangled in this sense if their reduced density matrix is entangled. We introduce a family of multiqubit states, for which one can choose for any pair of qubits independently whether they should be entangled or not as well as the relative strength of the entanglement, thus providing the possibility to construct all kinds of ``entanglement molecules.'' For some particular configurations, we also give the maximal amount of entanglement achievable.
A quantum internet aims at harnessing networked quantum technologies, namely by distributing bipartite entanglement between distant nodes. However, multipartite entanglement between the nodes may empower the quantum internet for additional or better applications for communications, sensing, and computation. In this work, we present an algorithm for generating multipartite entanglement between different nodes of a quantum network with noisy quantum repeaters and imperfect quantum memories, where the links are entangled pairs. Our algorithm is optimal for GHZ states with 3 qubits, maximising simultaneously the final state fidelity and the rate of entanglement distribution. Furthermore, we determine the conditions yielding this simultaneous optimality for GHZ states with a higher number of qubits, and for other types of multipartite entanglement. Our algorithm is general also in the sense that it can optimise simultaneously arbitrary parameters. This work opens the way to optimally generate multipartite quantum correlations over noisy quantum networks, an important resource for distributed quantum technologies.
Abstract We introduce a potential of multipartite entanglement for a system of n qubits, as the average over all balanced bipartitions of a bipartite entanglement measure, the purity. We study in detail its expression and look for its minimizers, the maximally multipartite entangled states. They have a bipartite entanglement that does not depend on the bipartition and is maximal for all possible bipartitions. We investigate their structure and consider several examples for small n. Key words Entanglement, quantum nonlocality, quantum information, Hilbert spaces 1
We introduce the notion of maximally multipartite entangled states of nnn qubits as a generalization of the bipartite case. These pure states have a bipartite entanglement that does not depend on the bipartition and is maximal for all possible bipartitions. They are solutions of a minimization problem. Examples for small nnn are investigated, both analytically and numerically.