research-article

Guest Column: Adiabatic Quantum Computing Challenges

Authors:

Cristian S. Calude,

Michael J. DinneenAuthors Info & Claims

ACM SIGACT News, Volume 46, Issue 1

Pages 40 - 61

https://doi.org/10.1145/2744447.2744459

Published: 09 March 2015 Publication History

Abstract

The paper presents a brief introduction to quantum computing with focus on the adiabatic model which is illustrated with the commercial D-Wave computer. We also include new theory and experimental work done on the D-Wave computer. Finally we discuss a hybrid method of combining classical and quantum computing and a few open problems.

References

[1]

A. A. Abbott. De-quantisation of the quantum Fourier transform. Applied Mathematics and Computation, 291(1):3--13, 2012.

Digital Library

[2]

A. A. Abbott and C. S. Calude. Understanding the quantum computational speed-up via de-quantisation. EPTCS, 26:1--12, 2010.

[3]

A. A. Abbott, C. S. Calude and K. Svozil. Value inde_niteness is almost everywhere. Physical Review A, 89(3):032109-032116, 2014.

[4]

D. Aharonov, W. v. Dam, J. Kempe, Z. Landau, S. Lloyd and O. Regev. Adiabatic quantum computation is equivalent to standard quantum computation. arXiv:quant-ph/0405098, March 2005.

Digital Library

[5]

D. Aharonov, Z. Landau and J. Makowsky. The quantum FFT can be classically simulated. arXiv:quant-ph/0611156v2, 2007.

[6]

N. Allen. Personal communication to C. S. Calude, November 7, 2014.

[7]

C. H. Bennett, E. Bernstein, G. Brassard and U. Vazirani. Strengths and weaknesses of quantum computing. SIAM Journal on Computing, 26:1510--1523, 1997.

Digital Library

[8]

S. Boixo, T. F. R_nnow, S. V. Isakov, Z. Wang, D. Wecker, D. A. Lidar, J. M. Martinis and M. Troyer. Quantum annealing with more than one hundred qubits. arXiv:1304.4595v2, July 2013.

[9]

M. Born and V. Fock. Beweis des adiabatensatzes. Zeitschrift für Physik, 51(3-4):165--180, 1928.

[10]

E. Boros and P. L. Hammer. Pseudo-boolean optimization. Discrete Applied Mathematics, 123(1-3):155--225, 2002.

Digital Library

[11]

D. E. Browne. E_cient classical simulation of the quantum Fourier transform. New Journal of Physics, 9(5):146, May 2007.

[12]

C. S. Calude. De-quantizing the solution of Deutsch's problem. International Journal of Quantum Information, 5(3):409--415, 2007.

[13]

C. S. Calude and M. J. Dinneen. Solving the broadcast time problem using a D-Wave quantum computer. Report CDMTCS-473, Centre for Discrete Mathematics and Theoretical Computer Science, University of Auckland, Auckland, New Zealand, November 2014.

[14]

C. S. Calude, M. J. Dinneen and K. Svozil. Reections on quantum computing. Complexity, 6:35--37, 2000.

Digital Library

[15]

C. S. Calude and G. P_aun. Computing with Cells and Atoms. Taylor & Francis Group, London and New York, 2001.

Digital Library

[16]

V. Choi. Minor-embedding in adiabatic quantum computation: I. The parameter setting problem. Quantum Information Processing, 7(5):193--209, 2008.

Digital Library

[17]

R. Cleve, A. Ekert, C. Macchiavello and M. Mosca. Rapid solution of problems by quantum computation. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 454(1969):339--354, 1998.

[18]

E. Cohen and B. Tamir. D-Wave and predecessors: From simulated to quantum annealing. International Journal of Quantum Information, 12(03):1430002, 2014.

[19]

D-Wave. D-Wave overview: A brief introduction to D-Wave and quantum computing, 2013. http://www.dwavesys.com/sites/default/files/D-Wave-brochure-102013F-CA.pdf.

[20]

D-Wave. Programming with QUBOs. Technical report, D-Wave Systems, Inc., 2013. Python Release 1.5.1-beta4 (for Mac/Linux), 09-1002A-B.

[21]

