Encoding graphs into quantum states: an axiomatic approach
arXiv:1110.5681 · doi:10.1103/PhysRevA.85.062313
Abstract
A fundamental problem in quantum information is to describe efficiently multipartite quantum states. An efficient representation in terms of graphs exists for several families of quantum states (graph, cluster, stabilizer states), motivating us to extend this construction to other classes. We introduce an axiomatic framework for mapping graphs to quantum states of a suitable physical system. Starting from three general axioms we derived a rich structure which includes and generalizes several classes of multipartite entangled state, like graph/stabilizer states, Gaussian cluster states, quantum random networks and projected entangled pair states (PEPS). Due to its flexibility we can extend the present formalism to include directed and weighted graphs.
References in corpus (31)
- Fault-tolerant quantum computation by anyons
- Three qubits can be entangled in two inequivalent ways
- Area laws for the entanglement entropy - a review
- Good Quantum Error-Correcting Codes Exist
- Entropy and Area
- Measurement-based quantum computation with cluster states
- A Class of Quantum Error-Correcting Codes Saturating the Quantum Hamming Bound
- Multi-party entanglement in graph states
- A Theory of Fault-Tolerant Quantum Computation
- Criticality, the area law, and the computational power of PEPS
- On the Entangling Power of Quantum Evolutions
- Entropy, entanglement, and area: analytical results for harmonic lattice systems
- The computational complexity of PEPS
- Bipartite entanglement and entropic boundary law in lattice spin systems
- Experimental realization of Dicke states of up to six qubits for multiparty quantum networking
- Experimental Observation of Four-Photon Entangled Dicke State with High Fidelity
- Ground state entanglement and geometric entropy in the Kitaev's model
- Charge detection enables free-electron quantum computation
- Graphical calculus for Gaussian pure states
- Two-particle quantum walks applied to the graph isomorphism problem
- The laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states
- Quantum complex networks
- Multiparticle entanglement purification for two-colorable graph states
- Quantum Error Correcting Codes Using Qudit Graph States
- Quantum mechanics of lattice gas automata. I. One particle plane waves and potentials
- Multi-walker discrete time quantum walks on arbitrary graphs, their properties, and their photonic implementation
- Entangling spins by measuring charge: a parity-gate toolbox
- On preparation of the W-states from atomic ensembles
- Finding structural anomalies in graphs by means of quantum walks
- Quantum entanglement in states generated by bilocal group algebras
- Bipartite quantum states and random complex networks
Cited by in corpus (12)
- Encoding Hypergraphs into Quantum States
- Thermodynamic formalism for dissipative quantum walks
- Bipartite separability and non-local quantum operations on graphs
- Relationship among locally maximally entanglable states, W states and hypergraph states under local unitary transformations
- Qudit hypergraph states and their properties
- Multipartite Entanglement and Hypergraph states of three qubits
- Thermal state entanglement entropy on a quantum graph
- Controlled remote implementation of operations via graph states
- Entropic measure and hypergraph states
- Laplacian matrices of weighted digraphs represented as quantum states
- Symmetric and Antisymmetric Quantum States from Graph Structure and Orientation
- Renormalization and small-world model of fractal quantum repeater networks