Quantum Algorithms

In conventional (classical) computers, information is encoded in bits. These are numeric variables that can take just one of two values at a time: either 0 or 1. In contrast, quantum computers use quantum (i.e. atomic or subatomic) particles to store and process information, giving rise to the notion of qubits. These allow us to exploit counter-intuitive properties such as quantum superpositions and entanglement for information processing, which opens a vast scope of possibilities beyond the classical binary logic of bits.

In particular, this leads to quantum algorithms for solving important problems that provide polynomial or even exponential run-time speed-ups over their classical counterparts. Such exponential speed-ups come ultimately from the fact that the number of parameters required for a classical computer to describe an N-qubit system grows exponentially in N. To give a concrete idea, this implies that a quantum system with a mere 280 qubits (today’s classical processors have over 500 million bits) requires more parameters than the estimated number of atoms in the observable universe!

Future, full-fledged universal quantum computers will have huge implications in artificial intelligence and big-data science, heavy industry and energy production and distribution, finance, pharmaceutics and material design, agriculture, genomics, and logistics and planning, just to name a few examples. In fact, even near-term quantum processors or simulators are expected to dramatically impact important sectors such as quantum chemistry, quantum machine learning, or combinatorial optimisations.

The Quantum Algorithms group is part of a global effort to devise procedures able to solve practical problems more efficiently than with classical devices and to find ways to implement them on near-term quantum hardware or future, full-fledged universal quantum computers. This requires a close dialogue with quantum information theory and experiment, computer science, mathematics, and engineering.

Quantum Algorithms Group

Prof. Dr Leandro Aolita

Executive Director

Prof. Dr Leandro Aolita is Executive Director of the Quantum Algorithms group. Prior to joining the Technology Innovation Institute, Prof. Aolita spent six years as a tenured Associate Professor of Physics at the Federal University of Rio de Janeiro in Brazil, where he still leads a group on Quantum Information and Computation Theory. In addition, he is a fellow of the Brazilian CNPq and FAPERJ agencies and a grantee of the highly competitive Serrapilheira Institute. Before that, he also spent seven years as a postdoctoral researcher at two of Europes most advanced centres: the Institute of Photonic Sciences in Barcelona, where he was a Juan de la Cierva Fellow, and the Free University of Berlin, where he was a Marie Curie Fellow.  Besides, his PhD thesis (Rio, 2008) was chosen as the “Best Brazilian PhD Thesis in Physics of the Year”.

View Google Scholar

Dr Abdulla Alhajri

Senior Researcher

Sergi Ramos-Calderer

Junior Researcher

Ruge Lin

Junior Researcher

Carlos Bravo-Prieto

Junior Researcher

Open PhD and postdoctoral positions

We are looking for extremely well-qualified and highly-motivated researchers at both the postdoctoral and PhD levels. If your professional background and experience overlap with our research topics, please reach out to leandro.aolita@tii.ae to learn more.

Quantum Algorithms Publications

Quantum Research Centre
Quantum Algorithms

Computational advantage from quantum superposition of multiple temporal orders o...

Márcio M. Taddei, Jaime Cariñe, Daniel Martínez, Tania García, Nayda Guerrero, Alastair A. Abbott, Mateus Araújo, Cyril Branciard, Esteban S. Gómez, Stephen P. Walborn, Leandro Aolita, and Gustavo Lima