 |
|
European computer scientists seek new framework for computation
October 30, 2008There have been several revolutions during the 60 year history of electronic computation, such as high level programming languages and client/server separation, but one key challenge has yet to be fully resolved. This is to break down large complex processes into small more manageable components that can then be reused in different applications. There are many possible ways of doing this, but none of them cope well with all processes, with the major problem lying in the dependant links, or correlations, between components that cannot be broken down, the threads that interconnect whole computer processes or programs. These correlations are common to all processes in which computation is involved, including biological systems and the emerging field of quantum computing, as well as conventional programming.
European computer scientists believe the time is right now for a coordinated effort to solve the correlation problem and a group of them recently held a workshop organised by the European Science Foundation (ESF) to establish a framework for further research. The workshop was an astounding success, firstly in identifying that correlations in computer science represented an important problem common to the whole field of programming and software development now highly relevant to all industries and everybody's lives. It was, as was noted by the workshop's convenor Ellie D'Hondt, a specialist in quantum computing research at Vrije Universiteit in Brussels, an important forum for accumulating the required expertise to take the field forward.
"We are now at a stage were all participants understand why we need a correlation paradigm, that there is a commonality between the fields included, and we converged on a definition and basic principles," said D'Hondt." People are now ready to do research on the problem, and this is what we should get together on in another year or so."
Now is a good time to tackle the correlation problem. The evolution of general purpose computing has reached a point where the correlation problem can stand in the way of progress. The explosion of the Internet has been associated with rapid growth in software components designed to be reused to avoid the cost of duplicated programming effort.
The workshop discussed progress in the relatively new field of aspect-oriented software development (AOSD), which is bringing new techniques for isolating the correlations cutting across software components. The techniques of AOSD make it possible to modularise those aspects of a system or process that cut across different components. In this way the cross cutting aspects themselves can be broken down into reusable components or objects. This in turn enables a whole process to be broken down more completely into components that also embrace the cross cutting aspects.
Research into correlation is also timely because expertise is emerging independently in three different fields, quantum computing, bio computing, and AOSD, the latter being most applicable to general purpose computing. As D'Hondt noted, cooperation between specialists in these fields is needed to avoid duplication of effort, but more particularly because it will stimulate and drive forward the whole study of correlations. On this front the ESF workshop was highly successful, because it bought together representatives from each of the three fields in small groups. "It was amazing to have these groups of people actually communicate," said D'Hondt. "We split up into small groups where there would be one aspect, one quantum and one bio person, people not usually knowing each other beforehand, and this worked! People came up with small presentations after only one day of talks getting introduced to the whole body of work."
A common thread emerged from these mini-workshops, which was the fact that correlations appear when progressing from the high level global description of a problem to the lower level local components.
"Correlations capture the interaction between the parts," said D'Hondt. In other words the devil is in the detail. This is as true in biological systems as say a web based search engine. In the human brain for example it is possible to define how long term memories are formed, but this does not tell us how an individual neuron might be phase locked with another at a local level, so that the two depend on each other. Similarly in computation, a high level view does not describe the particular order in which lower level components need to be executed on the basis of the correlations or links between them. For example two sub-programs might share a common variable, which decides when they have to be executed within a larger task or application.
The ESF workshop also established a common theme, which was that correlations can be a good thing, rather than a hindrance to computation, as has been shown in quantum computing. "Correlations are often seen as a burden, a nuisance, something making the problem hard to solve," said D'Hondt. "But my experience in quantum computing tells me it is something that can also steer computations or even make them possible."
Quantum computing involves entangled states that can actually be exploited to perform specific tasks more quickly - in effect just one computation can sometimes execute a large number of entangled components, each of which would require separate processing in a traditional computer.
The ultimate objective set out in the ESF workshop was to produce a recipe for programming taking full account of correlations, but this is still a long way off. Yet as D'Hondt noted, the basic framework for a new programming paradigm based on correlations in computer science was established.
European Science Foundation
Now is a good time to tackle the correlation problem. The evolution of general purpose computing has reached a point where the correlation problem can stand in the way of progress. The explosion of the Internet has been associated with rapid growth in software components designed to be reused to avoid the cost of duplicated programming effort.
The workshop discussed progress in the relatively new field of aspect-oriented software development (AOSD), which is bringing new techniques for isolating the correlations cutting across software components. The techniques of AOSD make it possible to modularise those aspects of a system or process that cut across different components. In this way the cross cutting aspects themselves can be broken down into reusable components or objects. This in turn enables a whole process to be broken down more completely into components that also embrace the cross cutting aspects.
Research into correlation is also timely because expertise is emerging independently in three different fields, quantum computing, bio computing, and AOSD, the latter being most applicable to general purpose computing. As D'Hondt noted, cooperation between specialists in these fields is needed to avoid duplication of effort, but more particularly because it will stimulate and drive forward the whole study of correlations. On this front the ESF workshop was highly successful, because it bought together representatives from each of the three fields in small groups. "It was amazing to have these groups of people actually communicate," said D'Hondt. "We split up into small groups where there would be one aspect, one quantum and one bio person, people not usually knowing each other beforehand, and this worked! People came up with small presentations after only one day of talks getting introduced to the whole body of work."
A common thread emerged from these mini-workshops, which was the fact that correlations appear when progressing from the high level global description of a problem to the lower level local components.
"Correlations capture the interaction between the parts," said D'Hondt. In other words the devil is in the detail. This is as true in biological systems as say a web based search engine. In the human brain for example it is possible to define how long term memories are formed, but this does not tell us how an individual neuron might be phase locked with another at a local level, so that the two depend on each other. Similarly in computation, a high level view does not describe the particular order in which lower level components need to be executed on the basis of the correlations or links between them. For example two sub-programs might share a common variable, which decides when they have to be executed within a larger task or application.
The ESF workshop also established a common theme, which was that correlations can be a good thing, rather than a hindrance to computation, as has been shown in quantum computing. "Correlations are often seen as a burden, a nuisance, something making the problem hard to solve," said D'Hondt. "But my experience in quantum computing tells me it is something that can also steer computations or even make them possible."
Quantum computing involves entangled states that can actually be exploited to perform specific tasks more quickly - in effect just one computation can sometimes execute a large number of entangled components, each of which would require separate processing in a traditional computer.
The ultimate objective set out in the ESF workshop was to produce a recipe for programming taking full account of correlations, but this is still a long way off. Yet as D'Hondt noted, the basic framework for a new programming paradigm based on correlations in computer science was established.
European Science Foundation
Quantum Computing Current Events and Quantum Computing News RSSUCSB physicists move 1 step closer to quantum computing
Physicists at UC Santa Barbara have made an important advance in electrically controlling quantum states of electrons, a step that could help in the development of quantum computing.
Rice ties in race for atomic-scale breakthrough
Everybody loves a race to the wire, even when the result is a tie. The great irony is the ultraprecise clocks that could result from this competition could probably break any tie.
NIST demonstrates 'universal' programmable quantum processor
Physicists at the National Institute of Standards and Technology (NIST) have demonstrated the first "universal" programmable quantum information processor able to run any program allowed by quantum mechanics-the rules governing the submicroscopic world-using two quantum bits (qubits) of information.
UA scientists discover quantum fingerprints of chaos
Chaotic behavior is the rule, not the exception, in the world we experience through our senses, the world governed by the laws of classical physics.
Diamonds may be the ultimate MRI probe, say Quantum physicists
Diamonds, it has long been said, are a girl's best friend. But a research team including a physicist from the National Institute of Standards and Technology (NIST) has recently found that the gems might turn out to be a patient's best friend as well.
A Police Woman Fights Quantum Hacking and Cracking
The first desktop computers changed the way we managed data forever. Three decades after their introduction, we rely on them to manage our time, social life and finances - and to keep this information safe from prying eyes and online predators.
Physicists find way to control individual bits in quantum computers
Physicists at the National Institute of Standards and Technology (NIST) have overcome a hurdle in quantum computer development, having devised* a viable way to manipulate a single "bit" in a quantum processor without disturbing the information stored in its neighbors.
NIST develops novel ion trap for sensing force and light
Miniature devices for trapping ions (electrically charged atoms) are common components in atomic clocks and quantum computing research. Now, a novel ion trap geometry demonstrated at the National Institute of Standards and Technology (NIST) could usher in a new generation of applications because the device holds promise as a stylus for sensing very small forces or as an interface for efficient transfer of individual light particles for quantum communications.
Scientists create first working model of a 2-qubit electronic quantum processor
A team led by Yale University researchers has successfully implemented simple algorithms using a quantum processor based on microwave solid-state technology--similar to that found in computers and cell phones.
Scientists create first electronic quantum processor
A team led by Yale University researchers has created the first rudimentary solid-state quantum processor, taking another step toward the ultimate dream of building a quantum computer.
More Quantum Computing Current Events and Quantum Computing News Articles
 |
