Alberto Moraglio
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Alberto Moraglio has a total of 92 co-authors. Here are the top co-authors by number of shared publications:
- Riccardo Poli
University of Essex
11 shared publications Yong-Hyuk Kim
6 shared publicationsYourim Yoon
6 shared publicationsByung-Ro Moon
5 shared publications- James McDermott
University of Galway, Galway, Ireland
5 shared publications Krzysztof Krawiec
Poznań University of Technology, Poznań, Poland
5 shared publications
Latest Publications
- 25 August 2026
- Published by Springer Nature
- p. 168-183
Order-Aware GSGP in Active Factor Allocation
- Open Access
- 13 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 373-376
Fitness Landscape as Knowledge Interface in Program Trace Optimization
- 13 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 373-376
Open AccessFitness Landscape as Knowledge Interface in Program Trace Optimization
- Open Access
- 13 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 821-848
Introduction to Quantum Optimization
- 13 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 821-848
Open AccessIntroduction to Quantum Optimization
- Open Access
- 13 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1631-1634
Penalty Sensitivity in Quantum Optimisation Across Computational Paradigms: A Benchmark Study
Penalty terms are widely used to enforce constraints in quadratic unconstrained binary optimisation (QUBO) models, yet their effects are often treated heuristically and assumed to be solver-independent. In practice, identical QUBO formulations are frequently reused across quantum and classical optimisation paradigms, raising questions about the consistency of penalty sensitivity. This paper presents a paradigm-level benchmark study of penalty sensitivity in QUBO-based optimisation. Using the Balanced Max-Cut problem as a representative single-constraint task, we systematically evaluate how penalty scaling influences feasibility, solution quality, and optimal solution attainment. Experiments are conducted in simulated environments across gate-based variational algorithms, annealing-based solvers, and a classical simulated annealing baseline, using identical QUBO formulations. The results reveal clear paradigm-dependent differences. Annealing-based solvers exhibit a sharp transition to high feasibility, exceeding 90% once penalties are sufficiently strong, whereas gate-based solvers remain below 60% feasibility in our experiments and show no systematic improvement. These findings demonstrate that penalty sensitivity depends critically on the computational paradigm, underscoring the need for paradigm-aware penalty design in quantum optimisation.
- 13 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1631-1634
Open AccessPenalty Sensitivity in Quantum Optimisation Across Computational Paradigms: A Benchmark Study
Penalty terms are widely used to enforce constraints in quadratic unconstrained binary optimisation (QUBO) models, yet their effects are often treated heuristically and assumed to be solver-independent. In practice, identical QUBO formulations are frequently reused across quantum and classical optimisation paradigms, raising questions about the consistency of penalty sensitivity. This paper presents a paradigm-level benchmark study of penalty sensitivity in QUBO-based optimisation. Using the Balanced Max-Cut problem as a representative single-constraint task, we systematically evaluate how penalty scaling influences feasibility, solution quality, and optimal solution attainment. Experiments are conducted in simulated environments across gate-based variational algorithms, annealing-based solvers, and a classical simulated annealing baseline, using identical QUBO formulations. The results reveal clear paradigm-dependent differences. Annealing-based solvers exhibit a sharp transition to high feasibility, exceeding 90% once penalties are sufficiently strong, whereas gate-based solvers remain below 60% feasibility in our experiments and show no systematic improvement. These findings demonstrate that penalty sensitivity depends critically on the computational paradigm, underscoring the need for paradigm-aware penalty design in quantum optimisation.
- 3 June 2026
- Published by Springer Nature
- p. 233-253
Evolving Programs in the Lambda Calculus Using Program Trace Optimisation
- 3 June 2026
- Published by Springer Nature
- p. 233-253
Evolving Programs in the Lambda Calculus Using Program Trace Optimisation
- 3 June 2026
- Published by Springer Nature
- p. 211-232
Language Model-Driven Program Synthesis with Program Trace Optimization on the Abstraction and Reasoning Corpus
- 3 June 2026
- Published by Springer Nature
- p. 211-232
Language Model-Driven Program Synthesis with Program Trace Optimization on the Abstraction and Reasoning Corpus
- 29 April 2026
- Published by Springer Nature
- p. 457-472
Structure-Aware Penalty Weights Scaling for Quadratic Unconstrained Binary Optimisation Formulation
- 29 April 2026
- Published by Springer Nature
- p. 457-472
Structure-Aware Penalty Weights Scaling for Quadratic Unconstrained Binary Optimisation Formulation
- 16 November 2025
- Published by Springer Nature
- p. 91-106
Comparing Quantum Annealer and Metaheuristic Methods to Solve the Steiner Tree Problem
- 16 November 2025
- Published by Springer Nature
- p. 91-106
Comparing Quantum Annealer and Metaheuristic Methods to Solve the Steiner Tree Problem
- Open Access
- 14 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 1274-1301
Introduction to Quantum Optimization
- 14 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 1274-1301
Open AccessIntroduction to Quantum Optimization
- Open Access
- 14 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 575-578
A Framework for Automatically Setting Multiple Penalty Weights in Quadratic Unconstrained Binary Optimization
- 14 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 575-578
Open AccessA Framework for Automatically Setting Multiple Penalty Weights in Quadratic Unconstrained Binary Optimization