Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2602.14327

Scalable Clifford-Based Classical Initialization for the Quantum Approximate Optimization Algorithm

Dhanvi Bharadwaj, Yuewen Hou, Guang-Yi Li, Gokul Subramanian Ravi

quant-phSubmitted Feb 15, 2026• Announced Feb 17, 2026• 3 citations• Revised Aug 23, 2026 (v2)
v1 · Feb 15, 2026v2 · Aug 23, 2026
arXivHTMLPDF

Abstract

Variational Quantum Algorithms (VQAs), such as the Quantum Approximate Optimization Algorithm (QAOA), offer a promising route to tackling combinatorial optimization problems on near and intermediate-term quantum devices. However, their performance critically depends on the choice of initial parameters, and the limited expressiveness of the QAOA ansatz makes identifying effective initializations both difficult and unscalable. To address this, we propose a framework, Scalable Parameter Initialization for QAOA (SPIQ), that employs a relaxed QAOA ansatz to enable classical search over a set of Clifford-preparable quantum states that yield high-quality solutions. These states serve as superior QAOA initializations, driving rapid convergence while significantly reducing the quantum circuit evaluations needed to reach high-quality solutions and consequently lowering quantum-device cost. We present a scalable, application-agnostic initialization framework that achieves an absolute accuracy improvement of up to 80% over state-of-the-art initialization and reduces initial-state diversity by up to 10,000x across QUBO, PUBO, and PCBO problems spanning tens to hundreds of qubits. We further benchmark its performance on a wide range of problem formulations and instances derived from real-world datasets, demonstrating consistent and scalable improvements. Furthermore, we introduce two complementary strategies for selecting high-quality Clifford points identified by our search procedure and using them to seed multi-start optimization, thereby enhancing exploration and improving solution quality.

Comments
IEEE QCE 2026 Camera Ready Submission

Related papers

Classical State Preparation for Variational Quantum Algorithms via Reinforcement Learning

Gino Kwun, Dhanvi Bharadwaj, Gokul Subramanian Ravi

Variational Quantum Algorithms (VQAs) potentially offer a pathway to practical quantum advantage, but their optimization is heavily hindered by barren plateaus and numerous local minima. While classically simulable Clifford circuits can warm-start VQAs to accelerate convergence, existing heuristic-based initialization methods struggle to scale within vast combinatorial search spaces. We address this bottleneck with CRiSP (a Clifford Reinforcement Learning agent for State Preparation), which casts Clifford prefix selection as a sequential decision-making problem. CRiSP utilizes Neural-Guided Monte Carlo Tree Search, driven by a Transformer-based policy trained via self-play, to insert learned Clifford gates before fixed parameterized rotations. This enables the construction of high-quality initial states entirely through polynomial-time classical stabilizer simulation. By integrating a curriculum learning strategy that progressively expands the search horizon, the agent efficiently scales to deep circuits. Evaluated on QAOA benchmarks of up to $22$ qubits and $1{,}370$ parameters, CRiSP outperforms state-of-the-art Clifford initialization methods by a mean of $3.19\times$ (max $45.02\times$) in average energy accuracy and $2.41\times$ (max $16.01\times$) in best-achieved energy accuracy. Assessments on VQE tasks further demonstrate the framework's robustness and generalizability.

quant-pharXiv:2605.23138•May 25, 2026•0 citations

Exploring Clifford and near-Clifford initialization strategies for quantum variational optimization

Alberto B. de Palhares, Joab M. Varela, Diogo Henrique Gonçalves Duarte +1 more

Variational Quantum Algorithms are promising candidates for near-term quantum advantage, but face significant scalability challenges due to barren plateaus. In this work, we address the trainability of the Variational Quantum Eigensolver for combinatorial portfolio optimization by evaluating three warm-start initialization strategies: Clifford, near-Clifford and a mixed approach. We compare these against a cold-start baseline initialized with the initial parameters close to zero across system sizes from [Formula: see text] to [Formula: see text]. Our results show that while the uninformed cold start fails to converge for larger systems, all warm-start strategies achieve a [Formula: see text] success rate and high initial-state fidelities. Crucially, we observe no clear difference in convergence behavior among the warm-start methods. Consequently, for this class of QUBO-based portfolio optimization problems, we identify the purely Clifford-based approach as the most efficient strategy; it consistently places the optimizer in a region from which the variational optimization converges successfully while remaining polynomially simulable on classical hardware during the quantum phase of the algorithm, indicating that the additional computational cost of non-Clifford resources offers negligible benefits for initialization in this specific context.

