Classical deterministic complexity of Edmonds' Problem and quantum entanglement
From MaRDI portal
Publication:3581264
DOI10.1145/780542.780545zbMath1192.68252DBLPconf/stoc/Gurvits03arXivquant-ph/0303055OpenAlexW2044630019WikidataQ56060212 ScholiaQ56060212MaRDI QIDQ3581264
Publication date: 16 August 2010
Published in: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0303055
Related Items (92)
The Van der Waerden conjecture for mixed discriminants ⋮ Bounds of M-eigenvalues and strong ellipticity conditions for elasticity tensors ⋮ Separability of Hermitian tensors and PSD decompositions ⋮ On the separability of unitarily invariant random quantum states: the unbalanced regime ⋮ Classical complexity and quantum entanglement ⋮ Halos and undecidability of tensor stable positive maps ⋮ Linear rank preservers of tensor products of rank one matrices ⋮ 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 ⋮ A tensor product matrix approximation problem in quantum physics ⋮ Joint measurability of quantum effects and the matrix diamond ⋮ On the mixed-unitary rank of quantum channels ⋮ Equation of motion for entanglement ⋮ Entanglement quantification from collective measurements processed by machine learning ⋮ On the reduction criterion for random quantum states ⋮ Approximation algorithms for homogeneous polynomial optimization with quadratic constraints ⋮ The construction of 7-qubit unextendible product bases of size ten ⋮ Kronecker Product Approximation of Operators in Spectral Norm via Alternating SDP ⋮ Combinatorial entanglement: detecting entanglement in quantum states using grid-labelled graphs ⋮ Quantum state tomography, entanglement detection and Bell violation prospects in weak decays of massive particles ⋮ M-eigenvalue inclusion intervals for a fourth-order partially symmetric tensor ⋮ The entanglement criteria based on equiangular tight frames ⋮ Experimental pairwise entanglement estimation for an \(N\)-qubit system. A machine learning approach for programming quantum hardware ⋮ Genuine-multipartite entanglement criteria based on positive maps ⋮ NP-hardness of deciding convexity of quartic polynomials and related problems ⋮ Automated machine learning can classify bound entangled states with tomograms ⋮ A family of separability criteria and lower bounds of concurrence ⋮ Quantum superpositions of ‘common-cause’ and ‘direct-cause’ causal structures ⋮ Graphs whose normalized Laplacian matrices are separable as density matrices in quantum mechanics ⋮ Mapping cone of \(k\)-entanglement breaking maps ⋮ Characterization of equivariant maps and application to entanglement detection ⋮ Unnamed Item ⋮ 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 ⋮ Computational tools for solving a marginal problem with applications in Bell non-locality and causal modeling ⋮ Limitations of semidefinite programs for separable states and entangled games ⋮ Computing quantum discord is NP-complete ⋮ Witnessing causal nonseparability ⋮ Causality gets entangled ⋮ Positive reduction from spectra ⋮ The sum-of-squares hierarchy on the sphere and applications in quantum information theory ⋮ \(\beta\)-Variational autoencoder as an entanglement classifier ⋮ Efficient optimization of the quantum relative entropy ⋮ A traversable wormhole teleportation protocol in the SYK model ⋮ New M-eigenvalue inclusion sets for fourth-order partially symmetric tensors with applications ⋮ Inequalities for the Schmidt number of bipartite states ⋮ Dvoretzky's theorem and the complexity of entanglement detection ⋮ Extrapolated quantum states, void states and a huge novel class of distillable entangled states ⋮ The inverse eigenvalue problem for entanglement witnesses ⋮ Bounds for the M-spectral radius of a fourth-order partially symmetric tensor ⋮ Calculation of quantum discord in higher dimensions for \(X\)- and other specialized states ⋮ Shorter unentangled proofs for ground state connectivity ⋮ Unnamed Item ⋮ An improved semidefinite programming hierarchy for testing entanglement ⋮ Entanglement Thresholds for Random Induced States ⋮ Combinatorial entanglement ⋮ Entanglement on multiple \(S^2\) boundaries in Chern-Simons theory ⋮ Random matrix techniques in quantum information theory ⋮ A successive approximation method for quantum separability ⋮ Combinatorial laplacians and positivity under partial transpose ⋮ Positive Maps and Separable Matrices ⋮ On the geometric probability of entangled mixed states ⋮ k-Extendibility of high-dimensional bipartite quantum states ⋮ Bipartite depolarizing maps ⋮ The weirdness theorem and the origin of quantum paradoxes ⋮ A semidefinite relaxation algorithm for checking completely positive separable matrices ⋮ Pairwise Completely Positive Matrices and Conjugate Local Diagonal Unitary Invariant Quantum States ⋮ A note on the degree conjecture for separability of multipartite quantum states ⋮ Open system quantum evolution and the assumption of complete positivity (A Tutorial) ⋮ The Computational Complexity of Duality ⋮ The complexity of relating quantum channels to master equations ⋮ On bipartite operators defined by sets of completely different permutations ⋮ Sinkhorn–Knopp theorem for rectangular positive maps ⋮ Inhomogeneous polynomial optimization over a convex set: An approximation approach ⋮ Matrix permanent and quantum entanglement of permutation invariant states ⋮ Sinkhorn-Knopp theorem for PPT states ⋮ Negativity spectra in random tensor networks and holography ⋮ Dimension-free entanglement detection in multipartite Werner states ⋮ Quantum indistinguishability through exchangeability ⋮ The automorphism group of separable states in quantum information theory ⋮ \(4\times 4\) unextendible product basis and genuinely entangled space ⋮ Decomposition of completely symmetric states ⋮ Equivalence classes and canonical forms for two-qutrit entangled states of rank four having positive partial transpose ⋮ Linear preservers and quantum information science ⋮ Product vectors in the ranges of multi-partite states with positive partial transposes and permanents of matrices ⋮ 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
This page was built for publication: Classical deterministic complexity of Edmonds' Problem and quantum entanglement
