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

arXiv:quant-ph/0509118

Quantum computing (Kwantumberekening)

Willem L. Fouché, Johannes Heidema, P. H. Potgieter

Published Sep 18, 2005• 0 citations
arXivHTMLPDF

Abstract

There has been no lack of coverage in the past few years in scientific journals of the topic of quantum computation. Rightly so, as this is a novel idea with--so far--at least one very important practical application (prime factorisation) as soon as the technology can accommodate reasonably sized computations. Interest in quantum computing has been sparked by both the realization that increasing miniaturisation will eventually bring computer scientists face-to-face with quantum effects, and by the grasping of the potential for massive parallelism inherent in the Hilbert space representation of quantum systems and in the special effects of quantum entanglement.

DOI
10.48550/arxiv.quant-ph/0509118

Related papers

Kwantumberekening

J. Heidema, Petrus H. Potgieter, W. L. Fouch ́ e

Daar is geen gebrek aan dekking in die laaste paar jaar in wetenskaplike joernale van die onderwerp van kwantumberekening nie. Tereg ook, want dit is ’n nuwe idee met—tot sover—minstens ´ e´ en baie belangrike praktiese toepassing (ontbinding in priemfaktore) sodra die tegnologie redelik omvattende berekenings kan hanteer. Die belangstelling in kwantumverwerking is aangevuur deur beide die besef dat die toenemende miniaturisering noodwendig rekenaarwetenskaplikes met kwantumverskynsels sal konfronteer, en deur die begryp van die potensiaal van massief parallelle verwerking deur die gebruik maak van die Hilbert-ruimtevoorstelling van kwantumstelsels en die spesiale eienskappe van kwantumverstrengeling. Die onderwerp lˆ e by die sameloop van fisika, rekenaarwetenskap en wiskunde en hierdie bydrae verken die idees van di´ e drie gebiede wat die belangrikste rol in kwantumberekening speel en besin oor die definisies van en die waarskynlike gebruik vir kwantumverwerking asook sy verhouding tot die klassieke berekeningskompleksiteit. Ten slotte word ’n uitgebreide geannoteerde bibliografie verskaf as gids vir die ge¨ ınteresseerde leser tot die literatuur in di´ e onderwerp.AbstractQuantum computing There has been no lack of coverage in the past few years in scientific journals of the topic of quantum computation. Rightly so, as this is a novel idea with—so far—at least one very important practical application (prime factorisation) as soon as the technology can accommodate reasonably sized computations. Interest in quantum computing has been sparked by both the realization that increasing miniaturisation will eventually bring computer scientists face-to-face with quantum effects, and by the grasping of the potential for massive parallelism inherent in the Hilbert space representation of quantum systems and in the special effects of quantum entanglement. The topic lies at the confluence of physics, computer science and mathematics and this contribution reviews the ideas from these three fields that play the most important role in quantum computation and reflects on the definitions of and prospective use for quantum computing as well as its relation to classical computational complexity. Finally, an extended annotated bibliography is provided as a guide for the interested reader to the literature in the subject.

Suid-Afrikaanse Tydskrif vir Natuurwetenskap en Tegnologie•Sep 23, 2005•1 citation

Quantum Computation

David Peter Divincenzo

If the bits of computers are someday scaled down to the size of individual atoms, quantum mechanical effects may profoundly change the nature of computation itself. The wave function of such a quantum computer could consist of a superposition of many computations carried out simultaneously; this kind of parallelism could be exploited to make some important computational problems, like the prime factoring of large integers, tractable. However, building such a quantum computer would place undreamed of demands on the experimental realization of highly quantum-coherent systems; present-day experimental capabilities in atomic physics and other fields permit only the most rudimentary implementation of quantum computation.

Science•Oct 13, 1995•1,655 citations

Quantum constraint programming.

Alessandra Di Pierro, Herbert Wiklicky

