Article

Evolution of a human-competitive quantum fourier transform algorithm using genetic programming

Authors:

Susan StepneyAuthors Info & Claims

GECCO '05: Proceedings of the 7th annual conference on Genetic and evolutionary computation

Pages 1657 - 1663

https://doi.org/10.1145/1068009.1068288

Published: 25 June 2005 Publication History

Abstract

In this paper, we show how genetic programming (GP) can be used to evolve system-size-independent quantum algorithms, and present a human-competitive Quantum Fourier Transform (QFT) algorithm evolved by GP.

References

[1]

H. Barnum, H. J. Bernstein, L. Spector. Quantum circuits for OR and AND of ORs. J. Physics A: Mathematical and General, 33(45):8047--8057, November 2000]]

[2]

H. Barnum, H. J. Bernstein, L, Spector. A quantum circuit for OR. quant-ph/990756]]

[3]

G. Brassard. Teleportation as Quantum Computation. In Proc. 4th Workshop on Physics and Computation, New England Complex Systems Institute 1996. Also as quant-ph/9605035, 1996]]

Digital Library

[4]

D. Deutsch. Quantum Theory, the Church-Turing Thesis, and the Universal Quantum Computer, Proc. Royal Society of London, series A, vol. 400, p97, 1985]]

[5]

N. A. Gershenfeld, I. L. Chuang. Bulk Spin-Resonance Quantum Computing. Science 275, 350--356, January 1997]]

[6]

L. K. Grover. A fast quantum mechanical algorithm for database search. Proc. 28th Ann. ACM Symp. on the Theory of Computing (STOC), 212--219, 1996]]

Digital Library

[7]

A. Leier, W. Banzhaf. Evolving Hogg's Quantum Algorithm Using Linear-Tree GP. GECCO 2003, 390--400. LNCS 2723, Springer, 2003]]

Digital Library

[8]

A. Leier, W. Banzhaf. Exploring the search space of quantum programs. CEC 2003, 170--177. IEEE Press, 2003]]

[9]

A. Leier, W. Banzhaf. Comparison of Selection Strategies for Evolutionary Quantum Circuit Design. GECCO 2004, 557--568. LNCS 3103, Springer, 2004]]

[10]

M. A. Nielsen, I. L. Chuang. Quantum Computation and Quantum Information. CUP, 2000]]

Digital Library

[11]

P. Massey, J. A. Clark, S. Stepney. Evolving Quantum Programs and Circuits through Genetic Programming, GECCO 2004, 569--580. LNCS 3103, Springer, 2004]]

[12]

M. J. Rethinam, A. K. Javali, E.C. Behrman, J.E. Steck, S. R. Skinner. A genetic algorithm for finding pulse sequences for NMR quantum computing. Available as quant-ph/0404170, April 2004]]

[13]

E. Rieffel, W. Polak. An Introduction to Quantum Computing for non-Physicists. Available as quant-ph/9809016, 1998]]

[14]

P. Shor. Algorithms for Quantum Computation : Discrete Logarithms and Factoring, Proc. 35th IEEE Symposium on the Foundations of Computer Science, p124, 1994]]

Digital Library

[15]

P. Shor. Polynomial Time Algorithms for Prime-Factorisation and Discrete Logarithms on a Quantum Computer, SIAM Journal of Computing, 26, p1484, 1997]]

Digital Library

[16]

L. Spector, H. Barnum, H. J. Bernstein, N. Swamy. Genetic Programming for Quantum Computers. In Genetic Programming 1998, 365--374. Morgan Kauffman, 1998]]

[17]

L. Spector, H. Barnum, H. J. Bernstein, N. Swamy. Finding a Better-than-Classical Quantum AND/OR Algorithm using Genetic Programming. CEC 1999, 2239--2246. IEEE, 1999]]

[18]

