Encoding hypergraphs into quantum states

Ionicioiu and Spiller [Phys. Rev. A 85, 062313 (2012)] have recently presented an axiomatic framework for mapping graphs to quantum states of a suitable physical system. Based on their study, we first extend the axiomatic framework to hypergraphs by means of modifying its axioms and consistency conditions. Then we use the axiomatic approach to encode hypergraphs into a new family of quantum states, called the hypergraph states. Moreover, we also try to do the followings: (i) to show that real equally weighted states, which occur in Grover and Deutsch-Joza algorithms, are equivalent to hypergraph states; (ii) to describe the relations among hypergraph states, graph states and stabilizer states; (iii) to provide some transformation rules, stated in purely hypergraph theoretical terms, which completely characterize the evolution of hypergraph states under some local operations, including operators in Pauli group and some special local Pauli measurements; and (iv) to investigate some properties of multipartite entanglement of hypergraph states by hypergraph theory.

[1]  J. Eisert,et al.  Schmidt measure as a tool for quantifying multiparticle entanglement , 2000, quant-ph/0007081.

[2]  Gottesman.  Class of quantum error-correcting codes saturating the quantum Hamming bound. , 1996, Physical review. A, Atomic, molecular, and optical physics.

[3]  D. Gottesman.  Theory of fault-tolerant quantum computation , 1997, quant-ph/9702029.

[4]  C. Macchiavello,et al.  Multipartite entanglement in quantum algorithms , 2010, 1007.4179.

[5]  Jason Morton,et al.  Undecidability in tensor network states , 2012, 1205.3315.

[6]  F. Verstraete,et al.  Criticality, the area law, and the computational power of projected entangled pair states. , 2006, Physical review letters.

[7]  D. Deutsch,et al.  Rapid solution of problems by quantum computation , 1992, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.

[8]  Frank Verstraete,et al.  Peps as unique ground states of local hamiltonians , 2007, Quantum Inf. Comput..

[9]  John C. Baez.  Spin network states in gauge theory , 1994 .

[10]  Bart De Moor,et al.  Graphical description of the action of local Clifford transformations on graph states , 2003, quant-ph/0308151.

[11]  H. Briegel,et al.  Measurement-based quantum computation on cluster states , 2003, quant-ph/0301052.

[12]  Nicolas C. Menicucci,et al.  Graphical calculus for Gaussian pure states , 2010, 1007.0725.

[13]  M. Lewenstein,et al.  Quantum Entanglement , 2020, Quantum Mechanics.

[14]  R Raussendorf,et al.  A one-way quantum computer. , 2001, Physical review letters.

[15]  Jacob D. Biamonte,et al.  Categorical Tensor Network States , 2010, ArXiv.

[16]  Dirk Schlingemann.  Stabilizer codes can be realized as graph codes , 2002, Quantum Inf. Comput..

[17]  T. H. Johnson,et al.  Solving search problems by strongly simulating quantum circuits , 2012, Scientific Reports.

[18]  H. Briegel,et al.  Persistent entanglement in arrays of interacting particles. , 2000, Physical review letters.

[19]  Radu Ionicioiu,et al.  Encoding graphs into quantum states: An axiomatic approach , 2011, 1110.5681.

[20]  Igor L. Markov,et al.  Simulating Quantum Computation by Contracting Tensor Networks , 2008, SIAM J. Comput..

[21]  W. Dur,et al.  Multiparticle entanglement purification for two-colorable graph states (20 pages) , 2005 .

[22]  J. D. Biamonte,et al.  Ground-state spin logic , 2012, 1205.1742.

[23]  R. Griffiths,et al.  Quantum-error-correcting codes using qudit graph states , 2007, 0712.1979.

[24]  F. Verstraete,et al.  Computational complexity of projected entangled pair states. , 2007, Physical review letters.

[25]  J. Eisert,et al.  Multiparty entanglement in graph states , 2003, quant-ph/0307130.

[26]  Positivity of relativistic spin network evaluations , 2002, gr-qc/0211106.

[27]  S. Perseguers,et al.  Quantum random networks , 2009, 0907.3283.