Enhancing quantum annealing performance for the molecular similarity problem
- 9 April 2017
- journal article
- research article
- Published by Springer Nature in Quantum Information Processing
- Vol. 16 (5) , 133
Abstract
No abstract availableKeywords
All Related Versions
This publication has 33 references indexed in Scilit:
- Mapping Constrained Optimization Problems to Quantum Annealing with Application to Fault DiagnosisFrontiers in ICT, 2016
- Computational multiqubit tunnelling in programmable quantum annealersNature Communications, 2016
- Searching for quantum speedup in quasistatic quantum annealersPhysical Review A, 2015
- Fast clique minor generation in Chimera qubit connectivity graphsQuantum Information Processing, 2015
- Evidence for quantum annealing with more than one hundred qubitsNature Physics, 2014
- Graph Theoretic Clique Relaxations and Applications2013
- Clique Relaxations in Social Network Analysis: The Maximum k-Plex ProblemOperations Research, 2011
- The Maximum Common Subgraph Problem: Faster Solutions via Vertex Cover2007
- A Point-Matching Based Algorithm for 3D Surface Alignment of Drug-Sized MoleculesLecture Notes in Computer Science, 2006
- Network Robustness and Fragility: Percolation on Random GraphsPhysical Review Letters, 2000