Constraint-oriented biased quantum search for linear constrained combinatorial optimization problems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Wilkening, Sören, Ziegler, Timo, Hess, Maximilian
Format:	Preprint
Published:	2025
Subjects:	Quantum Physics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Constraint-oriented biased quantum search for general constrained combinatorial optimization problems
by: Wilkening, Sören
Published: (2025)

Speed-oriented quantum circuit backend
by: Wilkening, Sören
Published: (2026)

A quantum search method for quadratic and multidimensional knapsack problems
by: Wilkening, Sören, et al.
Published: (2025)

Post-processing variationally scheduled quantum algorithm for constrained combinatorial optimization problems
by: Shirai, Tatsuhiko, et al.
Published: (2023)

Convergence guarantee for linearly-constrained combinatorial optimization with a quantum alternating operator ansatz
by: Goldstein-Gelb, Brayden, et al.
Published: (2024)

Compressed space quantum approximate optimization algorithm for constrained combinatorial optimization
by: Shirai, Tatsuhiko, et al.
Published: (2024)

Qubit-efficient quantum local search for combinatorial optimization
by: Podobrii, M., et al.
Published: (2025)

Quantum tree generator improves QAOA state-of-the-art for the knapsack problem
by: Christiansen, Paul, et al.
Published: (2024)

Sequential Hamiltonian Assembly: Enhancing the training of combinatorial optimization problems on quantum computers
by: Roshani, Navid, et al.
Published: (2024)

An introduction to variational quantum algorithms for combinatorial optimization problems
by: Grange, Camille, et al.
Published: (2022)

Orkan: Cache-friendly simulation of quantum operations on hermitian operators
by: Ziegler, Timo
Published: (2026)

A quantum algorithm for solving 0-1 Knapsack problems
by: Wilkening, Sören, et al.
Published: (2023)

Hierarchical divide and conquer quantum approach to combinatorial optimization problems with tunable reduction
by: Schmid, Mathias, et al.
Published: (2025)

Quick design of feasible tensor networks for constrained combinatorial optimization
by: Nakada, Hyakka, et al.
Published: (2024)

Solving non-native combinatorial optimization problems using hybrid quantum-classical algorithms
by: Wurtz, Jonathan, et al.
Published: (2024)

Runtime-coherence trade-offs for hybrid SAT-solvers
by: Eshaghian, Vahideh, et al.
Published: (2024)

Qubit-efficient quantum combinatorial optimization solver
by: Sundar, Bhuvanesh, et al.
Published: (2024)

Multiobjective variational quantum optimization for constrained problems: an application to Cash Management
by: Díez-Valle, Pablo, et al.
Published: (2023)

Imaginary Hamiltonian variational ansatz for combinatorial optimization problems
by: Wang, Xiaoyang, et al.
Published: (2024)

Performant near-term quantum combinatorial optimization
by: Morris, Titus D., et al.
Published: (2024)

Sub-universal variational circuits for combinatorial optimization problems
by: Weitz, Gal, et al.
Published: (2023)

Extending relax-and-round combinatorial optimization solvers with quantum correlations
by: Dupont, Maxime, et al.
Published: (2023)

Integrated error-suppressed pipeline for quantum optimization of nontrivial binary combinatorial optimization problems on gate-model hardware at the 156-qubit scale
by: Sachdeva, Natasha, et al.
Published: (2024)

Rapid quantum approaches for combinatorial optimisation inspired by optimal state-transfer
by: Banks, Robert J., et al.
Published: (2023)

Unbalanced penalization: A new approach to encode inequality constraints of combinatorial problems for quantum optimization algorithms
by: Montanez-Barrera, Alejandro, et al.
Published: (2022)

A quantum wire approach to weighted combinatorial graph optimisation problems
by: de Oliveira, André G., et al.
Published: (2025)

Hybrid quantum-classical approach for combinatorial problems at hadron colliders
by: Scott, Jacob L., et al.
Published: (2024)

DAPO-QAOA: An algorithm for solving combinatorial optimization problems by dynamically constructing phase operators
by: Wang, Yukun, et al.
Published: (2025)

Exhaustive and feasible parametrisation with applications to the travelling salesperson problem
by: Schwiering, Marvin, et al.
Published: (2026)

Schrödingerization for quantum linear systems problems with near-optimal dependence on matrix queries
by: Yang, Yin, et al.
Published: (2025)

Quantum circuit synthesis via a random combinatorial search
by: Ashhab, Sahel, et al.
Published: (2023)

Edge-of-chaos enhanced quantum-inspired algorithm for combinatorial optimization
by: Goto, Hayato, et al.
Published: (2025)

Sampled-Based Guided Quantum Walk: Non-variational quantum algorithm for combinatorial optimization
by: Nzongani, Ugo, et al.
Published: (2025)

Direct phase encoding in QAOA: Describing combinatorial optimization problems through binary decision variables
by: Garhofer, Simon, et al.
Published: (2024)

Constraint Preserving XY-Mixers under Trotterized Adiabatic Evolution
by: Awasthi, Abhishek, et al.
Published: (2026)

Measurement-free quantum error correction optimized for biased noise
by: Brechtelsbauer, Katharina, et al.
Published: (2025)

Variational (matrix) product states for combinatorial optimization
by: Preisser, Guillermo, et al.
Published: (2025)

An in-principle super-polynomial quantum advantage for approximating combinatorial optimization problems via computational learning theory
by: Pirnay, Niklas, et al.
Published: (2022)

Variational quantum eigensolver with linear depth problem-inspired ansatz for solving portfolio optimization in finance
by: Wang, Shengbin, et al.
Published: (2024)

Continuous optimization by quantum adaptive distribution search
by: Morimoto, Kohei, et al.
Published: (2023)