L. Spector, H. Barnum, H. J Bernstein, N. Swamy. Quantum Computing Applications of Genetic Programming. In L. Spector, W. B. Langdon, U.-M. O'Reilly, P. J. Angeleine, eds, Advances in Genetic Programming 3, chapter 7, pp 135--160. MIT Press, 1999]]

Digital Library

[19]

L. Spector. Automatic Quantum Computer Programming: a genetic programming approach. Kluwer, 2004]]

Digital Library

[20]

L. Spector, H. J. Bernstein. Communication Capacities of some Quantum Gates, discovered in part through Genetic Programming. In Proc. 6th Int. Conf. Quantum Communication, Measurement, and Computing (QCMC), pp. 500--503, 2003]]

[21]

S. Stepney, J. A. Clark. Evolving Quantum Algorithms and Protocols. In M. Rieth, W. Schommers, eds. Handbook of Theoretical and Computational Nanotechnology, American Scientific Publishers, 2005 (in press)]]

[22]

R. Van Meter, K. Binkley. Compiling Quantum programs Using Genetic Algorithms. In The Wild and Crazy Idea Session IV, abstracts, part of 11th Intl. Conf. Architectural Support for Programming Languages and Operating Systems, October 2004]]

[23]

M. Wall. GALib, a C++ Library for Genetic Algorithms, available from http://lancet.mit.edu/ga/]]

[24]

C. P. Williams, A. G. Gray. Automated Design of Quantum Circuits. In Quantum Computing and Communications: First NASA Conference, QCQC'98, 113--125. LNCS 1509, Springer, 1999]]

Digital Library

[25]

T. Yabuki, H. Iba. Genetic algorithms for quantum circuit design - evolving a simpler teleportation circuit. In Late Breaking Papers at GECCO 2000, pp. 425--430, 2000]]

Cited By

Chen YChung KLengál OLin JTsai WYen D(2023)An Automata-Based Framework for Verification and Bug Hunting in Quantum CircuitsProceedings of the ACM on Programming Languages10.1145/35912707:PLDI(1218-1243)Online publication date: 6-Jun-2023
https://dl.acm.org/doi/10.1145/3591270
Jones BWhite DO'Brien GClark JCampbell EAuger AStützle T(2019)Optimising trotter-suzuki decompositions for quantum simulation using evolutionary strategiesProceedings of the Genetic and Evolutionary Computation Conference10.1145/3321707.3321835(1223-1231)Online publication date: 13-Jul-2019
https://dl.acm.org/doi/10.1145/3321707.3321835
Barnes KGale MAuger AStützle T(2019)Meta-genetic programming for static quantum circuitsProceedings of the Genetic and Evolutionary Computation Conference Companion10.1145/3319619.3326907(2016-2019)Online publication date: 13-Jul-2019
https://dl.acm.org/doi/10.1145/3319619.3326907
Show More Cited By

Index Terms

Evolution of a human-competitive quantum fourier transform algorithm using genetic programming
1. Applied computing
  1. Physical sciences and engineering
    1. Physics
2. Software and its engineering
  1. Software creation and management
    1. Software development techniques

Recommendations

Neural network crossover in genetic algorithms using genetic programming
Abstract
The use of genetic algorithms (GAs) to evolve neural network (NN) weights has risen in popularity in recent years, particularly when used together with gradient descent as a mutation operator. However, crossover operators are often omitted from ...
Visualization of the Quantum Fourier Transform Using a Quantum Computer Simulator

The quantum Fourier transform (QFT) is a key subroutine of quantum algorithms for factoring and simulation and is the heart of the hidden-subgroup problem, the solution of which is expected to lead to the development of new quantum algorithms. The QFT ...
Paired quantum Fourier transform with log2N Hadamard gates

The quantum Fourier transform (QFT) is perhaps the furthermost central building block in creation quantum algorithms. In this work, we present a new approach to compute the standard quantum Fourier transform of the length $$ N = 2^{r} , \;r > 1 $$N=2r,r>...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

GECCO '05: Proceedings of the 7th annual conference on Genetic and evolutionary computation

June 2005

