adiabatic quantum computing

USC’s Information Sciences Institute (ISI) invites applications for a postdoc position starting immediately. This is a 1-year appointment with a strong possibility of reappointment.

In this position, the successful applicant is expected to contribute to the design and development of algorithms and methods in the field of adiabatic quantum computing (quantum annealing), specifically, searching for potential advantages of quantum annealers over standard algorithms.

Application deadline: 
Sunday, July 1, 2018

Atos is a leader in digital services with annual revenue of € 12 billion and 100,000 employees in 72 countries. Serving a global client base, Atos offers a variety of services including: Business & Platform Solutions, Infrastructure & Data Management, Technology Transformation Services, BPO, Cloud and Big Data & Cyber Security.

Application deadline: 
Wednesday, November 1, 2017

The Research Scientist for Quantum Computing will design experiments to run on emerging hardware to give insights into quantum approaches to NASA problems of interest, explore the robustness of the hardware, develop best practice programming techniques for quantum hardware, and illuminate the inner workings to better understand the mechanisms that can be used to provide a quantum computational advantage.

Essential Duties/Responsibilities:

Application deadline: 
Saturday, September 30, 2017
Thursday, June 2, 2016

European COST Action to develop “A quantum theory of complex and networked systems”

Open webnair 4:00 p.m. GMT – Thursday, June 2

One could argue that the fields of quantum information science and complex network theory (a.k.a. complexity science) both address complexity, yet from opposite perspectives. Indeed, the former makes use of a complex system as a computational resource whereas the later generally studies (and often using computer simulations) the scaling, collective behavior and emergent properties of complex system(s).

Accordingly, how the term complexity arises in these two fields is not always interchangeable. So called, computational complexity in quantum information science considers quantifying computational resources whereas complexity science investigates how relationships between parts give rise to collective behaviors of the whole.

And then after closer inspection, these two fields indeed also share some intriguing similarities. By correctly studying information as an entity fundamentally governed by the laws of physics, our development of an emerging common language is already binding certain ideas and mapping some techniques between these a priori distinct fields. What's more, the ubiquitous use of various network and graph theories inside of both disciplines, has allowed us to create a stage for an abstracted comparison of networked systems, recovering both fields as special cases of more general mathematical entities.

And even with these similarities, and other bridges still being built, there seems to be an even vaster host of differences. Pinpointing these similarities and reconciling these differences in increasingly precise terms broadly defines our research initiative aimed at a new theory, uniting the disciplines of quantum information science with the theory of complex and networked systems.

Skolkovo Institute of Science and Technology Moscow 143026
55° 41' 53.25" N, 37° 22' 2.658" E