Abstract Quantum computers are hypothetical machines which can perform many calculations simultaneously based on quantum-mechanical principles that allows a single bit to coexist in many states at once. This enormous potential of quantum computing has attracted substantial interest, especially during the last decade, and initiated a whole new field of research. As a contribution to this research we address the problem of the design of high level languages for programming quantum computers, and the definition of an appropriate formal semantics for such languages. To this purpose we consider the Constraint Programming paradigm and we show how computations in this paradigm can be seen as physical processes obeying the laws of quantum mechanics. 1 Introduction Quantum Computing is currently one of the hottest topics in computer science, physics and engineering. One of the reason for such an interest is the dramatic miniaturisation in computer technology over the past 40 years, which will inevitably force (if the trend continues) the use of quantum physics to describe the elementary operations of a computer. The by now already flourishing research in quantum computing has arisen in anticipation of this inevitable step. If technological issues have started the studies of the new computational model, the discovery of its potential has made the interest continuously increasing, especially after the presentation of Shor's quantum factorisation algorithm [30], and Grover's search algorithm [14]. These algorithms heavily exploits quantum mechanical phenomena. Thanks to quantum effects like superposition and entanglement, a function can be evaluated on a quantum machine so as all the outputs are computed in the time taken to evaluate just one output classically. Although a measurement of the final superposed state can yield only one output, it is still possible to obtain certain joint properties of all the outputs. As a consequence of this quantum parallelism, Shor and Grover's algorithms are faster than any known classical algorithm designed for solving the same problems.

APPIA-GULP-PRODE•Jan 1, 2001•3 citations

QUANTUM COMPUTING: THE TECHNOLOGICAL BREAKTHROUGHS, APPLICATIONS, CHALLENGES, AND THE FUTURE OF COMPUTATION

Mushtaque Ahmed Rahu1, Muzamil Hussain2, Sakina Kamboh3, Sayed Mazhar Ali4, Arsalan Rajpar5

•May 21, 2026•0 citations

On the Use of Quantum Entanglement in Secure Communications: A Survey

Shannon, Keith, E. Towe, O.K. Tonguz

Quantum computing and quantum communications are exciting new frontiers in computing and communications. Indeed, the massive investments made by the governments of the US, China, and EU in these new technologies are not a secret and are based on the expected potential of these technologies to revolutionize communications, computing, and security. In addition to several field trials and hero experiments, a number of companies such as Google and IBM are actively working in these areas and some have already reported impressive demonstrations in the past few years. While there is some skepticism about whether quantum cryptography will eventually replace classical cryptography, the advent of quantum computing could necessitate the use of quantum cryptography as the ultimate frontier of secure communications. This is because, with the amazing speeds demonstrated with quantum computers, breaking cryptographic keys might no longer be a daunting task in the next decade or so. Hence, quantum cryptography as the ultimate frontier in secure communications might not be such a far-fetched idea. It is well known that Heisenberg's Uncertainty Principle is essentially a "negative result" in Physics and Quantum Mechanics. It turns out that Heisenberg's Uncertainty Principle, one of the most interesting results in Quantum Mechanics, could be the theoretical basis and the main scientific principle behind the ultimate frontier in quantum cryptography or secure communications in conjunction with Quantum Entanglement.

arXiv:2003.07907•Mar 17, 2020•44 citations

Quantum Computing: Anticipated Developments and Applied Prospects

Himani, Yash Sharma, Vaibhav Anand +1 more

