Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2610.03408

Subdimensional linear-optical quantum computation: from qudit resource states to qubit quantum computation

Tomohiro Yamazaki

quant-phSubmitted Oct 2, 2026• Announced Oct 5, 2026• 0 citations
arXivHTMLPDF

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.

AI Summary

The paper asks whether pairwise fusion gates (PFGs), which project two photonic qudits onto Bell states in randomly selected two-dimensional subspaces, can support universal qubit computation while retaining their enhanced success probability. Previously established PFGs succeed with probability $1-1/d$ without ancillary photons for maximally mixed inputs; the challenge is making independently selected subspaces compatible across multiple fusions. The construction introduces a mixed qudit–subspace ZX-diagrammatic representation and two adaptive single-qudit measurements that connect or merge effective qubits despite differing subspace labels. These tools generate multi-arm “seed states” from five-qudit one-dimensional cluster states, then fuse the seeds into arbitrary qubit graph states. The effective fusion retains success probability $p_k=1-d^{-(k+1)}$ using $2(2^k-1)$ ancillary photons, including the ancilla-free case $k=0$. Universality follows by constructing a two-dimensional qubit cluster state for measurement-based computation. For probabilistic assembly, a square-lattice percolation protocol treats fusion failures and photon losses through edge or vertex removal. Numerical percolation-crossing estimates show increasing loss tolerance with qudit dimension while keeping the photon count per resource state fixed. The loss threshold saturates because successful fusion also requires measurements of two remaining photons; ancillary-photon loss lowers the saturation value. The analysis neglects loss of photons representing graph vertices. Practical resource-state preparation remains a limitation: linear-optical qudit-state generation is less efficient, while direct generation by multilevel emitters is proposed rather than demonstrated. The construction also requires adaptive, subspace-dependent single-qudit operations.

No sign of AI-generated textAI use disclosedStrong assumptions
The numerical simulations were performed with Julia code generated by GPT-6 Astra, which was also used to assist with refining the mathematical arguments, preparing figures, and editing the manuscript.

Error found: The abstract's loss-tolerance statement is supported only by a percolation model that neglects loss of photons representing graph vertices, rather than by a complete resource-state photon-loss analysis.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
7 pages, 4 figures

Related papers

Linear-Optical Fusion Boosted by High-Dimensional Entanglement

Tomohiro Yamazaki, Koji Azuma

We propose a quantum measurement that probabilistically projects a pair of qudits of dimension d onto a Bell state in a two-qubit subspace. It can be implemented using linear-optical circuits with the success probabilities of 1-d^{-1} without ancilla photons and 1-d^{-(k+1)} with 2(2^{k}-1) ancilla photons. It allows us to entangle two independently prepared high-dimensional entangled states two dimensionally with higher success probabilities than ones of linear-optical fusion gates on qubits. As an application, we propose a fast quantum repeater protocol with three-qudit GHZ states and quantum memories.

arXiv:2407.10893•Physical Review Letters•May 20, 2025•9 citations

Efficient qudit based scheme for photonic quantum computing

Márton Karácsony, László Oroszlány, Zoltán Zimborás

Linear optics is a promising alternative for the realization of quantum computation protocols due to the recent advancements in integrated photonic technology. In this context, usually qubit based quantum circuits are considered, however, photonic systems naturally allow also for d-ary, i.e., qudit based, algorithms. This work investigates qudits defined by the possible photon number states of a single photon in d > 2 optical modes. We demonstrate how to construct locally optimal non-deterministic many-qudit gates using linear optics and photon number resolving detectors, and explore the use of qudit cluster states in the context of a d-ary optimization problem. We find that the qudit cluster states require less optical modes and are encoded by a fewer number of entangled photons than the qubit cluster states with similar computational capabilities. We illustrate the benefit of our qudit scheme by applying it to the k-coloring problem.

arXiv:2302.07357•SciPost Physics Core•Jun 3, 2024•21 citations

Efficient circuit compression by multiqudit entangling gates in linear optical quantum computation

Apurav Tehri, Jaskaran Singh

Linear optical quantum computation (LOQC) offers a promising platform for scalable quantum information processing, but its scalability is fundamentally constrained by the probabilistic nature of non-local entangling gates. Qudit circuit compression schemes mitigate this issue by encoding multiple qubits onto qudits. However, these schemes become inefficient when only a subset of the encoded qubits is required to participate in the non-local entangling gate, leading to an exponential increase in the number of non-local gates. In this Letter, we address this bottleneck by demonstrating the existence of multi-level control-Z (CZ) gates for qudits encoded in multiple spatial modes in LOQC. Unlike conventional two-level CZ gates, which act only on a single pair of modes, multi-level CZ gates impart a conditional phase shift for an arbitrarily chosen subset of the spatial modes. We present two explicit linear optical schemes that realize such operations, illustrating a fundamental trade-off between prior information about the input quantum state and the physical resources required. The first scheme is realized with a constant success probability of $1/8$ independent of the qudit dimension using a single non-local entangling gate, at the cost of state dependence, which is significantly better than the current success probability of $1/9$. Our second scheme provides a fully state independent realization reducing the number of non-local gates to $\mathcal{O}(2^{r_1}+2^{r_2})$ as compared to the existing bound of $\mathcal{O}(2^{r_1+r_2})$ where $r_1$ and $r_2$ are the number of qubits to be removed as control in the qudits. The success probability of the realization is $\frac{1}{2} \left(\frac{1}{8}\right)^{2^{r_1}+2^{r_2}}$. When combined with qudit circuit compression schemes, our results improve upon a key scalability limitation and significantly improve the efficiency of LOQC architectures.

