Generating graph states with a single quantum emitter and the minimum number of fusions
arXiv:2412.04587 · doi:10.1103/PhysRevA.111.052604
Abstract
Graph states are the key resources for measurement- and fusion-based quantum computing with photons, yet their creation is experimentally challenging. We optimize a hybrid graph-state generation scheme using a single quantum emitter and linear optics Bell-state measurements called fusions. We first generate a restricted class of states from a single quantum emitter and then apply fusions to create a target graph state, where we use a dynamic programming approach to find the construction that requires the lowest possible number of fusions. Our analysis yields a lookup table for constructing non-isomorphic graph states with the minimum number of fusions. The lookup table covers all graph states with up to eight qubits and several other ones with up to 14 qubits. We present construction protocols of selected graph states and provide the lookup table. For large graph states that are not in the lookup table, we derive bounds for the required number of fusions using graph-theoretic properties. Finally, we use the lookup table to search for the best graph codes for loss-tolerant encodings, given a fixed number of fusions for their construction.
References in corpus (39)
- Improved Simulation of Stabilizer Circuits
- Multi-party entanglement in graph states
- Resource-efficient linear optical quantum computation
- Efficient high-fidelity quantum computation using matter qubits and linear optics
- All photonic quantum repeaters
- A 10-qubit solid-state spin register with quantum memory up to one minute
- A fault-tolerant one-way quantum computer
- 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
- Robust multi-qubit quantum network node with integrated error detection
- Efficient quantum computation with probabilistic quantum gates
- Photonic tensor networks produced by a single quantum emitter
- Optically generated 2-dimensional photonic cluster state from coupled quantum dots
- Collective super- and subradiant dynamics between distant optical quantum emitters
- Quantum Error Correcting Codes Using Qudit Graph States
- Deterministic generation of all-photonic quantum repeaters from solid-state emitters
- Entanglement engineering of one-photon wavepackets using a single-atom source
- An efficient algorithm to recognize local Clifford equivalence of graph states
- High-fidelity multi-photon-entangled cluster state with solid-state quantum emitters in photonic nanostructures
- Deterministic Generation of Loss-Tolerant Photonic Cluster States with a Single Quantum Emitter
- Fusion of deterministically generated photonic graph states
- Rank-width: Algorithmic and structural results
- High-threshold quantum computing by fusing one-dimensional cluster states
- Transforming graph states using single-qubit operations
- Optimal preparation of graph states
- Photonic resource state generation from a minimal number of quantum emitters
- Entanglement in eight-qubit graph states
- 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
- Near-deterministic creation of universal cluster states with probabilistic Bell measurements and 3-qubit resource states
- Graph states and local unitary transformations beyond local Clifford operations
- Graph-theoretical optimization of fusion-based graph state generation
- Loss-tolerant teleportation on large stabilizer states
- Loss-tolerant architecture for quantum computing with quantum emitters
- Optimization of deterministic photonic graph state generation via local operations
- Efficient percolation simulations for lossy photonic fusion networks
- The Influence of Experimental Imperfections on Photonic GHZ State Generation