Theory versus practice in annealing-based quantum computing

DOI10.1016/J.TCS.2020.01.024MaRDI QIDQ2306020zbMATH OpenOpenAlexWikidataFDO

Authors Catherine C. McGeoch

Publication date 20 March 2020

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2020.01.024

zbMATH Keywords

adiabatic quantum computingmodels of computationquantum annealingquantum computing

Mathematics Subject Classification ID

Quantum computation (81P68)

Recommendations

• Quantum computation: from the sequential approach to simulated annealing
• Optimization using quantum mechanics: quantum annealing through adiabatic evolution
• Quantum annealing of hard problems
• An introduction to quantum annealing
• Colloquium: Quantum annealing and analog quantum computation

Cites work

• A modified quantum adiabatic evolution for the Deutsch-Jozsa problem
• A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
• Fast clique minor generation in Chimera qubit connectivity graphs
• scientific article; zbMATH DE number 5595162 (Why is no real title available?)
• scientific article; zbMATH DE number 846277 (Why is no real title available?)
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Introduction to algorithms.
• Models of quantum computation and quantum programming languages
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Realizable Hamiltonians for universal adiabatic quantum computers
• Theory and applications of satisfiability testing -- SAT 2018. 21st international conference, SAT 2018, held as part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9--12, 2018. Proceedings
• What makes an optimization problem hard?.

Cited in

(10)

• Mapping a logical representation of TSP to quantum annealing
• Unconstrained binary models of the travelling salesman problem variants for quantum optimization
• Tunneling time from spin fluctuations in Larmor clock
• Analog quantum computing (AQC) and the need for time-symmetric physics
• Efficiency of quantum vs. classical annealing in nonconvex learning problems
• How fast can quantum annealers count?
• A quantum annealing-sequential quadratic programming assisted finite element simulation for non-linear and history-dependent mechanical problems
• Analysis of \(D\)-Wave topologies with classical graph metrics
• Last fifty years of integer linear programming: a focus on recent practical advances
• Hybrid quantum annealing for price optimization under cross-elastic demand

Describes a project that uses

Uses Software

• mctoolbox

This page was built for publication: Theory versus practice in annealing-based quantum computing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2306020)