Number partitioning on a quantum computer
From MaRDI portal
Publication:5949634
DOI10.1016/S0375-9601(01)00680-6zbMath0973.81003arXivquant-ph/0010018WikidataQ61757888 ScholiaQ61757888MaRDI QIDQ5949634
No author found.
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
Related Items
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, 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
Cites Work
- Unnamed Item
- Unnamed Item
- A complete anytime algorithm for number partitioning
- Morphological image analysis
- Quantum Computation
- Probabilistic analysis of the number partitioning problem
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Phase Transition in the Number Partitioning Problem