Subdimensional linear-optical quantum computation: from qudit resource states to qubit quantum computation
Abstract
In this paper, we propose a linear-optical quantum computation scheme that starts from high-dimensionally entangled qudits but performs quantum computation on qubits defined in their subspaces. This approach enables us to increase the success probability of linear-optical fusions from 50% to 1−1/d for qudits of dimension d without relying on existing approaches using ancilla photons and quantum codes. In particular, we show that a 2D cluster state of qubits can be generated from 5-qudit 1D cluster states using pairwise fusion gates while preserving their boosted success probability. We numerically demonstrate that this approach can improve the loss tolerance of a percolation-based scheme while keeping the photon number per resource state constant.
Related
- High-Threshold Fusion-Based Quantum Computation with Optical Hybrid Qubits
- Modular optical fault-tolerant quantum computation via an interface between verified resources and online logical operations
- Collision-aware Bayesian mitigation of photon loss in linear optical quantum circuits
- Handling Imperfections in Subcircuit Compilation for Linear Optical Quantum Computing
- Graph neural network based isomorphic learning of finite element computation for optical scattering problems
BibTeX
@misc{yamazaki2026subdimensional,
title = {{Subdimensional linear-optical quantum computation: from qudit resource states to qubit quantum computation}},
author = {Tomohiro Yamazaki},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.03408},
eprint = {2610.03408},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.03408},
}
RIS
TY - UNPB
TI - Subdimensional linear-optical quantum computation: from qudit resource states to qubit quantum computation
AU - Tomohiro Yamazaki
PY - 2026
DA - 2026/10/02
PB - arXiv
DO - 10.48550/arxiv.2610.03408
UR - https://arxiv.org/abs/2610.03408
AB - In this paper, we propose a linear-optical quantum computation scheme that starts from high-dimensionally entangled qudits but performs quantum computation on qubits defined in their subspaces. This approach enables us to increase the success probability of linear-optical fusions from 50% to 1−1/d for qudits of dimension d without relying on existing approaches using ancilla photons and quantum codes. In particular, we show that a 2D cluster state of qubits can be generated from 5-qudit 1D cluster states using pairwise fusion gates while preserving their boosted success probability. We numerically demonstrate that this approach can improve the loss tolerance of a percolation-based scheme while keeping the photon number per resource state constant.
ER -