Least-squares solutions to polynomial systems of equations with quantum annealing
type: Item
instance of: scholarly article
title: Least-squares solutions to polynomial systems of equations with quantum annealing
author: Tyler H. Chang
author: Thomas C. H. Lux
author: Sai Sindhura Tipirneni
published in: Quantum Information Processing
publication date: 2023-01-05T00:00:00Z
Mathematics Subject Classification ID: 81P68
zbMATH DE Number: 7638691
zbMATH Keywords: least squares
zbMATH Keywords: quantum annealing
zbMATH Keywords: polynomial systems of equations
zbMATH Keywords: prime factorization
zbMATH Keywords: root finding
describes a project that uses: HOMPACK90
MaRDI profile type: MaRDI publication profile
full work available at URL: s11128-019-2489-x
OpenAlex ID: W2985516126
cites work: Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
cites work: Analyzing the quantum annealing approach for solving linear least squares problems
cites work: A note on the switching adiabatic theorem
cites work: Q4917542
cites work: Practical integer-to-binary mapping for quantum annealers
cites work: Global optimization with polynomials and the problem of moments
cites work: Performing fully parallel constraint logic programming on a quantum annealer
cites work: Q4058826
cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
cites work: Algorithm 777: HOMPACK90
Wikidata QID: Q126840359
DOI: 10.1007/S11128-019-2489-X
Recommended article: Boolean hierarchical Tucker networks on quantum annealers
Recommended article: Analyzing the quantum annealing approach for solving linear least squares problems
Recommended article: Quantum annealing learning search for solving QUBO problems
Recommended article: Embedding equality constraints of optimization problems into a quantum annealer
Recommended article: Enhancing quantum annealing performance for the molecular similarity problem
description: scientific article; zbMATH DE number 7638691