Cost-aware Photonic Graph State Generation: A Graphical Framework
- URL: http://arxiv.org/abs/2509.22777v1
- Date: Fri, 26 Sep 2025 18:00:01 GMT
- Title: Cost-aware Photonic Graph State Generation: A Graphical Framework
- Authors: Sobhan Ghanbari, Hoi-Kwong Lo,
- Abstract summary: Photonic graph states are essential resources for quantum computation and communication.<n>We introduce a cost-aware framework for the generation of photonic graph states of arbitrary size and shape.<n>Within this framework, we develop Graph Builder, a deterministic generation algorithm that achieves substantial reductions in two-qubit gate usage.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Photonic graph states are essential resources for quantum computation and communication. Deterministic emitter-based generation of graph states overcomes the scalability issues of probabilistic approaches, but their experimental realization is constrained by technological demands, often expressed by the number of two-qubit gates and the depth and/or width of the quantum circuits used to model the generation process. We introduce a cost-aware framework for the generation of photonic graph states of arbitrary size and shape, built on a complete set of necessary and sufficient conditions and a universal set of elementary graph operations that govern the evolution of the state toward the target. Within this framework, we develop Graph Builder, a deterministic generation algorithm that achieves substantial reductions (up to an order of magnitude) in two-qubit gate usage for both random and structured graphs, compared with alternative approaches. The algorithm uses the minimum number of emitters possible for a fixed emission sequence, while also supporting the use of extra emitters for controlled trade-offs between emitter count and other cost metrics. Moreover, by systematically identifying the degrees of freedom at each stage of the generation process, this framework fully characterizes the optimization landscape, enabling analytic, heuristic, or exhaustive strategies for further cost reductions. Our approach provides a general and versatile tool for designing and optimizing emitter-based photonic graph state generation protocols, essential for scalable and resource-efficient photonic quantum information processing.
Related papers
- Graph Signal Generative Diffusion Models [74.75869068073577]
We introduce U-shaped encoder-decoder graph neural networks (U-GNNs) for graph signal generation using denoising diffusion processes.<n>The architecture learns node features at different resolutions with skip connections between the encoder and decoder paths.<n>We demonstrate the effectiveness of the diffusion model in probabilistic forecasting of stock prices.
arXiv Detail & Related papers (2025-09-21T21:57:27Z) - A Scalable and Robust Compilation Framework for Emitter-Photonic Graph State [1.3624495460189865]
We study the GraphState-to-Circuit compilation problem in the context of the deterministic scheme.<n>We propose a novel compilation framework that partitions the target graph state into subgraphs, compiles them individually, and subsequently combines and schedules the circuits to maximize emitter resource utilization.
arXiv Detail & Related papers (2025-03-20T17:01:33Z) - Revisiting Graph Neural Networks on Graph-level Tasks: Comprehensive Experiments, Analysis, and Improvements [54.006506479865344]
We propose a unified evaluation framework for graph-level Graph Neural Networks (GNNs)<n>This framework provides a standardized setting to evaluate GNNs across diverse datasets.<n>We also propose a novel GNN model with enhanced expressivity and generalization capabilities.
arXiv Detail & Related papers (2025-01-01T08:48:53Z) - Heralded photonic graph states with inefficient quantum emitters [2.612403257963011]
Quantum emitter-based schemes for the generation of photonic graph states offer a promising, resource efficient methodology.<n>We present a heralded scheme for making photonic graph states that is compatible with the typically poor photon collection from state-of-the-art quantum emitters.
arXiv Detail & Related papers (2024-05-22T00:24:01Z) - GraphiQ: Quantum circuit design for photonic graph states [2.824850361520736]
GraphiQ is a versatile open-source framework for designing photonic graph state generation schemes.
It consists of a suite of design tools, including multiple simulation backends and optimization methods.
arXiv Detail & Related papers (2024-02-14T16:19:04Z) - Generating scalable graph states in an atom-nanophotonic interface [0.0]
scalable graph states are essential for measurement-based quantum computation and many entanglement-assisted applications in quantum technologies.
Here we propose to prepare high-fidelity and scalable graph states in one and two dimensions, which can be tailored in an atom-nanophotonic cavity.
An analysis of state fidelity is also presented, and the state preparation probability can be optimized via multiqubit state carvings and sequential single-photon probes.
arXiv Detail & Related papers (2023-10-06T03:33:32Z) - T-GAE: Transferable Graph Autoencoder for Network Alignment [79.89704126746204]
T-GAE is a graph autoencoder framework that leverages transferability and stability of GNNs to achieve efficient network alignment without retraining.
Our experiments demonstrate that T-GAE outperforms the state-of-the-art optimization method and the best GNN approach by up to 38.7% and 50.8%, respectively.
arXiv Detail & Related papers (2023-10-05T02:58:29Z) - Deep Prompt Tuning for Graph Transformers [55.2480439325792]
Fine-tuning is resource-intensive and requires storing multiple copies of large models.
We propose a novel approach called deep graph prompt tuning as an alternative to fine-tuning.
By freezing the pre-trained parameters and only updating the added tokens, our approach reduces the number of free parameters and eliminates the need for multiple model copies.
arXiv Detail & Related papers (2023-09-18T20:12:17Z) - Comprehensive Graph Gradual Pruning for Sparse Training in Graph Neural
Networks [52.566735716983956]
We propose a graph gradual pruning framework termed CGP to dynamically prune GNNs.
Unlike LTH-based methods, the proposed CGP approach requires no re-training, which significantly reduces the computation costs.
Our proposed strategy greatly improves both training and inference efficiency while matching or even exceeding the accuracy of existing methods.
arXiv Detail & Related papers (2022-07-18T14:23:31Z) - Near-deterministic hybrid generation of arbitrary photonic graph states
using a single quantum emitter and linear optics [0.0]
We introduce near-deterministic solutions for the generation of graph states using the current quantum emitter capabilities.
Our results should pave the way towards the practical implementation of resource-efficient quantum information processing.
arXiv Detail & Related papers (2022-05-19T17:59:59Z) - All-optical graph representation learning using integrated diffractive
photonic computing units [51.15389025760809]
Photonic neural networks perform brain-inspired computations using photons instead of electrons.
We propose an all-optical graph representation learning architecture, termed diffractive graph neural network (DGNN)
We demonstrate the use of DGNN extracted features for node and graph-level classification tasks with benchmark databases and achieve superior performance.
arXiv Detail & Related papers (2022-04-23T02:29:48Z) - A Robust and Generalized Framework for Adversarial Graph Embedding [73.37228022428663]
We propose a robust framework for adversarial graph embedding, named AGE.
AGE generates the fake neighbor nodes as the enhanced negative samples from the implicit distribution.
Based on this framework, we propose three models to handle three types of graph data.
arXiv Detail & Related papers (2021-05-22T07:05:48Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.