International Conference on Advances in Computation, Communication and Information Technology (ICAICCIT)•Oct 31, 2025•0 citations
There has been no lack of coverage in the past few years in scientific journals of the topic of quantum computation. Rightly so, as this is a novel idea with--so far--at least one very important practical application (prime factorisation) as soon as the technology can accommodate reasonably sized computations. Interest in quantum computing has been sparked by both the realization that increasing miniaturisation will eventually bring computer scientists face-to-face with quantum effects, and by the grasping of the potential for massive parallelism inherent in the Hilbert space representation of quantum systems and in the special effects of quantum entanglement.
Daar is geen gebrek aan dekking in die laaste paar jaar in wetenskaplike joernale van die onderwerp van kwantumberekening nie. Tereg ook, want dit is ’n nuwe idee met—tot sover—minstens ´ e´ en baie belangrike praktiese toepassing (ontbinding in priemfaktore) sodra die tegnologie redelik omvattende berekenings kan hanteer. Die belangstelling in kwantumverwerking is aangevuur deur beide die besef dat die toenemende miniaturisering noodwendig rekenaarwetenskaplikes met kwantumverskynsels sal konfronteer, en deur die begryp van die potensiaal van massief parallelle verwerking deur die gebruik maak van die Hilbert-ruimtevoorstelling van kwantumstelsels en die spesiale eienskappe van kwantumverstrengeling. Die onderwerp lˆ e by die sameloop van fisika, rekenaarwetenskap en wiskunde en hierdie bydrae verken die idees van di´ e drie gebiede wat die belangrikste rol in kwantumberekening speel en besin oor die definisies van en die waarskynlike gebruik vir kwantumverwerking asook sy verhouding tot die klassieke berekeningskompleksiteit. Ten slotte word ’n uitgebreide geannoteerde bibliografie verskaf as gids vir die ge¨ ınteresseerde leser tot die literatuur in di´ e onderwerp.AbstractQuantum computing There has been no lack of coverage in the past few years in scientific journals of the topic of quantum computation. Rightly so, as this is a novel idea with—so far—at least one very important practical application (prime factorisation) as soon as the technology can accommodate reasonably sized computations. Interest in quantum computing has been sparked by both the realization that increasing miniaturisation will eventually bring computer scientists face-to-face with quantum effects, and by the grasping of the potential for massive parallelism inherent in the Hilbert space representation of quantum systems and in the special effects of quantum entanglement. The topic lies at the confluence of physics, computer science and mathematics and this contribution reviews the ideas from these three fields that play the most important role in quantum computation and reflects on the definitions of and prospective use for quantum computing as well as its relation to classical computational complexity. Finally, an extended annotated bibliography is provided as a guide for the interested reader to the literature in the subject.
If the bits of computers are someday scaled down to the size of individual atoms, quantum mechanical effects may profoundly change the nature of computation itself. The wave function of such a quantum computer could consist of a superposition of many computations carried out simultaneously; this kind of parallelism could be exploited to make some important computational problems, like the prime factoring of large integers, tractable. However, building such a quantum computer would place undreamed of demands on the experimental realization of highly quantum-coherent systems; present-day experimental capabilities in atomic physics and other fields permit only the most rudimentary implementation of quantum computation.
Abstract Quantum computers are hypothetical machines which can perform many calculations simultaneously based on quantum-mechanical principles that allows a single bit to coexist in many states at once. This enormous potential of quantum computing has attracted substantial interest, especially during the last decade, and initiated a whole new field of research. As a contribution to this research we address the problem of the design of high level languages for programming quantum computers, and the definition of an appropriate formal semantics for such languages. To this purpose we consider the Constraint Programming paradigm and we show how computations in this paradigm can be seen as physical processes obeying the laws of quantum mechanics. 1 Introduction Quantum Computing is currently one of the hottest topics in computer science, physics and engineering. One of the reason for such an interest is the dramatic miniaturisation in computer technology over the past 40 years, which will inevitably force (if the trend continues) the use of quantum physics to describe the elementary operations of a computer. The by now already flourishing research in quantum computing has arisen in anticipation of this inevitable step. If technological issues have started the studies of the new computational model, the discovery of its potential has made the interest continuously increasing, especially after the presentation of Shor's quantum factorisation algorithm [30], and Grover's search algorithm [14]. These algorithms heavily exploits quantum mechanical phenomena. Thanks to quantum effects like superposition and entanglement, a function can be evaluated on a quantum machine so as all the outputs are computed in the time taken to evaluate just one output classically. Although a measurement of the final superposed state can yield only one output, it is still possible to obtain certain joint properties of all the outputs. As a consequence of this quantum parallelism, Shor and Grover's algorithms are faster than any known classical algorithm designed for solving the same problems.
Quantum computing and quantum communications are exciting new frontiers in computing and communications. Indeed, the massive investments made by the governments of the US, China, and EU in these new technologies are not a secret and are based on the expected potential of these technologies to revolutionize communications, computing, and security. In addition to several field trials and hero experiments, a number of companies such as Google and IBM are actively working in these areas and some have already reported impressive demonstrations in the past few years. While there is some skepticism about whether quantum cryptography will eventually replace classical cryptography, the advent of quantum computing could necessitate the use of quantum cryptography as the ultimate frontier of secure communications. This is because, with the amazing speeds demonstrated with quantum computers, breaking cryptographic keys might no longer be a daunting task in the next decade or so. Hence, quantum cryptography as the ultimate frontier in secure communications might not be such a far-fetched idea. It is well known that Heisenberg's Uncertainty Principle is essentially a "negative result" in Physics and Quantum Mechanics. It turns out that Heisenberg's Uncertainty Principle, one of the most interesting results in Quantum Mechanics, could be the theoretical basis and the main scientific principle behind the ultimate frontier in quantum cryptography or secure communications in conjunction with Quantum Entanglement.