Cover Image

Quantum tree generator improves QAOA state-of-the-art for the knapsack problem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Christiansen, Paul, Binkowski, Lennart, Ramacciotti, Debora, Wilkening, Sören
Format:	Preprint
Published:	2024
Subjects:	Quantum Physics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

Elementary Proof of QAOA Convergence
by: Binkowski, Lennart, et al.
Published: (2023)

Quantum Fisher-Yates shuffle: Unifying methods for generating uniform superpositions of permutations
by: Binkowski, Lennart, et al.
Published: (2025)

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

Deep-Circuit QAOA
by: Koßmann, Gereon, et al.
Published: (2022)

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

Practical lower bounds for hybrid quantum interior point methods in linear programming
by: Binkowski, Lennart
Published: (2026)

Fast generation of Pauli transfer matrices utilizing tensor product structure
by: Hantzko, Lukas, et al.
Published: (2024)

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

Classification of coined quantum walks on the line and comparison to correlated classical random walks
by: Hantzko, Lukas, et al.
Published: (2025)

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

Tensorized Pauli decomposition algorithm
by: Hantzko, Lukas, et al.
Published: (2023)

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

One for All: Universal Quantum Conic Programming Framework for Hard-Constrained Combinatorial Optimization Problems
by: Binkowski, Lennart, et al.
Published: (2024)

Symmetry-based quantum algorithms for open-shop scheduling with hard constraints
by: Binkowski, Lennart, et al.
Published: (2022)

Snapshot-QAOA: Extending QAOA to Quantum Hamiltonian Simulation
by: Tate, Reuben, et al.
Published: (2024)

Generative-enhanced optimization for knapsack problems: an industry-relevant study
by: Vodovozova, Yelyzaveta, et al.
Published: (2025)

Recursive QAOA outperforms the original QAOA for the MAX-CUT problem on complete graphs
by: Bae, Eunok, et al.
Published: (2022)

Hybrid Classical-Quantum Simulation of MaxCut using QAOA-in-QAOA
by: Esposito, Aniello, et al.
Published: (2024)

From barren plateaus through fertile valleys: Conic extensions of parameterised quantum circuits
by: Binkowski, Lennart, et al.
Published: (2023)

Partitioned-Constraint QAOA (PC-QAOA): Structural State Preparation and Penalty Enforcement for Quantum Optimization
by: Wilkie, Anthony, et al.
Published: (2025)

Quantum speedups in solving near-symmetric optimization problems by low-depth QAOA
by: Montanaro, Ashley, et al.
Published: (2024)

Universal Resources for QAOA and Quantum Annealing
by: Díez-Valle, Pablo, et al.
Published: (2025)

Benchmarking Metaheuristic-Integrated QAOA against Quantum Annealing
by: Mazumder, Arul Rhik, et al.
Published: (2023)

Optimal trace-distance bounds for free-fermionic states: Testing and improved tomography
by: Bittel, Lennart, et al.
Published: (2024)

Extending QAOA-GPT to Higher-Order Quantum Optimization Problems
by: Sunny, Leanto, et al.
Published: (2025)

The QAOA with Few Measurements
by: Polloreno, Anthony M., et al.
Published: (2022)

Exploring the neighborhood of 1-layer QAOA with Instantaneous Quantum Polynomial circuits
by: Leontica, Sebastian, et al.
Published: (2022)

IF-QAOA: A Penalty-Free Approach to Accelerating Constrained Quantum Optimization
by: Bucher, David, et al.
Published: (2025)

Non-Abelian Mixer for QAOA on Hybrid Oscillator-Qubit Quantum Processors
by: Le, Thinh, et al.
Published: (2026)

Approximate Sparse State Preparation with the Grover-Rudolph Algorithm
by: Ramacciotti, Debora, et al.
Published: (2026)

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

Quantum generative classification with mixed states
by: Useche, Diego H., et al.
Published: (2025)

Quantum pricing-based column-generation framework for hard combinatorial problems
by: Coelho, Wesley da Silva, et al.
Published: (2023)

Equivariant QAOA and the Duel of the Mixers
by: Tsvelikhovskiy, Boris, et al.
Published: (2024)

QAOA Parameter Transfer for Hypergraphs
by: Braydwood, Lucas T., et al.
Published: (2026)

Scalable Hardware Maturity Probe for Quantum Accelerators via Harmonic Analysis of QAOA
by: Onah, Chinonso, et al.
Published: (2025)

Two-Qubit Implementation of QAOA for MAX-CUT on an NV-Center Quantum Processor
by: Röscher, Leon E., et al.
Published: (2026)

Evaluating Quantum Wire Cutting for QAOA: Performance Benchmarks in Ideal and Noisy Environments
by: Meulen, Michel, et al.
Published: (2026)