2272 pages

ISBN:1595930108

DOI:10.1145/1068009

Editor:
Hans-Georg Beyer
Vorarlberg University of Applied Sciences, Austria
,
General Chair:
Una-May O'Reilly
CSAIL, MIT

Copyright © 2005 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 June 2005

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

GECCO05

Sponsor:

GECCO05: Genetic and Evolutionary Computation Conference

June 25 - 29, 2005

Washington DC, USA

Acceptance Rates

Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

13
Total Citations
View Citations
460
Total Downloads

Downloads (Last 12 months)7
Downloads (Last 6 weeks)0

Reflects downloads up to 05 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Chen YChung KLengál OLin JTsai WYen D(2023)An Automata-Based Framework for Verification and Bug Hunting in Quantum CircuitsProceedings of the ACM on Programming Languages10.1145/35912707:PLDI(1218-1243)Online publication date: 6-Jun-2023
https://dl.acm.org/doi/10.1145/3591270
Jones BWhite DO'Brien GClark JCampbell EAuger AStützle T(2019)Optimising trotter-suzuki decompositions for quantum simulation using evolutionary strategiesProceedings of the Genetic and Evolutionary Computation Conference10.1145/3321707.3321835(1223-1231)Online publication date: 13-Jul-2019
https://dl.acm.org/doi/10.1145/3321707.3321835
Barnes KGale MAuger AStützle T(2019)Meta-genetic programming for static quantum circuitsProceedings of the Genetic and Evolutionary Computation Conference Companion10.1145/3319619.3326907(2016-2019)Online publication date: 13-Jul-2019
https://dl.acm.org/doi/10.1145/3319619.3326907
Haghir Chehreghani MHaghir Chehreghani MAbolhassani H(2012)PROBABILISTIC HEURISTICS FOR HIERARCHICAL WEB DATA CLUSTERINGComputational Intelligence10.1111/j.1467-8640.2012.00414.x28:2(209-233)Online publication date: 1-May-2012
https://dl.acm.org/doi/10.1111/j.1467-8640.2012.00414.x
White SMartinez TRudolph G(2012)Reinforcement ProgrammingComputational Intelligence10.1111/j.1467-8640.2012.00413.x28:2(176-208)Online publication date: 1-May-2012
https://dl.acm.org/doi/10.1111/j.1467-8640.2012.00413.x
Nesmachnow SAlba ECancela H(2012)Scheduling in HC and Grids Using a Parallel CHCComputational Intelligence10.1111/j.1467-8640.2012.00410.x28:2(131-155)Online publication date: 1-May-2012
https://dl.acm.org/doi/10.1111/j.1467-8640.2012.00410.x
Gepp AStocks P(2009)A review of procedures to evolve quantum algorithmsGenetic Programming and Evolvable Machines10.1007/s10710-009-9080-710:2(181-228)Online publication date: 1-Jun-2009
https://dl.acm.org/doi/10.1007/s10710-009-9080-7
Ding SJin ZYang Q(2008)Evolving quantum circuits at the gate level with a hybrid quantum-inspired evolutionary algorithmSoft Computing - A Fusion of Foundations, Methodologies and Applications10.5555/2698248.269840712:11(1059-1072)Online publication date: 1-Sep-2008
https://dl.acm.org/doi/10.5555/2698248.2698407
Ding SJin ZYang Q(2008)Evolving quantum circuits at the gate level with a hybrid quantum-inspired evolutionary algorithmSoft Computing10.1007/s00500-007-0273-912:11(1059-1072)Online publication date: 29-Jan-2008
https://doi.org/10.1007/s00500-007-0273-9
Aggarwal VBerggren KO'reilly U(2007)On the "Evolvable Hardware" Approach to Electronic Design Invention2007 IEEE Workshop on Evolvable and Adaptive Hardware (WEAH2007)10.1109/WEAH.2007.361712(46-54)Online publication date: 2007
https://doi.org/10.1109/WEAH.2007.361712
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents