Twisted Photons: New Quantum Perspectives in High Dimensions

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.Comment: 15 pages, 7 figure

Optimal Joint Routing and Scheduling in Millimeter-Wave Cellular Networks

Millimeter-wave (mmWave) communication is a promising technology to cope with the expected exponential increase in data traffic in 5G networks. mmWave networks typically require a very dense deployment of mmWave base stations (mmBS). To reduce cost and increase flexibility, wireless backhauling is needed to connect the mmBSs. The characteristics of mmWave communication, and specifically its high directional- ity, imply new requirements for efficient routing and scheduling paradigms. We propose an efficient scheduling method, so-called schedule-oriented optimization, based on matching theory that optimizes QoS metrics jointly with routing. It is capable of solving any scheduling problem that can be formulated as a linear program whose variables are link times and QoS metrics. As an example of the schedule-oriented optimization, we show the optimal solution of the maximum throughput fair scheduling (MTFS). Practically, the optimal scheduling can be obtained even for networks with over 200 mmBSs. To further increase the runtime performance, we propose an efficient edge-coloring based approximation algorithm with provable performance bound. It achieves over 80% of the optimal max-min throughput and runs 5 to 100 times faster than the optimal algorithm in practice. Finally, we extend the optimal and approximation algorithms for the cases of multi-RF-chain mmBSs and integrated backhaul and access networks.Comment: To appear in Proceedings of INFOCOM '1

An optimal procedure for the unconstrained max-NPV project scheduling problem with generalized precedence relations.

The unconstrained max-npv project scheduling problem involves the scheduling of the activities of a project in order to maximize its net present value. Assume a project represented in activity-on-mode (AoN) notation, in which the activities have a known duration and are subject to technological precedence constraints. Throughout each activity, a series of cash outflows and receipts may occur, which allows for the computation of a terminal cash flow value (positive or negative) upon the completion. The project is to be scheduled against a fixed deadline in the absence of resource constraints. Several procedures have been presented in the literature to cope with this problem. In this paper, we describe how one of the most efficient optimal procedures can be adapted to cope with generalized precedence relations, which introduce arbitrary minimal and maximal time lags between the start and completion of activities. The procedure has been programmed in Microsoft° Visual ++ 2.0 under Windows NT for use on a personal computer. Extensive computational results are reported.Scheduling; Optimal;