FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2129281174> ?p ?o ?g. }

• W2129281174 abstract "Genetic programming can be used to automatically discover algorithms for quantum computers that are more efficient than any classical computer algorithms for the same problems. In this paper we exhibit the first evolved betterthan-classical quantum algorithm, for Deutsch’s “early promise” problem. We also demonstrate a technique for evolving scalable quantum gate arrays and discuss other issues in the application of genetic programming to quantum computation and vice versa. 1. Quantum Computing Quantum computers are computational devices that use atomic-scale objects, for example 2-state particles, to store and manipulate information (Steane, 1997; for an elementary on-line tutorial see Braunstein, 1995; for an introduction for the general reader see Milburn, 1997). The physics of these devices allows them to do things that common digital (henceforth “classical”) computers cannot. Although quantum computers and classical computers appear to be bound by the same limits of Turing computability, physicists argue that quantum computers can solve certain problems using less resources (time and space) than classical computers are thought to require (Jozsa, 1997). For example, Shor’s quantum algorithm finds the prime factors of an n-digit number in time O(n), while the best known classical factoring algorithms require at least time O(2 1 3 2 3 n n / / log( ) ) (Shor, 1994; Beckman et al. 1996). And Grover’s quantum database search algorithm can find an item in an unsorted list of n items in O( n ) steps, while classical algorithms clearly require O(n) (Grover, 1997). The full power of quantum computation is a subject of active investigation. The smallest unit of quantum information is the qubit, which is analogous to the classical bit. Whereas a classical system of n bits is at any time in one of 2 states, a quantum system of n qubits can be in any linear superposition of Genetic Programming for Quantum Computers Lee Spector Howard Barnum Herbert J. Bernstein lspector@hampshire.edu hbarnum@hampshire.edu hbernstein@hampshire.edu School of Cognitive Science School of Natural Science Hampshire College and Institute for Science and Interdisciplinary Studies (ISIS) Amherst, MA 01002 Hampshire College Amherst, MA 01002 these 2 states simultaneously. Although we cannot read the entire state (because measurement interferes with the system), it appears that this quantum parallelism can nonetheless be harnessed to perform real computational work. In physical terms, a qubit can be thought of as a twocomponent wave, where each component represents a classical value, 0 or 1. The height of a component wave gives the probability that the qubit will be found in a particular classical state, and the phase controls how the wave will interfere with other waves. As usual, a wave with height and phase can be represented by a single complex number. Unlike a classical bit, a qubit can be in both states at the same time, and these states may be in phase, out of phase, or somewhere in between, leading to constructive or destructive interference. To date, only very small quantum computers have been built, but the planning and construction of larger devices is in progress. Current experimental quantum computing hardware is based on the use of ion traps, cavity QED, and NMR techniques; many difficult problems must be solved before these techniques can be scaled up, but a discussion of these issues is beyond the scope of this paper (see Preskill, 1997). Quantum computers are different from classical computers in several ways, and it is not obvious how, in general, software can be developed to take advantage of their non-classical power. A variety of basic questions about this power are still open, for example whether or not there exist polynomial time quantum algorithms for classically NP complete problems. In order to assess the wisdom of expending resources on the physical realization of quantum computers, it is important that we develop a more solid understanding of their real computational powers. One way to further this understanding is to develop more quantum algorithms, either by hand or by use of automatic programming techniques (as below). And there are additional reasons, aside from guidance for research and development efforts, for wanting to determine the real powers of quantum computation. For example, Penrose has argued that quantum effects play an important role in human brains (Penrose, 1994), although his claims have been disputed. Because complexity-theoretic arguments play a major role in cognitive science, a rethinking of the computational complexity limits of brain processes could have a significant impact on the study of human cognition. Spector, L., H. Barnum, and H.J. Bernstein. 1998. Genetic Programming for Quantum Computers. In Genetic Programming 1998: Proceedings of the Third Annual Conference, edited by J.R. Koza, W. Banzhaf, K. Chellapilla, K. Deb, M. Dorigo, D.B. Fogel, M.H. Garzon, D.E. Goldberg, H. Iba, and R.L. Riolo. pp. 365-374. San Francisco, CA: Morgan Kaufmann." @default.
• W2129281174 created "2016-06-24" @default.
• W2129281174 creator A5037055623 @default.
• W2129281174 creator A5044142640 @default.
• W2129281174 creator A5089197447 @default.
• W2129281174 date "1998-01-01" @default.
• W2129281174 modified "2023-09-24" @default.
• W2129281174 title "Genetic programming for quantum computers" @default.
• W2129281174 cites W1484620082 @default.
• W2129281174 cites W1497256448 @default.
• W2129281174 cites W1503064567 @default.
• W2129281174 cites W1517016597 @default.
• W2129281174 cites W1537768638 @default.
• W2129281174 cites W1576818901 @default.
• W2129281174 cites W1666312084 @default.
• W2129281174 cites W2002372750 @default.
• W2129281174 cites W2070646413 @default.
• W2129281174 cites W2095618864 @default.
• W2129281174 cites W2101903351 @default.
• W2129281174 cites W2102008187 @default.
• W2129281174 cites W2148132004 @default.
• W2129281174 cites W2164921316 @default.
• W2129281174 cites W2168676717 @default.
• W2129281174 cites W3037315640 @default.
• W2129281174 cites W637375570 @default.
• W2129281174 hasPublicationYear "1998" @default.
• W2129281174 type Work @default.
• W2129281174 sameAs 2129281174 @default.
• W2129281174 citedByCount "16" @default.
• W2129281174 countsByYear W21292811742012 @default.
• W2129281174 countsByYear W21292811742013 @default.
• W2129281174 countsByYear W21292811742017 @default.
• W2129281174 countsByYear W21292811742020 @default.
• W2129281174 crossrefType "book-chapter" @default.
• W2129281174 hasAuthorship W2129281174A5037055623 @default.
• W2129281174 hasAuthorship W2129281174A5044142640 @default.
• W2129281174 hasAuthorship W2129281174A5089197447 @default.
• W2129281174 hasConcept C11413529 @default.
• W2129281174 hasConcept C121332964 @default.
• W2129281174 hasConcept C137019171 @default.
• W2129281174 hasConcept C169699857 @default.
• W2129281174 hasConcept C186468114 @default.
• W2129281174 hasConcept C192061203 @default.
• W2129281174 hasConcept C41008148 @default.
• W2129281174 hasConcept C58053490 @default.
• W2129281174 hasConcept C62520636 @default.
• W2129281174 hasConcept C62641251 @default.
• W2129281174 hasConcept C80444323 @default.
• W2129281174 hasConcept C84114770 @default.
• W2129281174 hasConceptScore W2129281174C11413529 @default.
• W2129281174 hasConceptScore W2129281174C121332964 @default.
• W2129281174 hasConceptScore W2129281174C137019171 @default.
• W2129281174 hasConceptScore W2129281174C169699857 @default.
• W2129281174 hasConceptScore W2129281174C186468114 @default.
• W2129281174 hasConceptScore W2129281174C192061203 @default.
• W2129281174 hasConceptScore W2129281174C41008148 @default.
• W2129281174 hasConceptScore W2129281174C58053490 @default.
• W2129281174 hasConceptScore W2129281174C62520636 @default.
• W2129281174 hasConceptScore W2129281174C62641251 @default.
• W2129281174 hasConceptScore W2129281174C80444323 @default.
• W2129281174 hasConceptScore W2129281174C84114770 @default.
• W2129281174 hasLocation W21292811741 @default.
• W2129281174 hasOpenAccess W2129281174 @default.
• W2129281174 hasPrimaryLocation W21292811741 @default.
• W2129281174 hasRelatedWork W1494274688 @default.
• W2129281174 hasRelatedWork W1497256448 @default.
• W2129281174 hasRelatedWork W1500927487 @default.
• W2129281174 hasRelatedWork W1501685088 @default.
• W2129281174 hasRelatedWork W1517016597 @default.
• W2129281174 hasRelatedWork W1528771887 @default.
• W2129281174 hasRelatedWork W1568906816 @default.
• W2129281174 hasRelatedWork W1569757501 @default.
• W2129281174 hasRelatedWork W1576818901 @default.
• W2129281174 hasRelatedWork W1631356911 @default.
• W2129281174 hasRelatedWork W1659842140 @default.
• W2129281174 hasRelatedWork W196688135 @default.
• W2129281174 hasRelatedWork W2055289715 @default.
• W2129281174 hasRelatedWork W2084652510 @default.
• W2129281174 hasRelatedWork W2100604298 @default.
• W2129281174 hasRelatedWork W2140054145 @default.
• W2129281174 hasRelatedWork W2155802383 @default.
• W2129281174 hasRelatedWork W2166963892 @default.
• W2129281174 hasRelatedWork W26371566 @default.
• W2129281174 hasRelatedWork W81542269 @default.
• W2129281174 isParatext "false" @default.
• W2129281174 isRetracted "false" @default.
• W2129281174 magId "2129281174" @default.
• W2129281174 workType "book-chapter" @default.