High-Fidelity Remote Graph State Preparation for Blind Quantum Computation
Abstract
Measurement-based quantum computation (MBQC) relies on entangled graph states, yet existing remote state preparation (RSP) protocols prepare only separable states, requiring subsequent entangling gates on the remote server. Here, we introduce Remote Graph State Preparation (RGSP), a framework that prepares arbitrary graph states directly from a single high-dimensional photonic qudit. By encoding multiple qubits and their graph connectivity into the photon's structured phase profile, RGSP can reduce or, for small computations, completely eliminate the need for server-side entangling operations among qubits. We show that under a reasonable noise model the resulting state fidelity is independent of the graph topology. Under cumulative fiber phase drift, we demonstrate that this fidelity is significantly enhanced by a ``highest-weight-first'' mode reordering strategy. Finally, we show that RGSP enables reduced-SWAP universal blind quantum computing on arbitrary topologies, reducing qubit overhead e.g., for a six-qubit Quantum Fourier Transform from $420$ RSP qubits with a standard brickwork topology to $48$ RSP qubits. These results establish RGSP as a resource-efficient, topology-invariant primitive for quantum-secured cloud computing.
Related
- Noise-Robust Quantum State Characterization for Remote State Preparation with Deep Learning
- Warm-Start Quantum Computation: Spectral-Weight Resources for Energy Readout and State Preparation
- Data and code for collision-model Dicke-state preparation: depth-fidelity frontiers, circuit costs, and superconducting-processor measurements
- Graph neural network based isomorphic learning of finite element computation for optical scattering problems
- Remote state preparation of a single-spin state via hybrid spin-photon entanglement
BibTeX
@misc{cai2026highfidelity,
title = {{High-Fidelity Remote Graph State Preparation for Blind Quantum Computation}},
author = {Jiawei Cai and Rex Fleur and Benedikt Tissot and Wolfgang Löffler and Tzula B. Propp},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.06247},
eprint = {2610.06247},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.06247},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - High-Fidelity Remote Graph State Preparation for Blind Quantum Computation
AU - Jiawei Cai
AU - Rex Fleur
AU - Benedikt Tissot
AU - Wolfgang Löffler
AU - Tzula B. Propp
PY - 2026
DA - 2026/10/05
PB - arXiv
DO - 10.48550/arxiv.2610.06247
UR - https://arxiv.org/abs/2610.06247
AB - Measurement-based quantum computation (MBQC) relies on entangled graph states, yet existing remote state preparation (RSP) protocols prepare only separable states, requiring subsequent entangling gates on the remote server. Here, we introduce Remote Graph State Preparation (RGSP), a framework that prepares arbitrary graph states directly from a single high-dimensional photonic qudit. By encoding multiple qubits and their graph connectivity into the photon's structured phase profile, RGSP can reduce or, for small computations, completely eliminate the need for server-side entangling operations among qubits. We show that under a reasonable noise model the resulting state fidelity is independent of the graph topology. Under cumulative fiber phase drift, we demonstrate that this fidelity is significantly enhanced by a ``highest-weight-first'' mode reordering strategy. Finally, we show that RGSP enables reduced-SWAP universal blind quantum computing on arbitrary topologies, reducing qubit overhead e.g., for a six-qubit Quantum Fourier Transform from $420$ RSP qubits with a standard brickwork topology to $48$ RSP qubits. These results establish RGSP as a resource-efficient, topology-invariant primitive for quantum-secured cloud computing.
ER -