An Introduction to Quantum Computing by Phillip Kaye (Author), Raymond Laflamme (Author), Michele Mosca (Author) This concise, accessible text provides a thorough introduction to quantum computing - an exciting emergent field at the interface of the computer, engineering, mathematical and physical sciences. Aimed at advanced undergraduate and beginning graduate students in these disciplines, the text is technically detailed and is clearly illustrated throughout with diagrams and exercises. Some prior knowledge of linear algebra is assumed, including vector spaces and inner products. However, prior familiarity with topics such as tensor products and spectral decomposition is not required, as the necessary material is reviewed in the text. |
 |
Quantum Computing for Computer Scientists by Noson S. Yanofsky (Author), Mirco A. Mannucci (Author) The multidisciplinary field of quantum computing strives to exploit some of the uncanny aspects of quantum mechanics to expand our computational horizons. Quantum Computing for Computer Scientists takes readers on a tour of this fascinating area of cutting-edge research. Written in an accessible yet rigorous fashion, this book employs ideas and techniques familiar to every student of computer science. The reader is not expected to have any advanced mathematics or physics background. After presenting the necessary prerequisites, the material is organized to look at different aspects of quantum computing from the specific standpoint of computer science. There are chapters on computer architecture, algorithms, programming languages, theoretical computer science, cryptography, information... |
 |
