Graph-theoretical optimization of fusion-based graph state generation
arXiv:2304.11988 · doi:10.22331/q-2023-12-20-1212
Abstract
Graph states are versatile resources for various quantum information processing tasks, including measurement-based quantum computing and quantum repeaters. Although the type-II fusion gate enables all-optical generation of graph states by combining small graph states, its non-deterministic nature hinders the efficient generation of large graph states. In this work, we present a graph-theoretical strategy to effectively optimize fusion-based generation of any given graph state, along with a Python package OptGraphState. Our strategy comprises three stages: simplifying the target graph state, building a fusion network, and determining the order of fusions. Utilizing this proposed method, we evaluate the resource overheads of random graphs and various well-known graphs. Additionally, we investigate the success probability of graph state generation given a restricted number of available resource states. We expect that our strategy and software will assist researchers in developing and assessing experimentally viable schemes that use photonic graph states.
arXiv comment22 pages, 14 figures. For more details on the python package OptGraphState, see https://github.com/seokhyung-lee/OptGraphState
References in corpus (48)
- Measurement-based quantum computation with cluster states
- Multi-party entanglement in graph states
- Resource-efficient linear optical quantum computation
- Topological fault-tolerance in cluster state quantum computation
- Optical quantum computation using cluster states
- All photonic quantum repeaters
- On Bell measurements for teleportation
- Graph States for Quantum Secret Sharing
- Quantum error-correcting codes associated with graphs
- A fault-tolerant one-way quantum computer
- Deterministic Generation of a Cluster State of Entangled Photons
- Efficient Quantum Computation using Coherent States
- Sequential generation of entangled multi-qubit states
- A photonic cluster state machine gun
- Linear Optical CNOT Gate in the Coincidence Basis
- Graphical description of the action of local Clifford transformations on graph states
- Quantum information processing for a coherent superposition state via a mixed entangled coherent channel
- Deterministic quantum teleportation of photonic quantum bits by a hybrid technique
- How good must single photon sources and detectors be for efficient linear optical quantum computation?
- Loss tolerance in one-way quantum computation via counterfactual error correction
- Quantum phase gate for photonic qubits using only beam splitters and post-selection
- 3/4-efficient Bell measurement with passive linear optics and unentangled ancillae
- Loss Tolerant Optical Qubits
- Experimental demonstration of graph-state quantum secret sharing
- Fault tolerant quantum computation with very high threshold for loss errors
- Resource costs for fault-tolerant linear optical quantum computing
- Measurement-based quantum repeaters
- Graph States as a Resource for Quantum Metrology
- Universal and optimal error thresholds for measurement-based entanglement purification
- On-demand photonic entanglement synthesizer
- An efficient algorithm to recognize local Clifford equivalence of graph states
- Fundamental building block for all-optical scalable quantum networks
- Beating the One-half Limit of Ancilla-free Linear Optics Bell Measurements
- Two dimensional quantum repeaters
- Fully fault tolerant quantum computation with non-deterministic gates
- Fault-Tolerant Topological One-Way Quantum Computation with Probabilistic Two-Qubit Gates
- Resource-efficient and fault-tolerant topological quantum computation with hybrid entanglement of light
- Transforming graph states using single-qubit operations
- Fault-tolerant quantum computation with non-deterministic entangling gates
- Efficient Construction of Photonic Quantum Computational Clusters
- All-photonic architectural roadmap for scalable quantum computing using Greenberger-Horne-Zeilinger states
- Minimal resources for linear optical one-way computing
- Hard limits on the postselectability of optical graph states
- Highly photon loss tolerant quantum computing using hybrid qubits
- Nearly deterministic Bell measurement with multiphoton entanglement for efficient quantum information processing
- Entanglement in Graph States and its Applications
- Parity-encoding-based quantum computing with Bayesian error tracking
- Construction of optimal resources for concatenated quantum protocols
Cited by in corpus (11)
- Encoded-Fusion-Based Quantum Computation for High Thresholds with Linear Optics
- Intra-QLAN Connectivity: beyond the Physical Topology
- Optimization of deterministic photonic graph state generation via local operations
- Minimizing resource overhead in fusion-based quantum computation using hybrid spin-photon devices
- GraphiQ: Quantum circuit design for photonic graph states
- Transforming graph states via Bell state measurements
- Generating graph states with a single quantum emitter and the minimum number of fusions
- Space-time Peer-to-Peer Distribution of Multi-party Entanglement for Any Quantum Network
- Minimising the number of edges in LC-equivalent graph states
- A dataflow programming framework for linear optical distributed quantum computing
- Symmetric and Antisymmetric Quantum States from Graph Structure and Orientation