Transforming graph states via Bell state measurements
arXiv:2405.02414 · doi:10.22331/q-2025-07-14-1795
Abstract
Graph states are key resources for measurement-based quantum computing, which is particularly promising for photonic systems. Fusions are probabilistic Bell state measurements, measuring pairs of parity operators of two qubits. Fusions can be used to connect/entangle different graph states, making them a powerful resource for measurement-based and related fusion-based quantum computing. There are several different graph structures and types of Bell state measurements, yet the associated graph transformations have only been analyzed for specific cases. Here, we provide a full set of graph transformation rules and give an intuitive visualization based on Venn diagrams of local neighborhoods of graph nodes. We derive these graph transformations for all types of rotated type-II fusion, showing that there are five different fusion success cases. Finally, we give application examples of the derived graph transformation rules and show that they can be used to construct graph codes or simulate fusion networks.
References in corpus (37)
- Measurement-based quantum computation with cluster states
- Improved Simulation of Stabilizer Circuits
- Multi-party entanglement in graph states
- Resource-efficient linear optical quantum computation
- All photonic quantum repeaters
- Instantaneous non-local computation of low T-depth quantum circuits
- High threshold universal quantum computation on the surface code
- A photonic cluster state machine gun
- Graphical description of the action of local Clifford transformations on graph states
- From three-photon GHZ states to ballistic universal quantum computation
- 3/4-efficient Bell measurement with passive linear optics and unentangled ancillae
- Quantum Hypergraph States
- Fast simulation of stabilizer circuits using a graph state representation
- Percolation, renormalization, and quantum computing with non-deterministic gates
- Quantum Error Correcting Codes Using Qudit Graph States
- Fusion of deterministically generated photonic graph states
- High-threshold quantum computing by fusing one-dimensional cluster states
- Optimal preparation of graph states
- Transforming graph states using single-qubit operations
- Photonic resource state generation from a minimal number of quantum emitters
- Mapping graph state orbits under local complementation
- Deterministic photon source of genuine three-qubit entanglement
- Near-deterministic hybrid generation of arbitrary photonic graph states using a single quantum emitter and linear optics
- High photon-loss threshold quantum computing using GHZ-state measurements
- Near-deterministic creation of universal cluster states with probabilistic Bell measurements and 3-qubit resource states
- Graphical description of the action of Clifford operators on stabilizer states
- Extracting GHZ states from linear cluster states
- Graph-theoretical optimization of fusion-based graph state generation
- Entanglement in Graph States and its Applications
- Efficient Inner-product Algorithm for Stabilizer States
- Iso-entangled bases and joint measurements
- Loss-tolerant architecture for quantum computing with quantum emitters
- Stabilizer codes can be realized as graph codes
- Increasing error tolerance in quantum computers with dynamic bias arrangement
- Photonic fusion of entangled resource states from a quantum emitter
- Clifford Manipulations of Stabilizer States: A graphical rule book for Clifford unitaries and measurements on cluster states, and application to photonic quantum computing
- Fault-tolerant complexes