D. Deutsch. Quantum theory, the Church-Turing principle and the universal quantum computer. Proceedings of the Royal Society of London. Series A, Mathematical and Physical Sciences (1934-1990), 400(1818):97--117, 1985.

[22]

M. J. Dinneen. The complexity of broadcasting in bounded-degree networks. Technical Report Combinatorics report LACES-{05C-94-31}, Los Alamos National Laboratory, 1994. http://arxiv.org/abs/math/9411222.

[23]

D. P. Divincenzo. Topics in quantum computers. In G. S. L. Sohn, L. Kouwenhoven, editor, Mesoscopic Electron Transport, pages 657--677, Dordrecht, 1996. Kluwer Academic Publishers.

[24]

D. P. Divincenzo. The physical implementation of quantum computation. Fortsch. Phys., 48:771--783, 2000.

[25]

E. Farhi, J. Goldstone, S. Gutmann and M. Sipser. Quantum computation by adiabatic evolution. arXiv:quant-ph/0001106, January 2000.

[26]

A. Farley, S. Hedetniemi, S. Mitchell and A. Proskurowski. Minimum broadcast graphs. Discrete Mathematics, 25:189--193, 1979.

[27]

R. P. Feynman. Simulating physics with computers. International Journal of Theoretical Physics, 21:467--488, 1982.

[28]

M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY, USA, 1979.

Digital Library

[29]

N. Gershenfeld and I. L. Chuang. Quantum computing with molecules. Scienti_c American, 6:66--71, 1998.

[30]

R. Griffiths and C. Niu. Semiclassical Fourier transform for quantum computation. Physical Review Letters, 76(17):3228--3231, January 1996.

[31]

L. K. Grover. A fast quantum mechanical algorithm for database search. In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pages 212--219. ACM Press, 1996.

Digital Library

[32]

J. Gruska. Quantum Computing. McGraw-Hill, London, 1999.

[33]

P. L. Hammer and S. Rudeanu. Boolean Methods in Operations Research and Related Areas. Springer-Verlag, Berlin, Heidelberg, New York, 1968.

[34]

S. M. Hedetniemi, S. T. Hedetniemi and A. L. Liestman. A survey of gossiping and broadcasting in communication networks. Networks, 18:319--349, 1998.

[35]

M. Khosravani. Searching for Optimal Caterpillars in General and Bounded Treewidth Graphs. PhD dissertation, University of Auckland, Auckland, New Zealand, 2011.

[36]

S. Kirkpatrick, C. D. Gelatt and M. P. Vecchi. Optimization by simulated annealing. SCIENCE, 220(4598):671--680, 1983.

[37]

M. Lanzagorta and J. K. Uhlmann. Hybrid quantum-classical computing with applications to computer graphics. In ACM SIGGRAPH 2005 Courses, SIGGRAPH '05, New York, NY, USA, 2005. ACM.

Digital Library

[38]

A. Lucas. Ising formulations of many NP problems. Frontiers in Physics, 2(5), 2014.

[39]

Y. I. Manin. Vychislimoe i nevychislimoe {Computable and Noncomputable} (in Russian).

[40]

Y. I. Manin. Classical computing, quantum computing, and Shor's factoring algorithm. arXiv:quant-ph/9903008v1, March 1999.

[41]

C. C. McGeoch and C. Wang. Experimental evaluation of an adiabatic quantum system for combinatorial optimization. In Proceedings of the ACM International Conference on Computing Frontiers, CF '13, pages 23:1--23:11, New York, NY, USA, 2013. ACM.

Digital Library

[42]

D. N. Mermin. What's wrong with these elements of reality? Physics Today, 43(6):9--10, June 1990.

[43]

D. N. Mermin. Quantum Computer Science. Cambridge University Press, Cambridge, 2007.

Digital Library

[44]

N. C. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller and E. Teller. Equations of state calculations by fast computing machines. Journal of Chemical Physics, 21(6):1087--1092, 1953.

[45]

L. Mirani and G. Lich_eld. Why nobody can tell whether the worlds biggest quantum computer

[46]

H. Neven. Hardware initiative at quantum arti_cial intelligence lab. URL: https://plus.google.com/+QuantumAILab/posts/UcWGvc9Y6dU {Accessed 28 October 2014}, 2014.

