Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Europhysics news

Quantum computers: where do we stand?

Giuliano Benenti, Giulio Casati

Published Jan 1, 2005• 1 citation
Publisher

Abstract

Q uantum mechanics has had an enormous technological and societal impact.To grasp this point, it is sufficient to cite the invention of the transistor, perhaps the most remarkable among the countless other applications of quantum mechanics.It is also easy to see the enormous impact of computers on everyday life.The importance of computers is such that it is appropriate to say that we are now living in the information age.This information revolution became possible thanks to the invention of the tran sistor, that is, thanks to the synergy between computer science and quantum physics.Today this synergy offers completely new opportunities and promises exciting advances in both funda mental science and technological application.We are referring here to the fact that quantum mechanics can be used to process and transmit information [1,2].Miniaturization provides us with an intuitive way of under standing why, in the near future, quantum laws will become important for computation.The electronics industry for com puters grows hand-in-hand with the decrease in size of integrated circuits.This miniaturization is necessary to increase computa tional power, that is, the number of floating-point operations per second (flops) a computer can perform.In the 1950's, electronic computers based on vacuum-tube technology were capable of performing approximately 103 floating-point operations per second, while nowadays there exist supercomputers whose power is greater than lOteraflops (1013 flops).As we have remarked, this enormous growth of computational power has been made possi ble owing to progress in m in ia tu riz a tio n , w hich m ay be quantified empirically in Moore's law.This law is the result of a remarkable observation made by Gordon Moore in 1965: the number of transistors on a single integrated-circuit chip doubles approximately every 18 24 months.This exponential growth has not yet saturated and Moore's law is still valid.At the present time the limit is approximately 108 transistors per chip and the typical size of circuit components is of the order of 100 nanometres.Extrapolating Moore's law, one would estimate that around the year 2020 we shall reach the atomic size for storing a single bit of inform atio n .At th a t p o in t, q u a n tu m effects will becom e unavoidably dominant.One should be aware that, besides quantum effects, other fac tors could bring Moore's law to an end.In the first place, there are economic considerations.Indeed, the cost of building fabri cation facilities to m an u factu re chips has also increased exponentially with time.Nevertheless, it is important to under stand the ultimate limitations set by quantum mechanics.Even though we might overcome economic barriers by means of tech nological breakthroughs, quantum physics sets fundamental limitations on the size of the circuit components.The first ques tion under debate is whether it would be more convenient to push References

DOI
10.1051/epn:2005105

Related papers

Quantum computation

Stephen Mark Barnett

In the preceding chapter we established that a suitable set of quantum gates, complemented by quantum error correction, allows us to produce a desired multiqubit unitary transformation. This transformation is one of the three steps in a quantum computation; the others, of course, are the preparation of the qubits in their initial state and the measurement of them after the transformation has been implemented. A quantum computation is designed to solve a problem or class of problems. The power of quantum computers is that they can do this, at least for some problems, very much more efficiently and quickly than any conventional computer based on classical logic operations. If we can build a quantum computer then a number of important problems which are currently intractable will become solvable. The potential for greatly enhanced computational power is, in itself, reason enough to study quantum computers, but there is another. Moore’s law is the observation that the number of transistors on a chip doubles roughly every eighteen months. A simple corollary is that computer performance also doubles on the same timescale. Associated with this exponential improvement is a dramatic reduction in the size of individual components. If the pace is to be kept up then it is inevitable that quantum effects will become increasingly important and ultimately will limit the operation of the computer. In these circumstances it is sensible to consider the possibility of harnessing quantum effects to realize quantum information processors and computers. We start with a brief introduction to the theory of computer science, the principles of which underlie the operation of what we shall refer to as classical computers. These include all existing machines and any based on the manipulation of classical bits. The development of computer science owes much to Turing, who devised a simple but powerful model of a computing device: the Turing machine. It its most elementary form, this consists of four elements. (i) A tape for data storage, which acts as a memory. This tape has a sequence of spaces, each of which has on it one of a finite set of symbols. (ii) A processor, which controls the operations of the machine.

Oxford University Press eBooks•May 28, 2009•0 citations

Studies on Entanglement in Nuclear and Electron Spin Systems for Quantum Computing

Robabeh Rahimi Darabad