Quantum Computing: From Linear Algebra to Physical Realizations by Mikio Nakahara (Author), Tetsuo Ohmi (Author) Covering both theory and progressive experiments, Quantum Computing: From Linear Algebra to Physical Realizations explains how and why superposition and entanglement provide the enormous computational power in quantum computing. This self-contained, classroom-tested book is divided into two sections, with the first devoted to the theoretical aspects of quantum computing and the second focused on several candidates of a working quantum computer, evaluating them according to the DiVincenzo criteria. Topics in Part I · Linear algebra · Principles of quantum mechanics · Qubit and the first application of quantum information processing—quantum key distribution · Quantum gates · Simple yet elucidating examples of quantum... |
 |
Quantum Computation and Quantum Information by Michael A. Nielsen (Author), Isaac L. Chuang (Author) In this first comprehensive introduction to the main ideas and techniques of quantum computation and information, Michael Nielsen and Isaac Chuang ask the question: What are the ultimate physical limits to computation and communication? They detail such remarkable effects as fast quantum algorithms, quantum teleportation, quantum cryptography and quantum error correction. A wealth of accompanying figures and exercises illustrate and develop the material in more depth. They describe what a quantum computer is, how it can be used to solve problems faster than familiar "classical" computers, and the real-world implementation of quantum computers. Their book concludes with an explanation of how quantum states can be used to perform remarkable feats of communication, and of how it is possible... |
 |
