Generalized graph states based on Hadamard matrices

DOI10.1063/1.4926427zbMath1322.81025arXiv1502.07195OpenAlexW3103489693MaRDI QIDQ5500751

Bei Zeng, Nengkun Yu, Shawn Xingshan Cui

Publication date: 10 August 2015

Published in: Journal of Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.07195

zbMATH Keywords

Hadamard matricesquantum computinggraph state

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum coherence, entanglement, quantum correlations (81P40) Boolean and Hadamard matrices (15B34) Quantum coding (general) (81P70)

Related Items (7)

Stabilizer codes and equientangled bases from phase states ⋮ Unnamed Item ⋮ Absolutely maximally entangled states from phase states ⋮ Shaded tangles for the design and verification of quantum circuits ⋮ Efficient entanglement measure for graph states ⋮ k-uniform maximally mixed states from multi-qudit phase states ⋮ Randomized entangled mixed states from phase states

Cites Work

• Unnamed Item
• Unnamed Item
• Finitely correlated states on quantum spin chains
• Graph-based classification of self-dual additive codes over finite fields
• All teleportation and dense coding schemes
• Multiparty entanglement in graph states
• All degree 6 local unitary invariants ofkqudits
• Generalized cluster states based on finite groups
• A Concise Guide to Complex Hadamard Matrices
• PEPS as unique ground states of local Hamiltonians
• Codeword stabilized quantum codes: Algorithm and structure
• Codeword Stabilized Quantum Codes
• A monomial matrix formalism to describe quantum many-body states
• Symmetry protection of measurement-based quantum computation in ground states
• A non-commuting stabilizer formalism
• Graph concatenation for quantum codes

This page was built for publication: Generalized graph states based on Hadamard matrices