Resources Required for Preparing Graph States

DOI10.1007/11940128_64MaRDI QIDQ5459158zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Peter Høyer, Mehdi Mhalla, Simon Perdrix

Publication date 24 April 2008

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11940128_64

zbMATH Keywords

AlgorithmsFoundations of computingQuantum Computing

Mathematics Subject Classification ID

Quantum computation (81P68)

Recommendations

• Multiparty entanglement in graph states
• Which Graph States are Useful for Quantum Information Processing?
• Entanglement in eight-qubit graph states

Cited in

(12)

• Investigation of preparation up to six and \(N\)-atom graph states
• Some quantum states prepared with polynomial quantum circuit
• An approximately universal set consisting of two observables
• BDD operations for quantum graph states
• State complexity and quantum computation
• Quantum computation in correlation space and extremal entanglement
• An Exact and Practical Classical Strategy for 2D Graph State Sampling
• Covering a graph with minimal local sets
• Bell pair extraction using graph foliage techniques
• Interpreting multipartite entanglement through topological summaries
• Local equivalence of stabilizer states: a graphical characterisation
• Deciding local unitary equivalence of graph states in quasi-polynomial time

This page was built for publication: Resources Required for Preparing Graph States

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5459158)