Combinatorial entanglement
From MaRDI portal
Publication:2020668
Abstract: We present new combinatorial objects, which we call grid-labelled graphs, and show how these can be used to represent the quantum states arising in a scenario which we refer to as the faulty emitter scenario: we have a machine designed to emit a particular quantum state on demand, but which can make an error and emit a different one. The device is able to produce a list of candidate states which can be used as a kind of debugging information for testing entanglement. By reformulating the Peres-Horodecki and matrix realignment criteria we are able to capture some characteristic features of entanglement: we construct new bound entangled states, and demonstrate the limitations of matrix realignment. We show how the notion of LOCC is related to a generalisation of the graph isomorphism problem. We give a simple proof that asymptotically almost surely, grid-labelled graphs associated to very sparse density matrices are entangled. We develop tools for enumerating grid-labelled graphs that satisfy the Peres-Horodecki criterion up to a fixed number of vertices, and propose various computational problems for these objects, whose complexity remains an open problem. The proposed mathematical framework also suggests new combinatorial and algebraic ways for describing the structure of graphs.
Recommendations
- Combinatorial topology of multipartite entangled states
- Quantum entanglement in composite systems
- scientific article
- Quantum combing
- Entanglement measure for composite systems
- Combinatorial entanglement: detecting entanglement in quantum states using grid-labelled graphs
- Quantum entanglement in concept combinations
- The Compositional Structure of Multipartite Quantum Entanglement
- COMPLEMENTARITY OF ENTANGLEMENT AND INTERFERENCE
- Complementary quantum correlations among multipartite systems
Cites work
- A combinatorial approach to multipartite quantum systems: basic formulation
- A graph theoretical approach to states and unitary operations
- An Extreme Form of Superactivation for Quantum Zero-Error Capacities
- Classical deterministic complexity of Edmonds' Problem and quantum entanglement
- Combinatorial laplacians and positivity under partial transpose
- Computational complexity of the quantum separability problem
- Conditions for separability in generalized Laplacian matrices and diagonally dominant matrices as density matrices
- Cones and norms in the tensor product of matrix spaces.
- Entanglement can increase asymptotic rates of zero-error classical communication over classical channels
- Laplacian matrices of weighted digraphs represented as quantum states
- On the degree conjecture for separability of multipartite quantum states
- On the role of entanglement in quantum-computational speed-up
- Proposed experiment to test local hidden-variable theories
- Quantum cryptography based on Bell’s theorem
- Quantum entanglement
- Quantum state representation based on combinatorial Laplacian matrix of star-relevant graph
- Separability Criterion for Density Matrices
- Separability criterion and inseparable mixed states with positive partial transposition.
- Separability of \(n\)-particle mixed states: necessary and sufficient conditions in terms of linear maps
- Separability of density matrices of graphs for multipartite systems
- Superactivation of the Asymptotic Zero-Error Classical Capacity of a Quantum Channel
- The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states
- Zero-Error Communication via Quantum Channels, Noncommutative Graphs, and a Quantum Lovász Number
Cited in
(2)
This page was built for publication: Combinatorial entanglement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2020668)
