HARNESSING QUANTUM-COMPUTING & SIGNAL PROCESSING IN WIRELESS COMMUNICATIONS

Add to your list(s) Download to your calendar using vCal

• Lajos Hanzo, School of ECS, Univeristy of Southampton
• Thursday 11 May 2017, 16:00-17:00
• Room 611 (Gabor Seminar Room), EEE Building.

If you have a question about this talk, please contact Joan P O'Brien.

Abstract: Since Marconi demonstrated the feasibility of ra-dio transmissions, researchers have endeavoured to ful-fill the dream of flawless wireless multimedia telecom-munications, creating the impression of tele-presence – at the touch of a dialling key… However, making this dream a reality required ’quantum’ leaps both in digital signal processing and in its nano-electronics based implementation, facilitated by advances in science both in Edinburgh and far-ther afield. This process has been fuelled by a huge consumer market. Moore’s laws has indeed prevailed since he outlined his empirical rule-of-thumb in 1965, but based on this the scale of integration is set to de-part from classical physics obeying the well-understood rules revealed by science and enter into a new world, where the traveller has to obey the sometimes strange new rules of the quantum-world. The quest for quantum-domain communication solutions was inspired by Feynman’s revolutionary idea in 1985: particles such as photons or electrons might be relied upon for encoding, processing and delivering information. During the last three decades researchers and engineers often considered a pair of open problems. Firstly, classic systems relying on the efficient processing capability of quantum-search algorithms were considered in the area of quantum-assisted com-munications, while the branch of quantum-domain com-munications relies on quantum channels. The latter may simply be constituted by the deliterious effects of the environment perturbing the quantum-state particles.In wireless communications we often encounter large-scale search problems, some of which may be efficiently solved with the aid of bio-inspired random guided algorithms or quantum-search techniques. For example, Grover’s algorithm is capable of searching through an N-element data-base with the aid of √N cost-function evaluations. Commencing with a brief historical perspective, a variety of efficient quantum-assisted solutions will be exemplified.

Brief Bio: Lajos Hanzo FREng, FIEEE , FIET, RS Wolfson Fellow, received his 5-year Master degree in electronics from the Technical University of Budapest in 1976, his doctor-ate in 1983 and his Doctor of Sci-ences (DSc) degree in 2004. Dur-ing his career in telecommunica-tions he has held various research and academic posts in Hungary, Germany and the UK. Since 1986 he has been with the School of ECS , University of Southampton, UK, where holds the Chair in Telecom-munications. His current research interests are featured at (http://www-mobile.ecs.soton.ac.uk)

This talk is part of the Featured talks series.

This talk is included in these lists:

• Andrea Picciau's list
• COMMSP & CP list
• COMMSP Seminar
• Featured talks
• Room 611 (Gabor Seminar Room), EEE Building
• SAP Talks

Note that ex-directory lists are not shown.