Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1708.06101

Twisted Photons: New Quantum Perspectives in High Dimensions

Manuel Erhard·Robert Fickler·Mario Krenn·Anton Zeilinger
View original source ↗Read source document ↗Export metadata ↓

Abstract

Quantum information science and quantum information technology have seen a virtual explosion world-wide. It is all based on the observation that fundamental quantum phenomena on the individual particle or system-level lead to completely novel ways of encoding, processing and transmitting information. Quantum mechanics, a child of the first third of the 20th century, has found numerous realizations and technical applications, much more than was thought at the beginning. Decades later, it became possible to do experiments with individual quantum particles and quantum systems. This was due to technological progress, and for light in particular, the development of the laser. Hitherto, nearly all experiments and also nearly all realizations in the fields have been performed with qubits, which are two-level quantum systems. We suggest that this limitation is again mainly a technological one, because it is very difficult to create, manipulate and measure more complex quantum systems. Here, we provide a specific overview of some recent developments with higher-dimensional quantum systems. We mainly focus on Orbital Angular Momentum (OAM) states of photons and possible applications in quantum information protocols. Such states form discrete higher-dimensional quantum systems, also called qudits. Specifically, we will first address the question what kind of new fundamental properties exist and the quantum information applications which are opened up by such novel systems. Then we give an overview of recent developments in the field by discussing several notable experiments over the past 2-3 years. Finally, we conclude with several important open questions which will be interesting for investigations in the future.

Explore related subjects

quant-phphysics.optics

Keep this discovery

BibTeXRIS

Manuel Erhard, Robert Fickler, Mario Krenn, Anton Zeilinger. 2017-08-21. Twisted Photons: New Quantum Perspectives in High Dimensions. https://doi.org/10.1038/lsa.2017.146

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↗