Image de couverture de livre

Hierarchical divide and conquer quantum approach to combinatorial optimization problems with tunable reduction

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Schmid, Mathias, Mohseni, Naeimeh, Hartmann, Michael J.
Format:	Preprint
Publié:	2025
Sujets:	Quantum Physics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Deep learning of many-body observables and quantum information scrambling
par: Mohseni, Naeimeh, et autres
Publié: (2023)

On the quantum time complexity of divide and conquer
par: Allcock, Jonathan, et autres
Publié: (2023)

Quantum divide and conquer
par: Childs, Andrew M., et autres
Publié: (2022)

Transfer learning in predicting quantum many-body dynamics: from physical observables to entanglement entropy
par: Schmidt, Philipp, et autres
Publié: (2024)

An introduction to variational quantum algorithms for combinatorial optimization problems
par: Grange, Camille, et autres
Publié: (2022)

Rapid quantum approaches for combinatorial optimisation inspired by optimal state-transfer
par: Banks, Robert J., et autres
Publié: (2023)

A quantum wire approach to weighted combinatorial graph optimisation problems
par: de Oliveira, André G., et autres
Publié: (2025)

Sequential Hamiltonian Assembly: Enhancing the training of combinatorial optimization problems on quantum computers
par: Roshani, Navid, et autres
Publié: (2024)

Hybrid quantum-classical approach for combinatorial problems at hadron colliders
par: Scott, Jacob L., et autres
Publié: (2024)

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

Constraint-oriented biased quantum search for linear constrained combinatorial optimization problems
par: Wilkening, Sören, et autres
Publié: (2025)

Post-processing variationally scheduled quantum algorithm for constrained combinatorial optimization problems
par: Shirai, Tatsuhiko, et autres
Publié: (2023)

Unbalanced penalization: A new approach to encode inequality constraints of combinatorial problems for quantum optimization algorithms
par: Montanez-Barrera, Alejandro, et autres
Publié: (2022)

Solving non-native combinatorial optimization problems using hybrid quantum-classical algorithms
par: Wurtz, Jonathan, et autres
Publié: (2024)

Integrated error-suppressed pipeline for quantum optimization of nontrivial binary combinatorial optimization problems on gate-model hardware at the 156-qubit scale
par: Sachdeva, Natasha, et autres
Publié: (2024)

Qubit-efficient quantum combinatorial optimization solver
par: Sundar, Bhuvanesh, et autres
Publié: (2024)

Imaginary Hamiltonian variational ansatz for combinatorial optimization problems
par: Wang, Xiaoyang, et autres
Publié: (2024)

Compressed space quantum approximate optimization algorithm for constrained combinatorial optimization
par: Shirai, Tatsuhiko, et autres
Publié: (2024)

Qubit-efficient quantum local search for combinatorial optimization
par: Podobrii, M., et autres
Publié: (2025)

Performant near-term quantum combinatorial optimization
par: Morris, Titus D., et autres
Publié: (2024)

Sub-universal variational circuits for combinatorial optimization problems
par: Weitz, Gal, et autres
Publié: (2023)

Extending relax-and-round combinatorial optimization solvers with quantum correlations
par: Dupont, Maxime, et autres
Publié: (2023)

Designing fast quantum gates using optimal control with a reinforcement-learning ansatz
par: Sarma, Bijita, et autres
Publié: (2023)

Variational (matrix) product states for combinatorial optimization
par: Preisser, Guillermo, et autres
Publié: (2025)

Demonstrating Quantum Scaling Advantage in Approximate Optimization for Energy Coalition Formation with 100+ Agents
par: Mohseni, Naeimeh, et autres
Publié: (2024)

Highly Efficient Encoding for Job-Shop Scheduling Problems and its Application on Quantum Computers
par: Schmid, Mathias, et autres
Publié: (2024)

DAPO-QAOA: An algorithm for solving combinatorial optimization problems by dynamically constructing phase operators
par: Wang, Yukun, et autres
Publié: (2025)

Transfer learning of optimal QAOA parameters in combinatorial optimization
par: Montanez-Barrera, J. A., et autres
Publié: (2024)

Edge-of-chaos enhanced quantum-inspired algorithm for combinatorial optimization
par: Goto, Hayato, et autres
Publié: (2025)

Constrained Quantum Optimization at Utility Scale: Application to the Knapsack Problem
par: Mohseni, Naeimeh, et autres
Publié: (2026)

Sampled-Based Guided Quantum Walk: Non-variational quantum algorithm for combinatorial optimization
par: Nzongani, Ugo, et autres
Publié: (2025)

Convergence guarantee for linearly-constrained combinatorial optimization with a quantum alternating operator ansatz
par: Goldstein-Gelb, Brayden, et autres
Publié: (2024)

Mitigating exponential concentration in covariant quantum kernels for subspace and real-world data
par: Agliardi, Gabriele, et autres
Publié: (2024)

Direct phase encoding in QAOA: Describing combinatorial optimization problems through binary decision variables
par: Garhofer, Simon, et autres
Publié: (2024)

Limitations of tensor network approaches for optimization and sampling: A comparison to quantum and classical Ising machines
par: Dziubyna, Anna Maria, et autres
Publié: (2024)

On-chip Frequency divider in superconducting quantum circuit
par: Wang, Hui, et autres
Publié: (2025)

An in-principle super-polynomial quantum advantage for approximating combinatorial optimization problems via computational learning theory
par: Pirnay, Niklas, et autres
Publié: (2022)

Approximate combinatorial optimization with Rydberg atoms: the barrier of interpretability
par: de Correc, Christian, et autres
Publié: (2025)

Problem specific ion native ansatz for combinatorial optimization
par: Paradezhenko, Georgii, et autres
Publié: (2025)

Boosting Sparsity in Graph Decompositions with QAOA Sampling
par: Pennington, George, et autres
Publié: (2025)