International Journal of Modern Physics C•Apr 30, 2026•0 citations

Quantum Approximate Optimization Algorithm (QAOA) for Solving NP-Hard Problems

Srikanth Kilaru, Thota Sravya Vardhani, Attluri Udaya Lakshmi +2 more

The Quantum Approximate Optimization Algorithm (QAOA) is a hybrid quantum-classical algorithm used to study NP-hard combinatorial optimization problems. In this work, we focused on optimization strategies for QAOA including circuit depth reduction, parameter parallelization, and hybrid classical feedback mechanisms. We will consider the application of QAOA to different types of NP-hard problems such as Max-Cut and Vehicle Routing Problem (VRP) and discuss the advantages and disadvantages of each in terms of approximation quality and cost of computation. The comparative simulation on the various qubit counts and depth layers points out the limits of scalability and the constraints of hardware on the current Noisy Intermediate-Scale Quantum (NISQ) devices. And also an improved divide-and-conquer strategy is presented in which parameter reusability and gradient-informed initialization are combined to boost convergence rates. The results of the experiment show that it is more efficient and scalable while maintaining the competitive approximation performance compared to the baseline QAOA. The experimental validation focuses on representative small-size instances, while the proposed framework provides extensions for scalable implementations. Ultimately, this work is a step towards the realization of efficient, hardware-aware, and scalable optimization strategies, thus opening up the practical deployment of QAOA on the quantum systems of the next few years.

IEEE Nexo-Tech International Conference on Advanced Technologies and Innovations (ICATI)•May 8, 2026•0 citations

Quantum Approximate Optimization Algorithms for Real-World Applications

Erik Lindberg, Ivan Lindberg

The Quantum Approximate Optimisation Algorithm (QAOA) has emerged as a leading candidate for near-term quantum advantage in combinatorial optimisation, but most evaluations remain confined to synthetic benchmarks such as random MaxCut instances. Translating QAOA to real-world problem instances -- with irregular graph structures, heterogeneous constraint types, and practical scale requirements -- introduces additional challenges including QUBO formulation overhead, hardware embedding costs, and the performance gap between QAOA on structured real instances vs. random benchmarks. This paper presents the Real-World QAOA (RW-QAOA) framework, a systematic methodology for applying QAOA to four real-world application domains: supply chain network optimisation, financial portfolio rebalancing, telecommunications frequency assignment, and traffic signal timing optimisation. RW-QAOA introduces three methodological contributions: a domain-adaptive QUBO formulator (DAQF) encoding real-world constraints as penalised QUBO terms with penalty coefficient auto-tuning; a warm-start initialisation strategy (WSIS) using classical heuristic solutions to seed QAOA parameter search; and a layered noise adaptation protocol (LNAP) adjusting circuit depth based on real-time device calibration data. RW-QAOA is evaluated on real problem instances from industry partners across all four domains on IBM Quantum Eagle (127-qubit). RW-QAOA achieves solution quality within 4.2% of classical exact solvers across all four domains, outperforming classical greedy heuristics by 12.4% (SD = 3.8%) on average. WSIS reduces QAOA parameter convergence iterations by 48.4%. LNAP improves approximation ratio by 8.4pp vs. fixed-depth QAOA under device noise variation.

Quantum Frontiers Journal•Mar 28, 2024•0 citations

Sampling-Based Quantum Optimization Algorithm with Quantum Relaxation

Hiromichi Matsuyama, Yu Yamashiro

