Resource-efficient formulations of the Knapsack problem for quantum computing
quant-ph
Submitted: 2026-11-04
Updated: 2026-11-04
Terminology
Sources
- A Quantum Approximate Optimization Algorithm
- Quantum Annealing for Industry Applications: Introduction and Review
- Ising formulations of many NP problems
- Quantum Annealing Implementation of Job-Shop Scheduling
- Portfolio rebalancing experiments using the Quantum Alternating Operator Ansatz
- Unbalanced penalization: A new approach to encode inequality constraints of combinatorial problems for quantum optimization algorithms
- Black-box optimization for integer-variable problems using Ising machines and factorization machines
- Adiabatic Quantum Optimization Fails to Solve the Knapsack Problem
- Constrained Quantum Optimization at Utility Scale: Application to the Knapsack Problem
- Knapsack Problem variants of QAOA for battery revenue optimisation
- Penalty Weights in QUBO Formulations: Permutation Problems
- GPU-accelerated simulations of quantum annealing and the quantum approximate optimization algorithm
- Benchmarking the Quantum Approximate Optimization Algorithm
Related papers
- Computational regimes in matrix-product-state-based quantum trajectory simulations
- Toward chemically accurate quantum simulations on quantum hardware: A quantum-HPC hybrid approach
- Transversal surface-code game with reconfigurable qubits
- Fulqrum: a generalized framework for quantum subspace diagonalization
- Flux-Activated Resonant Control of a Bosonic Quantum Memory
- Machine learning the effects of many quantum measurements