{"id":62383,"date":"2021-07-06T18:22:04","date_gmt":"2021-07-06T16:22:04","guid":{"rendered":"https:\/\/magazin.tu-braunschweig.de\/?post_type=kb_magazin&p=62383"},"modified":"2024-01-10T18:37:22","modified_gmt":"2024-01-10T17:37:22","slug":"master-of-miniaturisation","status":"publish","type":"kb_magazin","link":"https:\/\/magazin.tu-braunschweig.de\/en\/m-post\/master-of-miniaturisation\/","title":{"rendered":"Master of miniaturisation"},"content":{"rendered":"

Quantum Valley Lower Saxony<\/a> (QVLS) aims to build a scalable quantum computer by 2025. The emphasis here is on the word “scalable”. The first quantum computers already exist. However, it is extremely complex to increase their computing power without expanding the computer to the size of a gymnasium. One of the keys to the QVLS for the scalable quantum computer therefore lies in the Institute for CMOS Design<\/a> at Technische Universit\u00e4t Braunschweig.<\/p>\n

\"\"<\/a>

Technology in the tiniest of spaces: a view through the microscope shows the fine details of a chip. Photo credit: Max Fuhrmann\/TU Braunschweig<\/p><\/div>\n

In 2019, Google’s Sycamore quantum processor solved a task in a matter of minutes that would have taken a conventional supercomputer perhaps 10,000 years. The reason for this is the special architecture of quantum computers, which makes different solutions possible. Computing power increases with each quantum bit, or qubit. “Sycamore had just 53 qubits at its disposal when it achieved its milestone. The idea of one day combining millions of qubits in a single device has given rise to visions of the future. For example, quantum computers could revolutionise the search for new materials or medicines.<\/p>\n

But the special architecture of existing quantum computers is also their Achilles’ heel. On the one hand, it takes up space. IBM’s computer with 25 qubits, for example, takes up 27 cubic metres. On the other hand, qubits are currently short-lived and, depending on the type of quantum computer, can be faulty. This is a problem that cannot be solved even with more qubits. This is because if one qubit is faulty, several other qubits are needed to correct the error. A computer with more qubits, but a high probability of error, therefore has hardly any more computing power.<\/p>\n

Stable and scalable<\/h3>\n

Quantum Valley Lower Saxony (QVLS) focuses on exactly these two aspects: Scalability and fault tolerance. To ensure the latter, the network’s more than 400 scientists are primarily researching an ion trap quantum computer. Trapped ions in a vacuum are particularly stable qubits, even at room temperature. The researchers use microwave pulses to control the sealed qubits.<\/p>\n

\"\"<\/a>

Professor Vadim Issakov heads the Institute for CMOS Design at TU Braunschweig. Photo credit: Max Fuhrmann\/TU Braunschweig<\/p><\/div>\n

“The circuits for the qubits are the key to scalability,” explains Vadim Issakov, Professor of CMOS Design at TU Braunschweig. “At the moment, the pulse-generating components take up half a room. If we replace them with integrated circuits, i.e. chips, it suddenly becomes very compact: a component no longer needs half a square metre, but only nine square millimetres.<\/p>\n

Between basic research and technology transfer<\/h3>\n

As head of the new Institute for CMOS Design, Professor Issakov is conducting research at the interfaces of the Lower Saxony Quantum Alliance. On the one hand, there are alliances such as the Cluster of Excellence QuantumFrontiers<\/a>, which, together with Leibniz University Hannover and the Physikalisch-Technische Bundesanstalt, is researching the fundamentals of the quantum world. On the other hand, there are industrial partners who ultimately want to use quantum technologies commercially.<\/p>\n

Professor Vadim Issakov: “CMOS semiconductor technology is the way forward. We are using it to transfer the successes of basic research into applications needed by industry. Large, self-developed laboratory devices are thus transformed into tiny chips suitable for industrial production.”<\/p>\n