Translator Disclaimer
Presentation + Paper
12 April 2021 Solving linear systems by quadratic unconstrained binary optimization on D-Wave quantum annealing device
Author Affiliations +
Abstract
Many quantum computing algorithms are being developed with the advent of quantum computers. Solving linear systems is one of the most fundamental problems in almost all of science and engineering. HHL algorithm, a monumental quantum algorithm for solving linear systems on the gate model quantum computers, was invented and several advanced variations have been developed. However, HHL-based algorithms have a lot of limitations in spite of their importance. We address solving linear systems on a D-Wave quantum annealing device. To formulate a quadratic unconstrained binary optimization (QUBO) model for a linear system solving problem, we make use of a linear least-square problem with binary representation of the solution. We validate this QUBO model on the D-Wave system and discuss the results.
Conference Presentation
© (2021) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Kyungtaek Jun, Rebecca Conley, Yecheng Huang, Hyunkyung Lim, and Kwangmin Yu "Solving linear systems by quadratic unconstrained binary optimization on D-Wave quantum annealing device", Proc. SPIE 11726, Quantum Information Science, Sensing, and Computation XIII, 117260C (12 April 2021); https://doi.org/10.1117/12.2591588
PROCEEDINGS
7 PAGES + PRESENTATION

SHARE
Advertisement
Advertisement
RELATED CONTENT

Performance of quantum annealing hardware
Proceedings of SPIE (October 22 2015)
Decoherence and loss of entanglement
Proceedings of SPIE (May 25 2005)
Nonclassical logics for quantum computations
Proceedings of SPIE (July 01 1997)
Symmetry and concatenated quantum codes
Proceedings of SPIE (May 25 2005)
Models of short-time qubit decoherence
Proceedings of SPIE (August 24 2004)

Back to Top