Combinatorial optimization is one of the promising applications of quantum computation. Variational Quantum Algorithm (VQA) is a classical-quantum hybrid algorithm framework for noisy quantum devices. However, the quality of the solution is readily affected by statistical fluctuations and physical noise, making it challenging to maintain applicability for largescale problems. In contrast, sampling-based quantum algorithms have recently been successfully applied to large-scale quantum chemistry problems. In the sampling-based framework, the quantum device is used only for sampling, while the ground state and its energy are estimated on the classical device. In this study, we propose the Sampling-based Quantum Optimization Algorithm (SQOA) that leverages these advantages for combinatorial optimization. There are two challenges in constructing SQOA. The first challenge is that we need to encode the optimization problem in a non-diagonal Hamiltonian, even though many VQAs encode it into the Ising Hamiltonian, which is diagonal. The second challenge is that we need a method for efficient preparation of the input state to be sampled. To address the first challenge, we utilize the Quantum Relaxation (QR) method for encoding an optimization problem within a Hamiltonian. This method achieves a higher encoding density by mapping multiple variables to a single qubit, thus requiring fewer qubits for larger problems compared to the Ising Hamiltonian approach. Moreover, to address the second challenge, we investigate the parameter transferability within the Quantum Alternating Operator Ansatz for QR Hamiltonians. We show that restricting parameters to a linear form exhibits moderate transferability for 3-regular Max-Cut problems, similar to transferability observed in the Quantum Approximate Optimization Algorithm. Therefore, this property allows us to efficiently prepare the input state for a large problem instance using the parameters obtained from a small problem instance. We leveraged transferability to create input states and applied SQOA with QR to the Max-Cut instances. By transferring parameters from a 20-node problem, we demonstrate that SQOA with QR provides high-quality solutions for 40-node problems without variational parameter optimization.

arXiv:2504.12629•IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•4 citations

Hybrid Quantum–Classical Optimization: Enhancing QAOA Performance via Classical Optimizer Selection

Xuezhu Chen

Hybrid Quantum–Classical Optimization combines the advantages of quantum computing and classical optimization to address complex combinatorial optimization problems. The Quantum Approximate Optimization Algorithm (QAOA), as an outstanding Variational Quantum Algorithm (VQA), shows great potential in solving combinatorial optimization problems. Classical optimization methods play a crucial role in tuning the parameters of quantum circuits, affecting the algorithm’s convergence speed and solution quality. This paper designs and simulates QAOA circuits based on the Qiskit framework, focusing on comparing the performance of three classical optimizers— Adaptive Moment Estimation (Adam), Constrained Optimization BY Linear Approximations (COBYLA), and Simultaneous Perturbation Stochastic Approximation (SPSA)—in parameter optimization. Adam and SPSA perform more stably in deeper circuits, making them suitable for high-dimensional parameter spaces, whereas COBYLA tends to get trapped in local optima and exhibits greater fluctuations under limited iterations. The results further highlight the importance of classical optimizer selection and hyperparameter tuning in enhancing the performance of hybrid quantum–classical optimization algorithms.