quant-pharXiv:2602.08394•Physical Review A•Feb 10, 2026•0 citations

Towards practical linear optical quantum computing

Mercedes Gimeno-Segovia

Quantum computing promises a new paradigm of computation where information is processed in a way that has no classical analogue. There are a number of physical platforms conducive to quantum computation, each with a number of advantages and challenges. Single photons, manipulated using integrated linear optics, constitute a promising platform for universal quantum computation. Their low decoherence rates make them particularly favourable, however the inability to perform deterministic two-qubit gates and the issue of photon loss are challenges that need to be overcome. In this thesis we explore the construction of a linear optical quantum computer based on the cluster state model. We identify the different necessary stages: state preparation, cluster state construction and implementation of quantum error correcting codes, and address the challenges that arise in each of these stages. For the state preparation, we propose a series of linear optical circuits for the generation of small entangled states, assessing their performance under different scenarios. For the cluster state construction, we introduce a ballistic scheme which not only consumes an order of magnitude fewer resources than previously proposed schemes, but also benefits from a natural loss tolerance. Based on this scheme, we propose a full architectural blueprint with fixed physical depth. We make investigations into the resource efficiency of this architecture and propose a new multiplexing scheme which optimises the use of resources. Finally, we study the integration of quantum error-correcting codes in the linear optical scheme proposed and suggest three ways in which the linear optical scheme can be made fault-tolerant.

•Nov 1, 2015•15 citations

Quantum repeaters with linear-optical pairwise fusion gates

Koji Azuma, Tomohiro Yamazaki

Quantum repeaters are necessary building blocks to realize not only long-distance quantum communication but also the quantum internet. Although quantum repeater protocols are composed of entanglement generation (between adjacent nodes) and entanglement swapping, the performance strongly depends on the success probability of the entanglement swapping. In this talk, we introduce a linear-optical “pairwise” fusion gate that probabilistically projects a pair of qudits onto a Bell state in a two-qubit subspace. The success probability of this gate increases with the dimension of the qudits. We show that the scaling of quantum repeater protocols can be improved dramatically if we use our fusion gates for the entanglement swapping, instead of conventional ones.

Quantum Communications and Quantum Imaging•Sep 18, 2025•0 citations

High-dimensional photonic entanglement using linear optics

Alex E. Jones, Stefano Paesani, Jacob F. F. Bulmer +2 more

Encoding qudits into photons can provide improvements to quantum communication and computation tasks. Here, we present new schemes for generating high-dimensional photonic entanglement and show how to construct cluster states for universal qudit quantum computation.

Quantum 2.0 Conference and Exhibition•Jan 1, 2022•0 citations
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%50\%50% to 1−1/d1-1/d1−1/d for qudits of dimension ddd 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.
The paper asks whether pairwise fusion gates (PFGs), which project two photonic qudits onto Bell states in randomly selected two-dimensional subspaces, can support universal qubit computation while retaining their enhanced success probability. Previously established PFGs succeed with probability 1−1/d1-1/d1−1/d without ancillary photons for maximally mixed inputs; the challenge is making independently selected subspaces compatible across multiple fusions.
The construction introduces a mixed qudit–subspace ZX-diagrammatic representation and two adaptive single-qudit measurements that connect or merge effective qubits despite differing subspace labels. These tools generate multi-arm “seed states” from five-qudit one-dimensional cluster states, then fuse the seeds into arbitrary qubit graph states. The effective fusion retains success probability pk=1−d−(k+1)p_k=1-d^{-(k+1)}pk​=1−d−(k+1) using 2(2k−1)2(2^k-1)2(2k−1) ancillary photons, including the ancilla-free case k=0k=0k=0. Universality follows by constructing a two-dimensional qubit cluster state for measurement-based computation.
For probabilistic assembly, a square-lattice percolation protocol treats fusion failures and photon losses through edge or vertex removal. Numerical percolation-crossing estimates show increasing loss tolerance with qudit dimension while keeping the photon count per resource state fixed. The loss threshold saturates because successful fusion also requires measurements of two remaining photons; ancillary-photon loss lowers the saturation value. The analysis neglects loss of photons representing graph vertices. Practical resource-state preparation remains a limitation: linear-optical qudit-state generation is less efficient, while direct generation by multilevel emitters is proposed rather than demonstrated. The construction also requires adaptive, subspace-dependent single-qudit operations.
We propose a quantum measurement that probabilistically projects a pair of qudits of dimension d onto a Bell state in a two-qubit subspace. It can be implemented using linear-optical circuits with the success probabilities of 1-d^{-1} without ancilla photons and 1-d^{-(k+1)} with 2(2^{k}-1) ancilla photons. It allows us to entangle two independently prepared high-dimensional entangled states two dimensionally with higher success probabilities than ones of linear-optical fusion gates on qubits. As an application, we propose a fast quantum repeater protocol with three-qudit GHZ states and quantum memories.
Linear optics is a promising alternative for the realization of quantum computation protocols due to the recent advancements in integrated photonic technology. In this context, usually qubit based quantum circuits are considered, however, photonic systems naturally allow also for d-ary, i.e., qudit based, algorithms. This work investigates qudits defined by the possible photon number states of a single photon in d > 2 optical modes. We demonstrate how to construct locally optimal non-deterministic many-qudit gates using linear optics and photon number resolving detectors, and explore the use of qudit cluster states in the context of a d-ary optimization problem. We find that the qudit cluster states require less optical modes and are encoded by a fewer number of entangled photons than the qubit cluster states with similar computational capabilities. We illustrate the benefit of our qudit scheme by applying it to the k-coloring problem.
Linear optical quantum computation (LOQC) offers a promising platform for scalable quantum information processing, but its scalability is fundamentally constrained by the probabilistic nature of non-local entangling gates. Qudit circuit compression schemes mitigate this issue by encoding multiple qubits onto qudits. However, these schemes become inefficient when only a subset of the encoded qubits is required to participate in the non-local entangling gate, leading to an exponential increase in the number of non-local gates. In this Letter, we address this bottleneck by demonstrating the existence of multi-level control-Z (CZ) gates for qudits encoded in multiple spatial modes in LOQC. Unlike conventional two-level CZ gates, which act only on a single pair of modes, multi-level CZ gates impart a conditional phase shift for an arbitrarily chosen subset of the spatial modes. We present two explicit linear optical schemes that realize such operations, illustrating a fundamental trade-off between prior information about the input quantum state and the physical resources required. The first scheme is realized with a constant success probability of 1/81/81/8 independent of the qudit dimension using a single non-local entangling gate, at the cost of state dependence, which is significantly better than the current success probability of 1/91/91/9. Our second scheme provides a fully state independent realization reducing the number of non-local gates to O(2r1+2r2)\mathcal{O}(2^{r_1}+2^{r_2})O(2r1​+2r2​) as compared to the existing bound of O(2r1+r2)\mathcal{O}(2^{r_1+r_2})O(2r1​+r2​) where r1r_1r1​ and r2r_2r2​ are the number of qubits to be removed as control in the qudits. The success probability of the realization is 12(18)2r1+2r2\frac{1}{2} \left(\frac{1}{8}\right)^{2^{r_1}+2^{r_2}}21​(81​)2r1​+2r2​. When combined with qudit circuit compression schemes, our results improve upon a key scalability limitation and significantly improve the efficiency of LOQC architectures.
Quantum computing promises a new paradigm of computation where information is processed in a way that has no classical analogue. There are a number of physical platforms conducive to quantum computation, each with a number of advantages and challenges. Single photons, manipulated using integrated linear optics, constitute a promising platform for universal quantum computation. Their low decoherence rates make them particularly favourable, however the inability to perform deterministic two-qubit gates and the issue of photon loss are challenges that need to be overcome. In this thesis we explore the construction of a linear optical quantum computer based on the cluster state model. We identify the different necessary stages: state preparation, cluster state construction and implementation of quantum error correcting codes, and address the challenges that arise in each of these stages. For the state preparation, we propose a series of linear optical circuits for the generation of small entangled states, assessing their performance under different scenarios. For the cluster state construction, we introduce a ballistic scheme which not only consumes an order of magnitude fewer resources than previously proposed schemes, but also benefits from a natural loss tolerance. Based on this scheme, we propose a full architectural blueprint with fixed physical depth. We make investigations into the resource efficiency of this architecture and propose a new multiplexing scheme which optimises the use of resources. Finally, we study the integration of quantum error-correcting codes in the linear optical scheme proposed and suggest three ways in which the linear optical scheme can be made fault-tolerant.
Quantum repeaters are necessary building blocks to realize not only long-distance quantum communication but also the quantum internet. Although quantum repeater protocols are composed of entanglement generation (between adjacent nodes) and entanglement swapping, the performance strongly depends on the success probability of the entanglement swapping. In this talk, we introduce a linear-optical “pairwise” fusion gate that probabilistically projects a pair of qudits onto a Bell state in a two-qubit subspace. The success probability of this gate increases with the dimension of the qudits. We show that the scaling of quantum repeater protocols can be improved dramatically if we use our fusion gates for the entanglement swapping, instead of conventional ones.