Transforming graph states using single-qubit operations
From MaRDI portal
Abstract: Stabilizer states form an important class of states in quantum information, and are of central importance in quantum error correction. Here, we provide an algorithm for deciding whether one stabilizer (target) state can be obtained from another stabilizer (source) state by single-qubit Clifford operations (LC), single-qubit Pauli measurements (LPM), and classical communication (CC) between sites holding the individual qubits. What's more, we provide a recipe to obtain the sequence of LC+LPM+CC operations which prepare the desired target state from the source state, and show how these operations can be applied in parallel to reach the target state in constant time. Our algorithm has applications in quantum networks, quantum computing, and can also serve as a design tool - for example, to find transformations between quantum error correcting codes. We provide a software implementation of our algorithm that makes this tool easier to apply. A key insight leading to our algorithm is to show that the problem is equivalent to one in graph theory, which is to decide whether some graph G' is a vertex-minor of another graph G. Here we show that the vertex-minor problem can be solved in time O(|G|^3) where |G| is the size of the graph G, whenever the rank-width of G and the size of G' are bounded. Our algorithm is based on techniques by Courcelle for solving fixed parameter tractable problems, where here the relevant fixed parameter is the rank width. The second half of this paper serves as an accessible but far from exhausting introduction to these concepts, that could be useful for many other problems in quantum information.
Recommendations
Cites work
- An efficient algorithm to recognize locally equivalent graphs
- Approximating clique-width and branch-width
- Graph minors. II. Algorithmic aspects of tree-width
- Graph states for quantum secret sharing
- Graphic presentations of isotropic systems
- Isotropic systems
- Linear-time algorithms for graphs of bounded rankwidth: a fresh look using game theory (extended abstract)
- Multiparty entanglement in graph states
- On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- Quantum Anonymous Transmissions
- Rank-width and vertex-minors
- Recognizing locally equivalent graphs
- The complexity of subgraph isomorphism for classes of partial k-trees
- The Heisenberg representation of quantum computers
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Vertex-minors, monadic second-order logic, and a conjecture by Seese
Cited in
(16)- From graph states to two-graph states
- Efficient entanglement measure for graph states
- The complexity of the vertex-minor problem
- Vector representations of graphs and distinguishing quantum product states with one-way LOCC
- Evaluation of entanglement measures for hypergraph states up to four qubits
- BDD operations for quantum graph states
- Which Graph States are Useful for Quantum Information Processing?
- Logical network implementation for graph codes and cluster states
- vertex-minors
- Counting single-qubit Clifford equivalent graph states is \#\(\mathbb{P}\)-complete
- Edge local complementation for logical cluster states
- Quantum states associated to mixed graphs and their algebraic characterization
- Vertex-minor universal graphs for generating entangled quantum subsystems
- Universal graph theory operations for graph state preparation
- Bell pair extraction using graph foliage techniques
- Local equivalence of stabilizer states: a graphical characterisation
This page was built for publication: Transforming graph states using single-qubit operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4561771)
