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.

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•6 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

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

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•15 citations

Fusion for high-dimensional linear-optical quantum computing with improved success probability

Gözde Üstün, Eleanor Gilbert Rieffel, Simon J. Devitt +1 more

Type-II fusion is a probabilistic entangling measurement that is essential to measurement-based linear-optical quantum computing and can be used for quantum teleportation more broadly. However, it remains under-explored for high-dimensional qudits. Our main result gives a Type-II fusion protocol with proven success probability approximately 2 / d 2 for qudits of arbitrary dimension d . This generalizes a previous method that only applied to even-dimensional qudits. We believe this protocol to be the most efficient known protocol for Type-II fusion, with the d = 5 case beating the previous record by a factor of approximately 723 . We discuss the construction of the required ( d − 2 ) -qudit ancillary state using a silicon spin-qudit ancilla coupled to a microwave cavity through time-bin multiplexing. We then introduce a general framework of extra-dimensional corrections, a natural technique in linear optics that can be used to nondeterministically correct nonmaximally entangled projections into Bell measurements. We use this method to analyze and improve several different circuits for high-dimensional Type-II fusion and compare their benefits and drawbacks.

arXiv:2505.16816•Physical Review Applied•Aug 28, 2025•2 citations

Single-photon-boosted type-I fusion gates

A. A. Melkozerov, S. S. Straupe, M. Yu. Saygin

Fusion measurements are a key primitive for linear-optical quantum computing and quantum networks. Type-I and type-II fusion gates are widely used to combine small entangled resource states into larger photonic states, but without ancillary resources their success probability is limited to $1/2$. Existing $3/4$-efficient type-I schemes rely on entangled Bell-pair ancillary states, whose preparation is itself probabilistic and resource-intensive. Here we propose a boosted type-I fusion gate using only four ancillary single photons and standard linear-optical primitives. For multiqubit GHZ and graph states, the gate succeeds directly with probability $5/8$, while a distillation protocol converts partially entangled outcomes into additional successful events, raising the total success probability to $11/16$ after one stage and asymptotically to $3/4$. We quantify the practical advantage of this scheme by estimating the photonic resources required for generating representative large entangled photonic states and show that the proposed gate significantly reduces the required overhead compared with existing schemes. These results expand the set of resource-efficient linear-optical primitives and enable a substantial reduction in the resource requirements for scalable photonic quantum computing and quantum communication.

quant-pharXiv:2603.27315•Physical Review Applied•Mar 31, 2026•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.
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.
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.
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.
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.
Type-II fusion is a probabilistic entangling measurement that is essential to measurement-based linear-optical quantum computing and can be used for quantum teleportation more broadly. However, it remains under-explored for high-dimensional qudits. Our main result gives a Type-II fusion protocol with proven success probability approximately 2 / d 2 for qudits of arbitrary dimension d . This generalizes a previous method that only applied to even-dimensional qudits. We believe this protocol to be the most efficient known protocol for Type-II fusion, with the d = 5 case beating the previous record by a factor of approximately 723 . We discuss the construction of the required ( d − 2 ) -qudit ancillary state using a silicon spin-qudit ancilla coupled to a microwave cavity through time-bin multiplexing. We then introduce a general framework of extra-dimensional corrections, a natural technique in linear optics that can be used to nondeterministically correct nonmaximally entangled projections into Bell measurements. We use this method to analyze and improve several different circuits for high-dimensional Type-II fusion and compare their benefits and drawbacks.
Fusion measurements are a key primitive for linear-optical quantum computing and quantum networks. Type-I and type-II fusion gates are widely used to combine small entangled resource states into larger photonic states, but without ancillary resources their success probability is limited to 1/21/21/2. Existing 3/43/43/4-efficient type-I schemes rely on entangled Bell-pair ancillary states, whose preparation is itself probabilistic and resource-intensive. Here we propose a boosted type-I fusion gate using only four ancillary single photons and standard linear-optical primitives. For multiqubit GHZ and graph states, the gate succeeds directly with probability 5/85/85/8, while a distillation protocol converts partially entangled outcomes into additional successful events, raising the total success probability to 11/1611/1611/16 after one stage and asymptotically to 3/43/43/4. We quantify the practical advantage of this scheme by estimating the photonic resources required for generating representative large entangled photonic states and show that the proposed gate significantly reduces the required overhead compared with existing schemes. These results expand the set of resource-efficient linear-optical primitives and enable a substantial reduction in the resource requirements for scalable photonic quantum computing and quantum communication.