[47]

M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, Cambridge, 2000.

Digital Library

[48]

C. A. Perez-Delgado and P. Kok. What is a quantum computer, and how do we build one? arXiv:0906.4344v2, 2010.

[49]

K. L. Pudenz, T. Albash and D. A. Lidar. Error-corrected quantum annealing with hundreds of qubits. Nat. Commun., 5, 02 2014.

[50]

K. L. Pudenz, T. Albash and D. A. Lidar. Quantum annealing correction for random Ising problems. arXiv:1408.4382v1, August 2014.

[51]

R. Ravi. Rapid rumor rami_cation: Approximating the minimum broadcast time (extended abstract). In Proceedings of the 35th Annual Symposium on Foundations of Computer Science, FOCS'94, pages 202--213. IEEE Computer Society Press, 1994.

Digital Library

[52]

T. Resnick. Sudoku at the Intersection of Classical and Quantum Computing. Report CDMTCS-475, Centre for Discrete Mathematics and Theoretical Computer Science, University of Auckland, Auckland, New Zealand, Dec. 2014.

[53]

T. F. R_nnow, Z. Wang, J. Job, S. Boixo, S. V. Isakov, D. Wecker, J. M. Martinis, D. A. Lidar and M. Troyer. De_ning and detecting quantum speedup. Science, 345(6195):420--424, 2014.

[54]

G. Rose and W. Macready. An introduction to quantum annealing. Technical Report Document 0712, DWave Systems, Inc., 2007.

[55]

S. W. Shin, G. Smith, J. A. Smolin and U. Vazirani. How \quantum" is the D-Wave machine? arXiv:1401.7087, May 2014.

[56]

P. W. Shor. Algorithms for quantum computation: discrete logarithms and factoring. In Proceedings of the 35th Annual Symposium of on Foundations of Computer Science, Santa Fe, NM, Nov. 20-22, 1994. IEEE Computer Society Press, November 1994. arXiv:quant-ph/9508027.

Digital Library

[57]

W. Stein et al. Sage Mathematics Software (Version 6.3). The Sage Development Team, 2014. http://www.sagemath.org.

[58]

G. J. Tee. The Monte Carlo Method. Pergamon Press, Oxford and New York, 1966.

[59]

Webster. Quantum computer (Accessed: 30 October 2014). http://www.webster-dictionary.org/definition/quantum%20computer.

[60]

Wikipedia. Integer programming (Accessed 30 October 2014). http://en.wikipedia.org/wiki/Integer_programming.

[61]

Wikipedia. Quantum computer (Accessed: 30 October 2014). http://en.wikipedia.org/wiki/Quantum_computer.

[62]

W. K. Wooters and W. H. Zurek. A single quantum cannot be cloned. Nature, 299:802--803, 1982.

Cited By

Mertz JNunes I(2023)Software runtime monitoring with adaptive sampling rate to collect representative samples of execution tracesJournal of Systems and Software10.1016/j.jss.2023.111708202:COnline publication date: 1-Aug-2023
https://dl.acm.org/doi/10.1016/j.jss.2023.111708
González-Prieto ÁPerez JDiaz JLópez-Fernández D(2023)Reliability in software engineering qualitative research through Inter-Coder AgreementJournal of Systems and Software10.1016/j.jss.2023.111707202:COnline publication date: 1-Aug-2023
https://dl.acm.org/doi/10.1016/j.jss.2023.111707
Zabardast EGonzalez-Huerta JGorschek TŠmite DAlégroth EFagerholm F(2023)A taxonomy of assets for the development of software-intensive products and servicesJournal of Systems and Software10.1016/j.jss.2023.111701202:COnline publication date: 1-Aug-2023
https://dl.acm.org/doi/10.1016/j.jss.2023.111701
Show More Cited By

Index Terms

Guest Column: Adiabatic Quantum Computing Challenges
1. Applied computing
  1. Physical sciences and engineering
    1. Physics

Recommendations

Guest Column: Quantum Finite Automata: From Theory to Practice