The enormous impact of computers on everyday life is an incredible fact. The current technology of the computers is based on th technology of transistors, which is an appreciated synergy between computer science and quantum physics. Smaller transistors can work with less power, can be highly densed and can be switched on and off very fast. While the miniaturization is necessary to increase the computation power, this miniaturization also provides us with an intuitive way of understanding why, in a near future, quantum laws will become important for computation. Gordon Moore? in 1965 codified his law, known as Moore’s law, on the growth of computers. It states that the power of computers will double for constant cost roughly once every two years. This statement amazingly has come true for decades, since the 1960s. This growth is achieved through miniaturizing the size of the computers, by compacting the number of transistors. There is of course a limit for the number of transistors per chip and at present time it is almost 10 18 for a typical size of circuit components to be of the order of 100 nanometers. Then this is a fact that around 2020 we will reach the atomic size for storing a single bit of information, hence quantum effects

•Jan 1, 2006•2 citations

Introduction to Quantum Information Processing

Elham Kashefi

The topic of these lectures lies in the new and rapidly growing field of quantum computing,which explores connections between physics and computing in general. Quantum informa-tion processing is a cross-disciplinary field and is of great importance from both a funda-mental, as well as technological perspective [27]. From the fundamental perspective we havedeepened our understanding of the relationship between physics, information and computa-tion in general, and have also gained a deeper understanding of the fundamental aspects ofquantum theory - non-locality and entanglement in particular [31]. From the technologicalperspective we have manipulated larger and larger quantum systems and obtained power-ful practical applications in the domain of communication and cryptography such as theunconditionally secure quantum cryptography (key exchange) and quantum teleportation[7, 14, 5].Historically, the greater potential of the quantum computer was first realised by Feyn-man, who noted that quantum systems appear to be exponentially hard to simulate withclassical computers [15]. He speculated that, therefore, quantum computers could poten-tially be much more powerful than their classical counterparts. This intuition has beenproven to be correct for some tasks, such as factoring large numbers and searching unstruc-tured databases. Every computer is fundamentally a physical system, and any computationis just a physical process undergone by this system. Quantum physics is the most accurateway of describing physical systems and their behaviour in general. Encoding informationinto quantum systems and processing it according to the laws of quantum physics results innew features which do not exist in the classical computation.Large scale quantum computation is still hypothetical. However, Moore’s law

•Jan 1, 2004•0 citations

Quantum Computing Systems: A Brief Overview

Waranont Anukool, Jongseok Lim, Yunheung Song +1 more

A classical simulation of quantum systems demands enormous computational resources. The dimension of underlying Hilbert space scales exponentially with the number of participating elements ( N ), requiring a 2 2N size of calculation matrix for a unitary operation, for example, 2 100 ≈ 10 30 for only N = 50. With the increase of N , the first obstacle to encounter is in fact the deficiency of computer memories. A straightforward resolution is to use a quantum computer, a calculating device that operates with the principle of quantum mechanics. During the last twenty years, quantum computing once considered as theoretical exercise has become an important field of research in modern physics. At the forefront of quantum information technology, quantum computing has emerged as a new engineering field with broad interest not only in physics but also in computer science, electronics engineering, and mathematics.

Journal of the Korean Physical Society•Sep 1, 2018•7 citations

The Future of Quantum Computing

Yaash Sahnan

Quantum Computing often described as one of the most exciting frontiers of modern science—a field that does not just push the boundaries of technology but also reshapes how we think about solving problems. Unlike classical computers, which process information in simple 0s and 1s, quantum mechanics, allowing a single qubit to explore multiple possibilities at the same time. This gives them the potential to perform calculations that would take even today’s most powerful supercomputers thousands of years. In recent years, progress has been rapid, with breakthroughs in hardware, algorithms and applications that range from developing new medicines to strengthening artificial intelligence and tackling climate change. Yet, enormous challenges remain, such as stabilizing fragile qubits, reducing error rates, and making these systems accessible beyond a handful of elite labs. This paper explores both the promises and the pitfalls of quantum computing, offering a closer look at how it could reshape industries, global security and even the pace of human innovation in the decades ahead.

Iconic Research and Engineering Journals•Sep 17, 2025•0 citations

Quantum computing

Harry Paul

Why quantum computing? As we all know very well, conventional (electronic) computers have enormous power which, moreover, is constantly increasing. With their help gigantic quantities of data can be handled and evaluated. This is of crucial importance, for instance, in modern high energy physics experiments. On the other hand, computers can be used to model very complex systems with the aim of predicting, for example, future developments in our environment, notably climatic changes. Thanks to their incredible speed computers are, of course, destined to treat mathematical problems for which specific algorithms exist very efficiently. To mention a simple example, the digits of π are readily evaluated up to a very high order. Last, but not least, their potential to solve differential equations numerically, even when they are nonlinear, makes computers indispensable in modern research. So, one might ask, is there any reason to look for fundamentally new ways of computing as they are seemingly offered by quantum processes? What advantages can be expected when the laws of quantum mechanics, rather than those of classical physics, are exploited for computation? Two answers were given: first, the simulation of complex quantum systems on classical computers meets serious difficulties that might be overcome with the help of quantum computers. This idea was suggested in 1982 by R. Feynman, and in the 1990s it was indeed shown by several groups of researchers that quantum mechanical systems for which no efficient simulation on a classical computer is known can be efficiently simulated on a quantum computer.

