aiqbench analysis
This paper introduces a novel linear-optical quantum computation scheme that leverages high-dimensional qudits to enhance the success probability of fusion gates and improve loss tolerance in photonic systems. By defining qubit operations within subspaces of these qudit resource states, the approach eliminates the need for ancilla photons or complex error-correcting codes typically required in current architectures. The work represents a significant theoretical advancement for scalable photonic quantum computing, offering a more efficient pathway to generating 2D cluster states from 1D precursors.
Subdimensional linear-optical quantum computation: from qudit resource states to qubit quantum computation
arXiv:2610.03408v1 Announce Type: new 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.
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.
arXiv:2610.03408 [quant-ph]
(or arXiv:2610.03408v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2610.03408 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 202 words
Related coverage

Efficient Graph State Generation in Linear Optics
Quantum Journal · Aug 13, 2026
Efficient circuit compression by multiqudit entangling gates in linear optical quantum computation
arXiv · Jul 31, 2026
All-optical universal control of nuclear-spin qudits in trapped neutral atoms
arXiv · Sep 3, 2026

Extensible Photonics Achieves Universal Quantum Gate Sets
Quantum Zeitgeist · Aug 3, 2026