High-Dimensional Quantum Photonics: Roadmap

Mehul Malik; Micheal Kues; Takuya Ikuta; Hiroki Takesue; Daniele Bajoni; David J. Moss; Roberto Morandotti; Andrew Forbes; Stephen Walborn; Ebrahim Karimi; Yunhong Ding; Stefano Paesani; Caterina Vigliar; Benjamin Brecht; Christine Silberhorn; Frédéric Bouchard; Michał Karpiński; Benjamin Sussman; Joseph M. Lukens; Yaron Bromberg; Robert Fickler; Taira Giordani; Fabio Sciarrino; Yun Zheng; Jianwei Wang; Marcus Huber; Armin Tavakoli; Roope Uola; Nicolas Brunner; Nicolai Friis; Natalia Herrera Valencia; Jacquiline Romero; Will McCutcheon

arXiv · 2604.06528

High-Dimensional Quantum Photonics: Roadmap

View original source ↗Read source document ↗Export metadata ↓

Abstract

The field of high-dimensional quantum photonics involves the use of multimode photonic degrees-of-freedom such as the spatial, temporal, or spectral structure of light to encode multi-level quantum states. Recent years have seen rapid progress in the development of methods to generate, manipulate, and distribute such quantum states of light and their use in a range of quantum technology applications that offer practical advantages over conventional qubit-based approaches. High-dimensional quantum states of light encoded in photonic time-bins, frequency-bins, transverse-spatial modes, waveguide paths, and temporal modes have enabled noise-robust fundamental tests of quantum mechanics, error-resilient and high-capacity quantum communication protocols, andas well as efficient approaches for quantum information processing, to name just a few examples. However, research in this field has progressed fairly independently, with little exchange across different photonic degrees-of-freedom or between experiment and theory and no comprehensive comparison between degrees-of-freedom. This roadmap aims to bridge this gap by surveying progress in each area and identifying shared challenges and opportunities that cut across two or more photonic degrees-of-freedoms. We review early work and state-of-the-art experimental techniques under development for high-dimensional quantum states encoded in single and entangled photons, as well as theoretical tools for their measurement and certification. We outline the main outstanding challenges for theory and each experimental degree-of-freedom, identifying promising future directions of research that may enable these to be overcome. We end by discussing interconnections and shared challenges centered around their distribution, measurement, and manipulation, with a view towards their integration into next-generation quantum technology platforms and applications.

Explore related subjects

quant-ph

Keep this discovery

BibTeX RIS

Mehul Malik, Micheal Kues, Takuya Ikuta, Hiroki Takesue, Daniele Bajoni, David J. Moss, Roberto Morandotti, Andrew Forbes, Stephen Walborn, Ebrahim Karimi, Yunhong Ding, Stefano Paesani, Caterina Vigliar, Benjamin Brecht, Christine Silberhorn, Frédéric Bouchard, Michał Karpiński, Benjamin Sussman, Joseph M. Lukens, Yaron Bromberg, Robert Fickler, Taira Giordani, Fabio Sciarrino, Yun Zheng, Jianwei Wang, Marcus Huber, Armin Tavakoli, Roope Uola, Nicolas Brunner, Nicolai Friis, Natalia Herrera Valencia, Jacquiline Romero, Will McCutcheon. 2026-04-07. High-Dimensional Quantum Photonics: Roadmap. https://arxiv.org/abs/2604.06528

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Probing the Error-Mitigation Threshold with Matrix Product States

Quantum error mitigation relies on accurate noise characterization, but mismatches between the actual and characterized noise can be amplified and drive a sharp threshold between successful and failed mitigation. In random circuits, this threshold maps onto a random-field Ising transition, but previous exact numerics were limited to small one-dimensional and all-to-all systems, leaving explicit two-dimensional architectures unresolved. We develop a fixed-bond-dimension matrix-product-state method for the replicated transfer dynamics that extends threshold calculations beyond exact propagation while retaining the finite-size signatures of the transition. At system sizes beyond previous exact studies, we recover the predicted absence of a threshold for quenched disorder in 1D, obtain a sharper annealed all-to-all critical point, and resolve architecture-dependent finite-depth thresholds in 2D square and heavy-hex circuits. These results establish replicated tensor-network dynamics as a practical tool for probing error-mitigation thresholds in large and higher-dimensional noisy circuits.

quant-ph↗

arXiv2026

Low-cost algorithm-to-execution framework for surface-code quantum computing

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

quant-ph↗

arXiv2026

Sample-optimal learning of stabilizer states

It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $0<\delta<1/8$, satisfies $n+\lceil\log_2(1/\delta)\rceil-3\leq L_\delta(n)\leq n+\left\lceil\log_2(1/\delta)\right\rceil+4$. We present a polynomial-time quantum learning algorithm that saturates this bound, achieving a constant factor improvement in sample-complexity over previously known approaches. As an immediate corollary, we obtain via the Choi-Jamiolkowski isomorphism an algorithm for learning an unknown $n$-qubit Clifford unitary from $2n+\left\lceil\log_2(1/\delta)\right\rceil+4$ queries, the $n$-dependence of which we show to be optimal. Our proof technique, which involves Fourier analysis on the abelian group $\mathbb{Z}_4^n \times \mathbb{F}_2^{n(n-1)/2}$, seems to be qualitatively different to previous approaches to stabilizer state learning, and may be of some independent interest; in particular, it admits natural generalisations to further problems in quantum learning theory.

quant-ph↗