Classical complexity and quantum entanglement

DOI10.1016/J.JCSS.2004.06.003zbMath1093.81012OpenAlexW1966991151WikidataQ59620091 ScholiaQ59620091MaRDI QIDQ1886316

Publication date: 18 November 2004

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2004.06.003

zbMATH Keywords

entaglement Edmonds problem

Mathematics Subject Classification ID

Quantum computation (81P68) Combinatorial aspects of matroids and geometric lattices (05B35) Matrix pencils (15A22)

Related Items (85)

The Paulsen problem made simple ⋮ Detecting genuine multipartite entanglement in three-qubit systems with eternal non-Markovianity ⋮ Constructive non-commutative rank computation is in deterministic polynomial time ⋮ Combo separability criteria and lower bound on concurrence ⋮ Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time. ⋮ Construction of genuine multipartite entangled states ⋮ Information geometry of operator scaling ⋮ Construction of genuinely entangled multipartite subspaces from bipartite ones by reducing the total number of separated parties ⋮ Separable decompositions of bipartite mixed states ⋮ Classification of subspaces in \(\mathbb F^2\otimes \mathbb F^3\) and orbits in \(\mathbb F^2 \otimes \mathbb F^3 \otimes \mathbb F^r\) ⋮ Entanglement Robustness in Trace Decreasing Quantum Dynamics ⋮ Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory ⋮ Simultaneous robust subspace recovery and semi-stability of quiver representations ⋮ Non-commutative Edmonds' problem and matrix semi-invariants ⋮ Tripartite-to-bipartite entanglement transformation by stochastic local operations and classical communication and the structure of matrix spaces ⋮ Convex set of quantum states with positive partial transpose analysed by hit and run algorithm ⋮ Annihilating entanglement between cones ⋮ Separability criteria based on Bloch representation of density matrices ⋮ Connections between graphs and matrix spaces ⋮ A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with \(2 \times 2\) submatrices ⋮ Lower and upper bounds on nonunital qubit channel capacities ⋮ The entanglement criteria via a broad class of symmetric informationally complete measurements ⋮ A complex-valued gradient flow for the entangled bipartite low rank approximation ⋮ Automated machine learning can classify bound entangled states with tomograms ⋮ Tomographic witnessing and holographic quantifying of coherence ⋮ Positive tensor products of maps andn-tensor-stable positive qubit maps ⋮ Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting) ⋮ Separability criterion for three-qubit states with a four dimensional norm ⋮ Unnamed Item ⋮ Mixed-state entanglement and information recovery in thermalized states and evaporating black holes ⋮ Phase covariant qubit dynamics and divisibility ⋮ On Schrödinger's bridge problem ⋮ Separability of three qubit Greenberger–Horne–Zeilinger diagonal states ⋮ A remark on approximating permanents of positive definite matrices ⋮ Computing quantum discord is NP-complete ⋮ Construction of noisy bound entangled states and the range criterion ⋮ On hyperbolicity cones associated with elementary symmetric polynomials ⋮ Epsilon-net method for optimizations over separable states ⋮ Learning semidefinite regularizers ⋮ Decomposable Pauli diagonal maps and tensor squares of qubit maps ⋮ On non-commutative rank and tensor rank ⋮ Inequalities for the Schmidt number of bipartite states ⋮ Constructing entanglement witnesses from two mutually unbiased bases ⋮ Rank bounds for design matrices with block entries and geometric applications ⋮ Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling ⋮ Nonlinear Power-Like and SVD-Like Iterative Schemes with Applications to Entangled Bipartite Rank-1 Approximation ⋮ On bipartite unitary matrices generating subalgebra-preserving quantum operations ⋮ Necessary and sufficient product criteria for quantum states via the rank of realignment matrix of density matrix ⋮ Finding a low-rank basis in a matrix subspace ⋮ Polynomial degree bounds for matrix semi-invariants ⋮ Entanglement criterion via general symmetric informationally complete measurements ⋮ Geometry and the simplex: results, questions and ideas ⋮ On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries ⋮ FACIAL STRUCTURES FOR VARIOUS NOTIONS OF POSITIVITY AND APPLICATIONS TO THE THEORY OF ENTANGLEMENT ⋮ Faithful squashed entanglement ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the Bures volume of separable quantum states ⋮ Computing the nc-Rank via Discrete Convex Optimization on CAT(0) Spaces ⋮ Entanglement of positive definite functions on compact groups ⋮ Singular tuples of matrices is not a null cone (and the symmetries of algebraic varieties) ⋮ Operator scaling: theory and applications ⋮ Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings ⋮ Sinkhorn–Knopp theorem for rectangular positive maps ⋮ Matrix scaling and explicit doubly stochastic limits ⋮ From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge between Graphs and Alternating Matrix Spaces ⋮ Quantum entropic regularization of matrix-valued optimal transport ⋮ Edmonds' problem and the membership problem for orbit semigroups of quiver representations ⋮ Spectral Analysis of Matrix Scaling and Operator Scaling ⋮ Positive contraction mappings for classical and quantum Schrödinger systems ⋮ Sinkhorn-Knopp theorem for PPT states ⋮ Generating random quantum channels ⋮ Quantum mappings and characterization of entangled quantum states ⋮ Nonclassical mixed states that generate zero entanglement with a beam splitter ⋮ Invariant Theory and Scaling Algorithms for Maximum Likelihood Estimation ⋮ Maximum Likelihood Estimation for Matrix Normal Models via Quiver Representations ⋮ Approximating the set of separable states using the positive partial transpose test ⋮ Nonlinear Power-Like and SVD-Like Iterative Schemes with Applications to Entangled Bipartite Rank-1 Approximation ⋮ Further results on the cross norm criterion for separability ⋮ Computing valuations of the Dieudonné determinants ⋮ Entanglement criteria for the bosonic and fermionic induced ensembles ⋮ Low-rank approximation to entangled multipartite quantum systems ⋮ Joint separable numerical range and bipartite ultrafine entanglement witnessing ⋮ Rank-1 approximation for entangled multipartite real systems ⋮ Generalized Wong sequences and their applications to Edmonds' problems

Cites Work

This page was built for publication: Classical complexity and quantum entanglement