Classical deterministic complexity of Edmonds' Problem and quantum entanglement
From MaRDI portal
Abstract: This paper continues research initiated in quant-ph/0201022 . The main subject here is the so-called Edmonds' problem of deciding if a given linear subspace of square matrices contains a nonsingular matrix . We present a deterministic polynomial time algorithm to solve this problem for linear subspaces satisfying a special matroids motivated property, called in the paper the Edmonds-Rado property . This property is shown to be very closely related to the separability of bipartite mixed states . One of the main tools used in the paper is the Quantum Permanent introduced in quant-ph/0201022 .
Cited in
(only showing first 100 items - show all)- On the separability of unitarily invariant random quantum states: the unbalanced regime
- Combinatorial entanglement: detecting entanglement in quantum states using grid-labelled graphs
- Limitations of semidefinite programs for separable states and entangled games
- Extrapolated quantum states, void states and a huge novel class of distillable entangled states
- The inverse eigenvalue problem for entanglement witnesses
- Classical complexity and quantum entanglement
- NP-hardness of deciding convexity of quartic polynomials and related problems
- A traversable wormhole teleportation protocol in the SYK model
- Inequalities for the Schmidt number of bipartite states
- Calculation of quantum discord in higher dimensions for \(X\)- and other specialized states
- Shorter unentangled proofs for ground state connectivity
- Combinatorial entanglement
- The weirdness theorem and the origin of quantum paradoxes
- Negativity spectra in random tensor networks and holography
- Dimension-free entanglement detection in multipartite Werner states
- Quantum indistinguishability through exchangeability
- \(4\times 4\) unextendible product basis and genuinely entangled space
- Decomposition of completely symmetric states
- Bounding the separable rank via polynomial optimization
- Quantum magnonics: when magnon spintronics meets quantum information science
- Noisy tensor completion via the sum-of-squares hierarchy
- Quantum entanglement, symmetric nonnegative quadratic polynomials and moment problems
- Spectral properties of symmetric quantum states and symmetric entanglement witnesses
- On the mixed-unitary rank of quantum channels
- Entanglement quantification from collective measurements processed by machine learning
- Characterization of equivariant maps and application to entanglement detection
- The sum-of-squares hierarchy on the sphere and applications in quantum information theory
- \(\beta\)-Variational autoencoder as an entanglement classifier
- New M-eigenvalue inclusion sets for fourth-order partially symmetric tensors with applications
- Entanglement on multiple \(S^2\) boundaries in Chern-Simons theory
- A semidefinite relaxation algorithm for checking completely positive separable matrices
- Sinkhorn-Knopp theorem for PPT states
- Product vectors in the ranges of multi-partite states with positive partial transposes and permanents of matrices
- M-eigenvalue inclusion intervals for a fourth-order partially symmetric tensor
- A successive approximation method for quantum separability
- Equation of motion for entanglement
- The construction of 7-qubit unextendible product bases of size ten
- Experimental pairwise entanglement estimation for an \(N\)-qubit system. A machine learning approach for programming quantum hardware
- Automated machine learning can classify bound entangled states with tomograms
- A family of separability criteria and lower bounds of concurrence
- Mapping cone of k-entanglement breaking maps
- Random matrix techniques in quantum information theory
- Positive maps and separable matrices
- k-extendibility of high-dimensional bipartite quantum states
- Bipartite depolarizing maps
- Open system quantum evolution and the assumption of complete positivity (a tutorial)
- The computational complexity of duality
- Equivalence classes and canonical forms for two-qutrit entangled states of rank four having positive partial transpose
- Linear preservers and quantum information science
- On the reduction criterion for random quantum states
- Linear rank preservers of tensor products of rank one matrices
- Joint measurability of quantum effects and the matrix diamond
- Computational tools for solving a marginal problem with applications in Bell non-locality and causal modeling
- Efficient optimization of the quantum relative entropy
- Dvoretzky's theorem and the complexity of entanglement detection
- Positive reduction from spectra
- A note on the degree conjecture for separability of multipartite quantum states
- Halos and undecidability of tensor stable positive maps
- scientific article; zbMATH DE number 7640512 (Why is no real title available?)
- Necessary and sufficient conditions for local manipulation of multipartite pure quantum states
- Computable entanglement conversion witness that is better than the negativity
- Entangled edge states of corank one with positive partial transposes
- Computing quantum discord is NP-complete
- Witnessing causal nonseparability
- Causality gets entangled
- Pairwise completely positive matrices and conjugate local diagonal unitary invariant quantum states
- On bipartite operators defined by sets of completely different permutations
- Sinkhorn-Knopp theorem for rectangular positive maps
- Matrix permanent and quantum entanglement of permutation invariant states
- The automorphism group of separable states in quantum information theory
- An improved semidefinite programming hierarchy for testing entanglement
- Genuine-multipartite entanglement criteria based on positive maps
- Combinatorial laplacians and positivity under partial transpose
- Inhomogeneous polynomial optimization over a convex set: an approximation approach
- Entanglement thresholds for random induced states
- Nullspaces of entanglement breaking channels and applications
- Enhance capability of separable ball criterion for the bipartite quantum states
- Computable lower bounds on the entanglement cost of quantum channels
- Bounds of M-eigenvalues and strong ellipticity conditions for elasticity tensors
- Separability of Hermitian tensors and PSD decompositions
- Kronecker Product Approximation of Operators in Spectral Norm via Alternating SDP
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- scientific article; zbMATH DE number 7692356 (Why is no real title available?)
- Quantum state tomography, entanglement detection and Bell violation prospects in weak decays of massive particles
- The entanglement criteria based on equiangular tight frames
- Quantum superpositions of ‘common-cause’ and ‘direct-cause’ causal structures
- Operator algebra generalization of a theorem of Watrous and mixed unitary quantum channels
- Geometry of entanglement and separability in Hilbert subspaces of dimension up to three
- A universal framework for entanglement detection under group symmetry
- Trade-off between bagging and boosting for quantum separability-entanglement classification
- Many bounded versions of undecidable problems are \textsf{NP}-hard
- Further results of \(\mathrm{M}\)-eigenvalue localization theorem for fourth-order partially symmetric tensors and their applications
- A note on the lower bounds of genuine multipartite entanglement concurrence
- Bounds for the M-spectral radius of a fourth-order partially symmetric tensor
- Robust entanglement measure for mixed quantum states
- Bipartite bound entanglement
- Matrix factorization ranks via polynomial optimization
- ANN-enhanced detection of multipartite entanglement in a three-qubit NMR quantum processor
- Non-unitarity maximizing unraveling of open quantum dynamics
- Multipartite entanglement in the diagonal symmetric subspace
This page was built for publication: Classical deterministic complexity of Edmonds' Problem and quantum entanglement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581264)
