Copertina

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

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Schmid, Mathias, Mohseni, Naeimeh, Hartmann, Michael J.
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Quantum Physics
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Deep learning of many-body observables and quantum information scrambling
di: Mohseni, Naeimeh, et al.
Pubblicazione: (2023)

On the quantum time complexity of divide and conquer
di: Allcock, Jonathan, et al.
Pubblicazione: (2023)

Quantum divide and conquer
di: Childs, Andrew M., et al.
Pubblicazione: (2022)

Transfer learning in predicting quantum many-body dynamics: from physical observables to entanglement entropy
di: Schmidt, Philipp, et al.
Pubblicazione: (2024)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Designing fast quantum gates using optimal control with a reinforcement-learning ansatz
di: Sarma, Bijita, et al.
Pubblicazione: (2023)

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

Demonstrating Quantum Scaling Advantage in Approximate Optimization for Energy Coalition Formation with 100+ Agents
di: Mohseni, Naeimeh, et al.
Pubblicazione: (2024)

Highly Efficient Encoding for Job-Shop Scheduling Problems and its Application on Quantum Computers
di: Schmid, Mathias, et al.
Pubblicazione: (2024)

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

Transfer learning of optimal QAOA parameters in combinatorial optimization
di: Montanez-Barrera, J. A., et al.
Pubblicazione: (2024)

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

Constrained Quantum Optimization at Utility Scale: Application to the Knapsack Problem
di: Mohseni, Naeimeh, et al.
Pubblicazione: (2026)

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

Mitigating exponential concentration in covariant quantum kernels for subspace and real-world data
di: Agliardi, Gabriele, et al.
Pubblicazione: (2024)

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

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

Limitations of tensor network approaches for optimization and sampling: A comparison to quantum and classical Ising machines
di: Dziubyna, Anna Maria, et al.
Pubblicazione: (2024)

On-chip Frequency divider in superconducting quantum circuit
di: Wang, Hui, et al.
Pubblicazione: (2025)

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

Boosting Sparsity in Graph Decompositions with QAOA Sampling
di: Pennington, George, et al.
Pubblicazione: (2025)

Approximate combinatorial optimization with Rydberg atoms: the barrier of interpretability
di: de Correc, Christian, et al.
Pubblicazione: (2025)

Problem specific ion native ansatz for combinatorial optimization
di: Paradezhenko, Georgii, et al.
Pubblicazione: (2025)