Access the full text.
Sign up today, get DeepDyve free for 14 days.
E. Dijkstra (1970)
Notes on structured programming, 8
H. Neven, G. Rose, W. Macready (2008)
Image recognition with an adiabatic quantum computer I. Mapping to quadratic unconstrained binary optimizationarXiv: Quantum Physics
S. Jordan, E. Farhi (2008)
Perturbative gadgets at arbitrary ordersPhysical Review A, 77
A. Young, Sergey Knysh, V. Smelyanskiy (2008)
Size dependence of the minimum excitation gap in the quantum adiabatic algorithm.Physical review letters, 101 17
D. Kuhn, R. Kacker, Yu Lei (2010)
Practical Combinatorial Testing
Andrew Childs, E. Farhi, J. Preskill (2001)
Robustness of adiabatic quantum computationPhysical Review A, 65
Daniel Lidar, A. Rezakhani, A. Hamma (2008)
Adiabatic approximation with exponential accuracy for many-body systems and quantum computationarXiv: Quantum Physics
L. Breiman (1998)
Arcing Classifiers
H. Neven, Vasil Denchev, Marshall Drew-Brook, Jiayong Zhang, W. Macready, G. Rose (2009)
NIPS 2009 Demonstration: Binary Classification using Hardware Implementation of Quantum Annealing
A. Rezakhani, W.-J. Kuo, A. Hamma, Daniel Lidar, P. Zanardi (2009)
Quantum adiabatic brachistochrone.Physical review letters, 103 8
S. Teufel (2003)
Adiabatic perturbation theory in quantum dynamics
Yuhai Wu (2021)
Statistical Learning TheoryTechnometrics, 41
V. Chandola, A. Banerjee, Vipin Kumar (2009)
Anomaly detection: A surveyACM Comput. Surv., 41
A. Rezakhani, D. Abasto, Daniel Lidar, P. Zanardi (2010)
Intrinsic geometry of quantum adiabatic evolution and quantum phase transitionsPhysical Review A, 82
D. Cohen, S. Dalal, J. Parelius, G. Patton (1996)
The Combinatorial Design Approach to Automatic Test GenerationIEEE Softw., 13
S. Jordan, E. Farhi, P. Shor (2005)
Error Correcting Codes For Adiabatic Quantum ComputationPhysical Review A, 74
Esma Aïmeur, G. Brassard, S. Gambs (2006)
Machine Learning in a Quantum World
M. Grindal, Jeff Offutt, Sten Andler (2005)
Combination testing strategies: a surveySoftware Testing, 15
A. Rezakhani, A. Pimachev, Daniel Lidar (2010)
Accuracy versus run time in an adiabatic quantum searchPhysical Review A, 82
Lei Yu, Huan Liu (2004)
Efficient Feature Selection via Analysis of Relevance and RedundancyJ. Mach. Learn. Res., 5
DM Cohen, SR Dalal, J Parelius, GC Patton (1996)
The combinatorial design approach to automatic test generationSoftw. IEEE, 13
R. Schapire (1990)
The Strength of Weak LearnabilityMachine Learning, 5
A. Blumer, A. Ehrenfeucht, D. Haussler, Manfred Warmuth (1987)
Occam's RazorInf. Process. Lett., 24
S. Kotsiantis (2007)
Supervised Machine Learning: A Review of Classification Techniques
R. Collis (2019)
Lidar.Applied optics, 9 8
R. Meir, G. Rätsch (2002)
An Introduction to Boosting and Leveraging
V. D'Silva, D. Kroening, Georg Weissenbacher (2008)
A Survey of Automated Techniques for Formal Software VerificationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 27
G. Tassey (2002)
The economic impacts of inadequate infrastructure for software testing
S. Jansen, M. Ruskai, R. Seiler (2006)
Bounds for the adiabatic approximation with applications to quantum computationJournal of Mathematical Physics, 48
J. Roland, N. Cerf (2001)
Quantum search by local adiabatic evolutionPhysical Review A, 65
R. Servedio, S. Gortler (2004)
Equivalences and Separations Between Quantum and Classical LearnabilitySIAM J. Comput., 33
R. Harris, M. Johnson, T. Lanting, A. Berkley, J. Johansson, P. Bunyk, E. Tolkacheva, E. Ladizinsky, N. Ladizinsky, T. Oh, F. Cioată, I. Perminov, P. Spear, C. Enderud, C. Rich, S. Uchaikin, M. Thom, E. Chapple, J. Wang, B. Wilson, M. Amin, N. Dickson, K. Karimi, B. Macready, C. Truncik, G. Rose (2010)
Experimental investigation of an eight-qubit unit cell in a superconducting optimization processorPhysical Review B, 82
EW Dijkstra (1972)
Structured Programming
H. Neven, Vasil Denchev, G. Rose, W. Macready (2008)
Training a Binary Classifier with the Quantum Adiabatic AlgorithmarXiv: Quantum Physics
D. Aharonov, W. Dam, J. Kempe, Zeph Landau, S. Lloyd, O. Regev (2004)
Adiabatic quantum computation is equivalent to standard quantum computation45th Annual IEEE Symposium on Foundations of Computer Science
(2010)
and Y
(2010)
D-Wave Systems
(2010)
and Spiros Mancoridis
Dorian Pyle (1999)
Data Preparation for Data Mining
M. Sarandy, Daniel Lidar (2005)
Adiabatic quantum computation in open systems.Physical review letters, 95 25
D. Kuhn (2011)
COMBINATORIAL TESTING
D. Slepian (1953)
On The Number of Symmetry Types of Boolean Functions of n VariablesCanadian Journal of Mathematics, 5
Tjark Weber, Hasan Amjad (2009)
Efficiently checking propositional refutations in HOL theorem proversJ. Appl. Log., 7
E. Farhi, J. Goldstone, S. Gutmann, M. Sipser (2000)
Quantum Computation by Adiabatic EvolutionarXiv: Quantum Physics
K. Karimi, N. Dickson, F. Hamze, M. Amin, Marshall Drew-Brook, Fabián Chudak, P. Bunyk, W. Macready, G. Rose (2010)
Investigating the performance of an adiabatic quantum optimization processorQuantum Information Processing, 11
E. Stehle, Kevin Lynch, M. Shevertalov, C. Rorres, S. Mancoridis (2010)
On the use of computational geometry to detect software faults at runtime
D Aharonov, W Dam, J Kempe, Z Landau, S Lloyd, O Regev (2007)
Adiabatic quantum computation is equivalent to standard quantum computationSIAM J. Comput., 37
Zhengbing Bian, Fabián Chudak, W. Macready, G. Rose (2010)
The Ising model : teaching an old problem new tricks
Y. Freund, R. Schapire (1999)
A Short Introduction to Boosting
Shie Mannor, R. Meir (2001)
Geometric Bounds for Generalization in Boosting
D. Kuhn, R. Kacker, Yu Lei (2010)
SP 800-142. Practical Combinatorial Testing
E. Farhi, J. Goldstone, S. Gutmann, Joshua Lapan, A. Lundgren, Daniel Preda (2001)
A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete ProblemScience, 292
Hong Cheng, Xifeng Yan, Jiawei Han, Chih-Wei Hsu (2007)
Discriminative Frequent Pattern Analysis for Effective Classification2007 IEEE 23rd International Conference on Data Engineering
V. Choi (2010)
Minor-embedding in adiabatic quantum computation: II. Minor-universal graph designQuantum Information Processing, 10
L. Breiman (1998)
Arcing classifier (with discussion and a rejoinder by the author)Annals of Statistics, 26
Daniel Lidar (2007)
Towards fault tolerant adiabatic quantum computation.Physical review letters, 100 16
Ari Mizel, Daniel Lidar, M. Mitchell (2006)
Simple proof of equivalence between adiabatic quantum computation and the circuit model.Physical review letters, 99 7
H. Neven, Vasil Denchev, G. Rose, W. Macready (2009)
Training a Large Scale Classifier with the Quantum Adiabatic AlgorithmArXiv, abs/0912.0779
R. Bryant (1986)
Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, C-35
J. Biamonte, P. Love (2007)
Realizable Hamiltonians for Universal Adiabatic Quantum ComputersPhysical Review A, 78
V. Choi (2008)
Minor-embedding in adiabatic quantum computation: I. The parameter setting problemQuantum Information Processing, 7
Yves Traon, Benoit Baudry, J. Jézéquel (2006)
Design by Contract to Improve Software VigilanceIEEE Transactions on Software Engineering, 32
We develop an approach to machine learning and anomaly detection via quantum adiabatic evolution. This approach consists of two quantum phases, with some amount of classical preprocessing to set up the quantum problems. In the training phase we identify an optimal set of weak classifiers, to form a single strong classifier. In the testing phase we adiabatically evolve one or more strong classifiers on a superposition of inputs in order to find certain anomalous elements in the classification space. Both the training and testing phases are executed via quantum adiabatic evolution. All quantum processing is strictly limited to two-qubit interactions so as to ensure physical feasibility. We apply and illustrate this approach in detail to the problem of software verification and validation, with a specific example of the learning phase applied to a problem of interest in flight control systems. Beyond this example, the algorithm can be used to attack a broad class of anomaly detection problems.
Quantum Information Processing – Springer Journals
Published: Nov 21, 2012
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.