Number partitioning on a quantum computer

DOI10.1016/S0375-9601(01)00680-6MaRDI QIDQ5949634zbMATH OpenOpenAlexWikidataFDO

Authors Hans De Raedt, K. Michielsen, K. De Raedt, Seiji Miyashita

Publication date 21 November 2001

Published in Physics Letters. A (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/quant-ph/0010018

zbMATH Keywords

Ising-type quantum computernumber partitioning algorithm

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Quantum computation (81P68)

Abstract: We present an algorithm to compute the number of solutions of the (constrained) number partitioning problem. A concrete implementation of the algorithm on an Ising-type quantum computer is given.

Cites work

• A complete anytime algorithm for number partitioning
• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 1476921 (Why is no real title available?)
• Morphological image analysis
• Phase Transition in the Number Partitioning Problem
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Probabilistic analysis of the number partitioning problem
• Quantum computation

Cited in

(6)

• Heuristics and exact methods for number partitioning
• Loop quantum gravity: a demystified view
• Black Hole State Counting in Loop Quantum Gravity: A Number-Theoretical Approach
• CHSH inequality: quantum probabilities as classical conditional probabilities
• Integer linear programming model for multidimensional two-way number partitioning problem
• Unconditional quantum correlations do not violate Bell's inequality

This page was built for publication: Number partitioning on a quantum computer

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