International Conference on Machine Learning, Computational Intelligence and Pattern Recognition (MLCIPR)•Dec 19, 2025•0 citations
Variational Quantum Algorithms (VQAs), such as the Quantum Approximate Optimization Algorithm (QAOA), offer a promising route to tackling combinatorial optimization problems on near and intermediate-term quantum devices. However, their performance critically depends on the choice of initial parameters, and the limited expressiveness of the QAOA ansatz makes identifying effective initializations both difficult and unscalable. To address this, we propose a framework, Scalable Parameter Initialization for QAOA (SPIQ), that employs a relaxed QAOA ansatz to enable classical search over a set of Clifford-preparable quantum states that yield high-quality solutions. These states serve as superior QAOA initializations, driving rapid convergence while significantly reducing the quantum circuit evaluations needed to reach high-quality solutions and consequently lowering quantum-device cost. We present a scalable, application-agnostic initialization framework that achieves an absolute accuracy improvement of up to 80% over state-of-the-art initialization and reduces initial-state diversity by up to 10,000x across QUBO, PUBO, and PCBO problems spanning tens to hundreds of qubits. We further benchmark its performance on a wide range of problem formulations and instances derived from real-world datasets, demonstrating consistent and scalable improvements. Furthermore, we introduce two complementary strategies for selecting high-quality Clifford points identified by our search procedure and using them to seed multi-start optimization, thereby enhancing exploration and improving solution quality.
Variational Quantum Algorithms (VQAs) potentially offer a pathway to practical quantum advantage, but their optimization is heavily hindered by barren plateaus and numerous local minima. While classically simulable Clifford circuits can warm-start VQAs to accelerate convergence, existing heuristic-based initialization methods struggle to scale within vast combinatorial search spaces. We address this bottleneck with CRiSP (a Clifford Reinforcement Learning agent for State Preparation), which casts Clifford prefix selection as a sequential decision-making problem. CRiSP utilizes Neural-Guided Monte Carlo Tree Search, driven by a Transformer-based policy trained via self-play, to insert learned Clifford gates before fixed parameterized rotations. This enables the construction of high-quality initial states entirely through polynomial-time classical stabilizer simulation. By integrating a curriculum learning strategy that progressively expands the search horizon, the agent efficiently scales to deep circuits. Evaluated on QAOA benchmarks of up to 222222 qubits and 1,3701{,}3701,370 parameters, CRiSP outperforms state-of-the-art Clifford initialization methods by a mean of 3.19×3.19\times3.19× (max 45.02×45.02\times45.02×) in average energy accuracy and 2.41×2.41\times2.41× (max 16.01×16.01\times16.01×) in best-achieved energy accuracy. Assessments on VQE tasks further demonstrate the framework's robustness and generalizability.
Variational Quantum Algorithms are promising candidates for near-term quantum advantage, but face significant scalability challenges due to barren plateaus. In this work, we address the trainability of the Variational Quantum Eigensolver for combinatorial portfolio optimization by evaluating three warm-start initialization strategies: Clifford, near-Clifford and a mixed approach. We compare these against a cold-start baseline initialized with the initial parameters close to zero across system sizes from [Formula: see text] to [Formula: see text]. Our results show that while the uninformed cold start fails to converge for larger systems, all warm-start strategies achieve a [Formula: see text] success rate and high initial-state fidelities. Crucially, we observe no clear difference in convergence behavior among the warm-start methods. Consequently, for this class of QUBO-based portfolio optimization problems, we identify the purely Clifford-based approach as the most efficient strategy; it consistently places the optimizer in a region from which the variational optimization converges successfully while remaining polynomially simulable on classical hardware during the quantum phase of the algorithm, indicating that the additional computational cost of non-Clifford resources offers negligible benefits for initialization in this specific context.
The Quantum Approximate Optimization Algorithm (QAOA) is a hybrid quantum-classical algorithm used to study NP-hard combinatorial optimization problems. In this work, we focused on optimization strategies for QAOA including circuit depth reduction, parameter parallelization, and hybrid classical feedback mechanisms. We will consider the application of QAOA to different types of NP-hard problems such as Max-Cut and Vehicle Routing Problem (VRP) and discuss the advantages and disadvantages of each in terms of approximation quality and cost of computation. The comparative simulation on the various qubit counts and depth layers points out the limits of scalability and the constraints of hardware on the current Noisy Intermediate-Scale Quantum (NISQ) devices. And also an improved divide-and-conquer strategy is presented in which parameter reusability and gradient-informed initialization are combined to boost convergence rates. The results of the experiment show that it is more efficient and scalable while maintaining the competitive approximation performance compared to the baseline QAOA. The experimental validation focuses on representative small-size instances, while the proposed framework provides extensions for scalable implementations. Ultimately, this work is a step towards the realization of efficient, hardware-aware, and scalable optimization strategies, thus opening up the practical deployment of QAOA on the quantum systems of the next few years.
The Quantum Approximate Optimisation Algorithm (QAOA) has emerged as a leading candidate for near-term quantum advantage in combinatorial optimisation, but most evaluations remain confined to synthetic benchmarks such as random MaxCut instances. Translating QAOA to real-world problem instances -- with irregular graph structures, heterogeneous constraint types, and practical scale requirements -- introduces additional challenges including QUBO formulation overhead, hardware embedding costs, and the performance gap between QAOA on structured real instances vs. random benchmarks. This paper presents the Real-World QAOA (RW-QAOA) framework, a systematic methodology for applying QAOA to four real-world application domains: supply chain network optimisation, financial portfolio rebalancing, telecommunications frequency assignment, and traffic signal timing optimisation. RW-QAOA introduces three methodological contributions: a domain-adaptive QUBO formulator (DAQF) encoding real-world constraints as penalised QUBO terms with penalty coefficient auto-tuning; a warm-start initialisation strategy (WSIS) using classical heuristic solutions to seed QAOA parameter search; and a layered noise adaptation protocol (LNAP) adjusting circuit depth based on real-time device calibration data. RW-QAOA is evaluated on real problem instances from industry partners across all four domains on IBM Quantum Eagle (127-qubit). RW-QAOA achieves solution quality within 4.2% of classical exact solvers across all four domains, outperforming classical greedy heuristics by 12.4% (SD = 3.8%) on average. WSIS reduces QAOA parameter convergence iterations by 48.4%. LNAP improves approximation ratio by 8.4pp vs. fixed-depth QAOA under device noise variation.
Combinatorial optimization is one of the promising applications of quantum computation. Variational Quantum Algorithm (VQA) is a classical-quantum hybrid algorithm framework for noisy quantum devices. However, the quality of the solution is readily affected by statistical fluctuations and physical noise, making it challenging to maintain applicability for largescale problems. In contrast, sampling-based quantum algorithms have recently been successfully applied to large-scale quantum chemistry problems. In the sampling-based framework, the quantum device is used only for sampling, while the ground state and its energy are estimated on the classical device. In this study, we propose the Sampling-based Quantum Optimization Algorithm (SQOA) that leverages these advantages for combinatorial optimization. There are two challenges in constructing SQOA. The first challenge is that we need to encode the optimization problem in a non-diagonal Hamiltonian, even though many VQAs encode it into the Ising Hamiltonian, which is diagonal. The second challenge is that we need a method for efficient preparation of the input state to be sampled. To address the first challenge, we utilize the Quantum Relaxation (QR) method for encoding an optimization problem within a Hamiltonian. This method achieves a higher encoding density by mapping multiple variables to a single qubit, thus requiring fewer qubits for larger problems compared to the Ising Hamiltonian approach. Moreover, to address the second challenge, we investigate the parameter transferability within the Quantum Alternating Operator Ansatz for QR Hamiltonians. We show that restricting parameters to a linear form exhibits moderate transferability for 3-regular Max-Cut problems, similar to transferability observed in the Quantum Approximate Optimization Algorithm. Therefore, this property allows us to efficiently prepare the input state for a large problem instance using the parameters obtained from a small problem instance. We leveraged transferability to create input states and applied SQOA with QR to the Max-Cut instances. By transferring parameters from a 20-node problem, we demonstrate that SQOA with QR provides high-quality solutions for 40-node problems without variational parameter optimization.
Hybrid Quantum–Classical Optimization combines the advantages of quantum computing and classical optimization to address complex combinatorial optimization problems. The Quantum Approximate Optimization Algorithm (QAOA), as an outstanding Variational Quantum Algorithm (VQA), shows great potential in solving combinatorial optimization problems. Classical optimization methods play a crucial role in tuning the parameters of quantum circuits, affecting the algorithm’s convergence speed and solution quality. This paper designs and simulates QAOA circuits based on the Qiskit framework, focusing on comparing the performance of three classical optimizers— Adaptive Moment Estimation (Adam), Constrained Optimization BY Linear Approximations (COBYLA), and Simultaneous Perturbation Stochastic Approximation (SPSA)—in parameter optimization. Adam and SPSA perform more stably in deeper circuits, making them suitable for high-dimensional parameter spaces, whereas COBYLA tends to get trapped in local optima and exhibits greater fluctuations under limited iterations. The results further highlight the importance of classical optimizer selection and hyperparameter tuning in enhancing the performance of hybrid quantum–classical optimization algorithms.