Universal graph theory operations for graph state preparation

DOI10.1007/978-3-031-97063-4_5MaRDI QIDQ6899786zbMATH OpenFDO

Authors Tristan Cam, Cyril Gavoille, Yvan Le Borgne, Simon Martiel

Publication date 14 November 2025

Full work available at URL https://doi.org/10.1007/978-3-031-97063-4_5

zbMATH Keywords

graph statequantum circuittranspilation

Mathematics Subject Classification ID

Other nonclassical models of computation (68Q09) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)

Cites work

• An efficient algorithm to recognize locally equivalent graphs
• Graph states and the necessity of Euler decomposition
• scientific article; zbMATH DE number 3257167 (Why is no real title available?)
• Improving quantum computation by optimized qubit routing
• On the need for large quantum depth
• On the role of entanglement in quantum-computational speed-up
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum advantage in learning from experiments
• Shorter Stabilizer Circuits via Bruhat Decomposition and Quantum Circuit Transformations
• The Solovay--Kitaev algorithm
• Transforming graph states using single-qubit operations

This page was built for publication: Universal graph theory operations for graph state preparation

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