Quantum computing is a prolific research area, halfway between physics and computer science [27, 29, 52]. Most likely, its origins may be dated back to 70's, when some works on quantum information began to appear (see, e.g., [34, 37]). In early 80's, ...
Guest column: the quantum PCP conjecture

The classical PCP theorem is arguably the most important achievement of classical complexity theory in the past quarter century. In recent years, researchers in quantum computational complexity have tried to identify approaches and develop tools that ...
Guest Column: NP-complete problems and physical reality

Can NP-complete problems be solved efficiently in the physical universe? I survey proposals including soap bubbles, protein folding, quantum computing, quantum advice, quantum adiabatic algorithms, quantum-mechanical nonlinearities, hidden variables, ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGACT News

ACM SIGACT News Volume 46, Issue 1

March 2015

69 pages

ISSN:0163-5700

DOI:10.1145/2744447

Editor:
Brendan Mumey
Montana State University

Issue’s Table of Contents

Copyright © 2015 Authors.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 March 2015

Published in SIGACT Volume 46, Issue 1

Check for updates

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

24
Total Citations
View Citations
415
Total Downloads

Downloads (Last 12 months)13
Downloads (Last 6 weeks)2

Reflects downloads up to 13 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Mertz JNunes I(2023)Software runtime monitoring with adaptive sampling rate to collect representative samples of execution tracesJournal of Systems and Software10.1016/j.jss.2023.111708202:COnline publication date: 1-Aug-2023
https://dl.acm.org/doi/10.1016/j.jss.2023.111708
González-Prieto ÁPerez JDiaz JLópez-Fernández D(2023)Reliability in software engineering qualitative research through Inter-Coder AgreementJournal of Systems and Software10.1016/j.jss.2023.111707202:COnline publication date: 1-Aug-2023
https://dl.acm.org/doi/10.1016/j.jss.2023.111707
Zabardast EGonzalez-Huerta JGorschek TŠmite DAlégroth EFagerholm F(2023)A taxonomy of assets for the development of software-intensive products and servicesJournal of Systems and Software10.1016/j.jss.2023.111701202:COnline publication date: 1-Aug-2023
https://dl.acm.org/doi/10.1016/j.jss.2023.111701
Wiese MBorowa K(2023)IT managers’ perspective on Technical Debt ManagementJournal of Systems and Software10.1016/j.jss.2023.111700202:COnline publication date: 1-Aug-2023
https://dl.acm.org/doi/10.1016/j.jss.2023.111700
Minhas NBörstler JPetersen K(2023)Checklists to support decision-making in regression testingJournal of Systems and Software10.1016/j.jss.2023.111697202:COnline publication date: 1-Aug-2023
https://dl.acm.org/doi/10.1016/j.jss.2023.111697
Petrescu CSmith SGiavrimis RDash S(2023)Do names echo semantics? A large-scale study of identifiers used in C++’s named castsJournal of Systems and Software10.1016/j.jss.2023.111693202:COnline publication date: 1-Aug-2023
https://dl.acm.org/doi/10.1016/j.jss.2023.111693
Pérez-Castillo RJiménez-Navajas LPiattini M(2023)Dynamic analysis of quantum annealing programsJournal of Systems and Software10.1016/j.jss.2023.111683201:COnline publication date: 1-Jul-2023
https://dl.acm.org/doi/10.1016/j.jss.2023.111683
Calude CHeidari SSifakis J(2023)What perceptron neural networks are (not) good for?Information Sciences10.1016/j.ins.2022.11.083621(844-857)Online publication date: Apr-2023
https://doi.org/10.1016/j.ins.2022.11.083
Phillipson FNeumann NWezeman R(2023)Classification of Hybrid Quantum-Classical ComputingComputational Science – ICCS 202310.1007/978-3-031-36030-5_2(18-33)Online publication date: 3-Jul-2023
https://dl.acm.org/doi/10.1007/978-3-031-36030-5_2
Dinneen MMahasinghe ALiu K(2022)Finding the chromatic sums of graphs using a D-Wave quantum computerThe Journal of Supercomputing10.1007/s11227-019-02761-575:8(4811-4828)Online publication date: 10-Mar-2022
https://dl.acm.org/doi/10.1007/s11227-019-02761-5
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 Issue’s Table of Contents