Cambridge University Press eBooks•Jun 5, 2008•0 citations
Q uantum mechanics has had an enormous technological and societal impact.To grasp this point, it is sufficient to cite the invention of the transistor, perhaps the most remarkable among the countless other applications of quantum mechanics.It is also easy to see the enormous impact of computers on everyday life.The importance of computers is such that it is appropriate to say that we are now living in the information age.This information revolution became possible thanks to the invention of the tran sistor, that is, thanks to the synergy between computer science and quantum physics.Today this synergy offers completely new opportunities and promises exciting advances in both funda mental science and technological application.We are referring here to the fact that quantum mechanics can be used to process and transmit information [1,2].Miniaturization provides us with an intuitive way of under standing why, in the near future, quantum laws will become important for computation.The electronics industry for com puters grows hand-in-hand with the decrease in size of integrated circuits.This miniaturization is necessary to increase computa tional power, that is, the number of floating-point operations per second (flops) a computer can perform.In the 1950's, electronic computers based on vacuum-tube technology were capable of performing approximately 103 floating-point operations per second, while nowadays there exist supercomputers whose power is greater than lOteraflops (1013 flops).As we have remarked, this enormous growth of computational power has been made possi ble owing to progress in m in ia tu riz a tio n , w hich m ay be quantified empirically in Moore's law.This law is the result of a remarkable observation made by Gordon Moore in 1965: the number of transistors on a single integrated-circuit chip doubles approximately every 18 24 months.This exponential growth has not yet saturated and Moore's law is still valid.At the present time the limit is approximately 108 transistors per chip and the typical size of circuit components is of the order of 100 nanometres.Extrapolating Moore's law, one would estimate that around the year 2020 we shall reach the atomic size for storing a single bit of inform atio n .At th a t p o in t, q u a n tu m effects will becom e unavoidably dominant.One should be aware that, besides quantum effects, other fac tors could bring Moore's law to an end.In the first place, there are economic considerations.Indeed, the cost of building fabri cation facilities to m an u factu re chips has also increased exponentially with time.Nevertheless, it is important to under stand the ultimate limitations set by quantum mechanics.Even though we might overcome economic barriers by means of tech nological breakthroughs, quantum physics sets fundamental limitations on the size of the circuit components.The first ques tion under debate is whether it would be more convenient to push References
In the preceding chapter we established that a suitable set of quantum gates, complemented by quantum error correction, allows us to produce a desired multiqubit unitary transformation. This transformation is one of the three steps in a quantum computation; the others, of course, are the preparation of the qubits in their initial state and the measurement of them after the transformation has been implemented. A quantum computation is designed to solve a problem or class of problems. The power of quantum computers is that they can do this, at least for some problems, very much more efficiently and quickly than any conventional computer based on classical logic operations. If we can build a quantum computer then a number of important problems which are currently intractable will become solvable. The potential for greatly enhanced computational power is, in itself, reason enough to study quantum computers, but there is another. Moore’s law is the observation that the number of transistors on a chip doubles roughly every eighteen months. A simple corollary is that computer performance also doubles on the same timescale. Associated with this exponential improvement is a dramatic reduction in the size of individual components. If the pace is to be kept up then it is inevitable that quantum effects will become increasingly important and ultimately will limit the operation of the computer. In these circumstances it is sensible to consider the possibility of harnessing quantum effects to realize quantum information processors and computers. We start with a brief introduction to the theory of computer science, the principles of which underlie the operation of what we shall refer to as classical computers. These include all existing machines and any based on the manipulation of classical bits. The development of computer science owes much to Turing, who devised a simple but powerful model of a computing device: the Turing machine. It its most elementary form, this consists of four elements. (i) A tape for data storage, which acts as a memory. This tape has a sequence of spaces, each of which has on it one of a finite set of symbols. (ii) A processor, which controls the operations of the machine.
The enormous impact of computers on everyday life is an incredible fact. The current technology of the computers is based on th technology of transistors, which is an appreciated synergy between computer science and quantum physics. Smaller transistors can work with less power, can be highly densed and can be switched on and off very fast. While the miniaturization is necessary to increase the computation power, this miniaturization also provides us with an intuitive way of understanding why, in a near future, quantum laws will become important for computation. Gordon Moore? in 1965 codified his law, known as Moore’s law, on the growth of computers. It states that the power of computers will double for constant cost roughly once every two years. This statement amazingly has come true for decades, since the 1960s. This growth is achieved through miniaturizing the size of the computers, by compacting the number of transistors. There is of course a limit for the number of transistors per chip and at present time it is almost 10 18 for a typical size of circuit components to be of the order of 100 nanometers. Then this is a fact that around 2020 we will reach the atomic size for storing a single bit of information, hence quantum effects
The topic of these lectures lies in the new and rapidly growing field of quantum computing,which explores connections between physics and computing in general. Quantum informa-tion processing is a cross-disciplinary field and is of great importance from both a funda-mental, as well as technological perspective [27]. From the fundamental perspective we havedeepened our understanding of the relationship between physics, information and computa-tion in general, and have also gained a deeper understanding of the fundamental aspects ofquantum theory - non-locality and entanglement in particular [31]. From the technologicalperspective we have manipulated larger and larger quantum systems and obtained power-ful practical applications in the domain of communication and cryptography such as theunconditionally secure quantum cryptography (key exchange) and quantum teleportation[7, 14, 5].Historically, the greater potential of the quantum computer was first realised by Feyn-man, who noted that quantum systems appear to be exponentially hard to simulate withclassical computers [15]. He speculated that, therefore, quantum computers could poten-tially be much more powerful than their classical counterparts. This intuition has beenproven to be correct for some tasks, such as factoring large numbers and searching unstruc-tured databases. Every computer is fundamentally a physical system, and any computationis just a physical process undergone by this system. Quantum physics is the most accurateway of describing physical systems and their behaviour in general. Encoding informationinto quantum systems and processing it according to the laws of quantum physics results innew features which do not exist in the classical computation.Large scale quantum computation is still hypothetical. However, Moore’s law
A classical simulation of quantum systems demands enormous computational resources. The dimension of underlying Hilbert space scales exponentially with the number of participating elements ( N ), requiring a 2 2N size of calculation matrix for a unitary operation, for example, 2 100 ≈ 10 30 for only N = 50. With the increase of N , the first obstacle to encounter is in fact the deficiency of computer memories. A straightforward resolution is to use a quantum computer, a calculating device that operates with the principle of quantum mechanics. During the last twenty years, quantum computing once considered as theoretical exercise has become an important field of research in modern physics. At the forefront of quantum information technology, quantum computing has emerged as a new engineering field with broad interest not only in physics but also in computer science, electronics engineering, and mathematics.
Quantum Computing often described as one of the most exciting frontiers of modern science—a field that does not just push the boundaries of technology but also reshapes how we think about solving problems. Unlike classical computers, which process information in simple 0s and 1s, quantum mechanics, allowing a single qubit to explore multiple possibilities at the same time. This gives them the potential to perform calculations that would take even today’s most powerful supercomputers thousands of years. In recent years, progress has been rapid, with breakthroughs in hardware, algorithms and applications that range from developing new medicines to strengthening artificial intelligence and tackling climate change. Yet, enormous challenges remain, such as stabilizing fragile qubits, reducing error rates, and making these systems accessible beyond a handful of elite labs. This paper explores both the promises and the pitfalls of quantum computing, offering a closer look at how it could reshape industries, global security and even the pace of human innovation in the decades ahead.
Why quantum computing? As we all know very well, conventional (electronic) computers have enormous power which, moreover, is constantly increasing. With their help gigantic quantities of data can be handled and evaluated. This is of crucial importance, for instance, in modern high energy physics experiments. On the other hand, computers can be used to model very complex systems with the aim of predicting, for example, future developments in our environment, notably climatic changes. Thanks to their incredible speed computers are, of course, destined to treat mathematical problems for which specific algorithms exist very efficiently. To mention a simple example, the digits of π are readily evaluated up to a very high order. Last, but not least, their potential to solve differential equations numerically, even when they are nonlinear, makes computers indispensable in modern research. So, one might ask, is there any reason to look for fundamentally new ways of computing as they are seemingly offered by quantum processes? What advantages can be expected when the laws of quantum mechanics, rather than those of classical physics, are exploited for computation? Two answers were given: first, the simulation of complex quantum systems on classical computers meets serious difficulties that might be overcome with the help of quantum computers. This idea was suggested in 1982 by R. Feynman, and in the 1990s it was indeed shown by several groups of researchers that quantum mechanical systems for which no efficient simulation on a classical computer is known can be efficiently simulated on a quantum computer.