Transforming graph states using single-qubit operations
From MaRDI portal
Publication:4561771
DOI10.1098/rsta.2017.0325zbMath1404.81073arXiv1805.05305OpenAlexW3103677072WikidataQ88885103 ScholiaQ88885103MaRDI QIDQ4561771
Stephanie Wehner, Axel Dahlberg
Publication date: 13 December 2018
Published in: Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.05305
computational complexitygraph statesrank-widthsingle-qubit Clifford operationssingle-qubit Pauli measurements
Related Items (6)
Quantum states associated to mixed graphs and their algebraic characterization ⋮ Counting single-qubit Clifford equivalent graph states is #P-complete ⋮ Evaluation of entanglement measures for hypergraph states up to four qubits ⋮ Efficient entanglement measure for graph states ⋮ The complexity of the vertex-minor problem ⋮ vertex-minors
Uses Software
Cites Work
- Unnamed Item
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- The complexity of subgraph isomorphism for classes of partial k-trees
- Recognizing locally equivalent graphs
- Vertex-minors, monadic second-order logic, and a conjecture by Seese
- On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
- Isotropic systems
- Graphic presentations of isotropic systems
- An efficient algorithm to recognize locally equivalent graphs
- Approximating clique-width and branch-width
- Rank-width and vertex-minors
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory
- Multiparty entanglement in graph states
- Graph minors. II. Algorithmic aspects of tree-width
- Graph states for quantum secret sharing
- Quantum Anonymous Transmissions
This page was built for publication: Transforming graph states using single-qubit operations
