An algorithm to explore entanglement in small systems
From MaRDI portal
Abstract: A quantum state's entanglement across a bipartite cut can be quantified with entanglement entropy or, more generally, Schmidt norms. Using only Schmidt decompositions, we present a simple iterative algorithm to maximize Schmidt norms. Depending on the choice of norm, the optimizing states maximize or minimize entanglement, possibly across several bipartite cuts at the same time and possibly only among states in a specified subspace. Recognizing that convergence but not success is certain, we use the algorithm to explore topics ranging from fermionic reduced density matrices and varieties of pure quantum states to absolutely maximally entangled states and minimal output entropy of channels.
Recommendations
- Quantification of entanglement by means of convergent iterations
- A two-way algorithm for the entanglement problem
- Calculation of the quantum entanglement measure of bipartite states, based on relative entropy, using genetic algorithms
- Searching for highly entangled multi-qubit states
- Quantum entanglement and approximation by positive matrices
Cites work
- A family of norms with applications in quantum information theory
- A family of norms with applications in quantum information theory. II
- A Few Steps More Towards NPT Bound Entanglement
- A Normal form for a Matrix under the Unitary Congruence Group
- Basic algebraic geometry 1. Varieties in projective space. Translated from the Russian by Miles Reid
- Bipartite entanglement in systems of identical particles: the partial transposition criterion
- Bounds on absolutely maximally entangled states from shadow inequalities, and the quantum MacWilliams identity
- Constructive counterexamples to the additivity of the minimum output Rényi entropy of quantum channels for allp> 2
- Counterexample to an additivity conjecture for output purity of quantum channels
- Counterexamples to the maximal \(p\)-norm multiplicativity conjecture for all \(p>1\)
- Entangled quantum systems and the Schmidt decomposition
- Entanglement between particle partitions in itinerant many-particle states
- Entropy and entanglement bounds for reduced density matrices of fermionic states
- Highly entangled, non-random subspaces of tensor products from quantum groups
- Holographic quantum error-correcting codes: toy models for the bulk/boundary correspondence
- scientific article; zbMATH DE number 5968745 (Why is no real title available?)
- Inequalities for the ranks of multipartite quantum states
- Maximal output purity and capacity for asymmetric unital qudit channels
- On the additivity conjecture in quantum information theory
- On the dimension of subspaces with bounded Schmidt rank
- On the maximal dimension of a completely entangled subspace for finite level quantum systems
- Some Properties of the Reduced Density Matrix
- States, effects, and operations. Fundamental notions of quantum theory. Lectures in mathematical physics at the University of Texas at Austin. Ed. by A. Böhm, J. D. Dollard and W. H. Wootters
- Subadditivity of eigenvalue sums
- The Hadamard-Schwarz inequality.
- The Pauli principle revisited
Cited in
(8)- Generating highly entangled states via discrete-time quantum walks with Parrondo sequences
- Absolutely maximally entangled states in tripartite heterogeneous systems
- Quantification of entanglement by means of convergent iterations
- Quantum geometric entanglement algorithm in one dimensional system based on matrix product state
- Lower bound on entanglement in subspaces defined by Young diagrams
- Derivation of the robustness from the concurrence
- Entanglement spectroscopy with a depth-two quantum circuit
- A two-way algorithm for the entanglement problem
This page was built for publication: An algorithm to explore entanglement in small systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4557723)