Quantum Computing without Magic: Devices (Scientific and Engineering Computation) by Zdzislaw Meglicki (Author) This text offers an introduction to quantum computing, with a special emphasis on basic quantum physics, experiment, and quantum devices. Unlike many other texts, which tend to emphasize algorithms, Quantum Computing without Magic explains the requisite quantum physics in some depth, and then explains the devices themselves. It is a book for readers who, having already encountered quantum algorithms, may ask, "Yes, I can see how the algebra does the trick, but how can we actually do it?" By explaining the details in the context of the topics covered, this book strips the subject of the "magic" with which it is so often cloaked. Quantum Computing without Magic covers the essential probability calculus; the qubit, its physics, manipulation and measurement, and how it can be... |
 |
Quantum Computer Science: An Introduction by N. David Mermin (Author) In the 1990's it was realized that quantum physics has some spectacular applications in computer science. This book is a concise introduction to quantum computation, developing the basic elements of this new branch of computational theory without assuming any background in physics. It begins with an introduction to the quantum theory from a computer-science perspective. It illustrates the quantum-computational approach with several elementary examples of quantum speed-up, before moving to the major applications: Shor's factoring algorithm, Grover's search algorithm, and quantum error correction. The book is intended primarily for computer scientists who know nothing about quantum theory, but will also be of interest to physicists who want to learn the theory of quantum computation, and... |
 |
Quantum Computing Explained by David McMahon (Author) A self-contained treatment of the fundamentals of quantum computing This clear, practical book takes quantum computing out of the realm of theoretical physics and teaches the fundamentals of the field to students and professionals who have not had training in quantum computing or quantum information theory, including computer scientists, programmers, electrical engineers, mathematicians, physics students, and chemists. The author cuts through the conventions of typical jargon-laden physics books and instead presents the material through his unique "how-to" approach and friendly, conversational style. Readers will learn how to carry out calculations with explicit details and will gain a fundamental grasp of: * Quantum mechanics ... |
 |
Quantum Computing (Natural Computing Series) by Mika Hirvensalo (Author) This book is devoted to quantum computing, a new, multidisciplinary research area crossing quantum mechanics, theoretical computer science and mathematics. It contains an introduction to quantum computing as well as the most important recent results on the topic. Two famous algorithms, fast factorization and Grover search, are presented in separate chapters because these inventions are important structurally and developmentally. The presentation of the topic is uniform and computer science-oriented. Thus, the book differs from most of the previous ones which are mainly physics-oriented. The special style of presentation makes the theory of quantum computing accessible to a larger audience, including also the mathematics-oriented oriented readers. Many examples and... |
 |
Problems And Solutions in Quantum Computing And Quantum Information by Yorick Hardy Willi-Hans Steeb (Author) Quantum computing and quantum information are two of the fastest growing and most exciting research fields in physics. The possibilities of using the non-local behavior of quantum mechanics to factor integers in random polynomial time have also added to this new interest. This book supplies a collection of problems in quantum computing and quantum information together with their detailed solutions, which will prove to be invaluable to students as well as to research workers in these fields. All the important concepts and topics such as quantum gates and quantum circuits, entanglement, teleportation, Bell states, Bell inequality, Schmidt decomposition, quantum Fourier transform, magic gate, von Neumann entropy, quantum cryptography, quantum error correction, coherent states, squeezed... |
 |
Classical and Quantum Computation (Graduate Studies in Mathematics) by A. Yu. Kitaev (Author), A. H. Shen (Author), M. N. Vyalyi (Author) This book is an introduction to a new rapidly developing theory of quantum computing. It begins with the basics of classical theory of computation: Turing machines, Boolean circuits, parallel algorithms, probabilistic computation, NP-complete problems, and the idea of complexity of an algorithm. The second part of the book provides an exposition of quantum computation theory. It starts with the introduction of general quantum formalism (pure states, density matrices, and superoperators), universal gate sets and approximation theorems. Then the authors study various quantum computation algorithms: Grover's algorithm, Shor's factoring algorithm, and the Abelian hidden subgroup problem. In concluding sections, several related topics are discussed (parallel quantum computation, a quantum... |
| © 2009 BrightSurf.com |