Enhancing quantum annealing performance for the molecular similarity problem

DOI10.1007/s11128-017-1586-yzbMath1373.81141arXiv1701.04433OpenAlexW2576148114MaRDI QIDQ1679285

Maritza Hernandez, Maliheh Aramon

Publication date: 9 November 2017

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1701.04433

zbMATH Keywords

molecular similarityquantum annealingquantum optimizationminor embeddingparameter settingquadratic unconstrained binary optimization

Mathematics Subject Classification ID

Quantum computation (81P68)

Related Items (1)

Leveraging special-purpose hardware for local search heuristics

Cites Work

• Unnamed Item
• Quadratization of symmetric pseudo-Boolean functions
• Fast clique minor generation in Chimera qubit connectivity graphs
• Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design
• Fixed-parameter tractability and completeness II: On completeness for W[1]
• Minor-embedding in adiabatic quantum computation. I: The parameter setting problem
• Jeffreys' prior is asymptotically least favorable under entropy risk
• A case study in programming a quantum annealer for hard operational planning problems
• Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
• Colloquium: Quantum annealing and analog quantum computation
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Optimization using quantum mechanics: quantum annealing through adiabatic evolution

This page was built for publication: Enhancing quantum annealing performance for the molecular similarity problem