Quantum Algorithms

Quantum computers hold the promise to be much more faster than any classical computer and solve problems that are intractable for even the most powerful classical machines. At the Quantum Computer Architecture Lab, we started looking at applications that can benefit from the quantum phenomena. One of those applications is Quantum Genome Sequencing .

Mapping of quantum algorithms

When adopting the circuit model as a computational model, algorithms can be described by quantum circuits consisting of qubits and gates. Such a circuit representation is hardware agnostic and assumes, for instance, that any arbitrary interaction (i.e. two-qubit gate) between qubits is possible and both qubits and gates are reliable. However, real quantum processors have specific constraints that must be complied to when executing a quantum algorithm, and therefore a procedure for mapping quantum circuits is required. One of the main constraints in current quantum experimental platforms is the limited connectivity between qubits that limits their interaction to only nearest-neighbour. This forces quantum states to me moved or routed to adjacent positions for interacting.
The mapping process includes placement and routing of qubits and scheduling of operations.

At the quantum computer architecture lab, we are developing models for mapping quantum algorithms on NISQ systems (tens to hundreds of noisy qubits) in which no QEC or hardly QEC is used, as well as on large scale quantum systems in which information is protected by using for instance Surface Code. An important aspect when the number of qubits grow, is the definition of a quantum plane architecture or infrastructure that allows moving quantum states around in an efficient way.