arXiv:2610.03408
Subdimensional linear-optical quantum computation: from qudit resource states to qubit quantum computation
Tomohiro Yamazaki
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.
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