On a cloud-accessed quantum processor the classical optimizer of a variational algorithm communicates with the device through submitted jobs, and each job carries a queueing and turnaround overhead that does not depend on how many circuits it contains. We study a simple consequence of this for the quantum approximate optimization algorithm (QAOA). An optimizer whose next set of trial parameters is known before any result returns can evaluate the whole set in one job, whereas a sequential optimizer such as COBYLA spends one job per function evaluation. We compare a batched pattern search with COBYLA on IBM's \ibmfez\ processor for cardinality-constrained portfolio selection with six to twelve assets, giving both optimizers the same number of jobs and the same number of shots. At every size the batched search reaches, after its first job, a parameter quality that the serial optimizer takes several jobs to match, and the two methods converge to comparable final values; repeating the eight-asset comparison from four starting points gives the same ordering each time. The instances are small enough to be solved exactly, which lets us check that the device's output distribution is correlated with the true ranking of portfolios and is clearly separated from a control circuit of the same depth with the cost layer removed. A short scan over circuit depth at classically optimal parameters shows that on this device the measured solution quality peaks at two or three QAOA layers. The protocol is described in enough detail to be reproduced, and the notebooks and raw counts are released.
On a cloud-accessed quantum processor the classical optimizer of a variational algorithm communicates with the device through submitted jobs, and each job carries a queueing and turnaround overhead that does not depend on how many circuits it contains. We study a simple consequence of this for the quantum approximate optimization algorithm (QAOA). An optimizer whose next set of trial parameters is known before any result returns can evaluate the whole set in one job, whereas a sequential optimizer such as COBYLA spends one job per function evaluation. We compare a batched pattern search with COBYLA on IBM's \ibmfez\ processor for cardinality-constrained portfolio selection with six to twelve assets, giving both optimizers the same number of jobs and the same number of shots. At every size the batched search reaches, after its first job, a parameter quality that the serial optimizer takes several jobs to match, and the two methods converge to comparable final values; repeating the eight-asset comparison from four starting points gives the same ordering each time. The instances are small enough to be solved exactly, which lets us check that the device's output distribution is correlated with the true ranking of portfolios and is clearly separated from a control circuit of the same depth with the cost layer removed. A short scan over circuit depth at classically optimal parameters shows that on this device the measured solution quality peaks at two or three QAOA layers. The protocol is described in enough detail to be reproduced, and the notebooks and raw counts are released.
When a quantum processor is reached through a cloud queue, a variational algorithm pays for every round trip, and a single round trip can carry many circuits. The classical optimizer therefore decides how much is learned per job, not only per shot. We study this for a quantum neural network classifier. We compare optimizers that are given the same number of jobs and the same shots per job, and that differ only in how they fill each job. This comparison treats hybrid quantum-classical training as an execution-efficiency problem: how to obtain useful optimization progress from each costly interaction with a quantum processor. The resulting perspective connects optimizer design to overhead amortization and efficient use of accelerator resources. A direct port of a batched pattern search that worked for the quantum approximate optimization algorithm stalls once the model has a few dozen parameters. What does transfer is the principle behind it: fill each job with a batch of parameter vectors that is fixed before the job is sent. For circuits built from Pauli rotations the natural batch is the parameter-shift stencil. We show that its gradient error falls as the inverse of the shots per job, while the error of simultaneous-perturbation methods (SPSA) has a floor that no number of shots removes. In simulation, batched parameter-shift training needs between a fifth and a half of the jobs SPSA needs, for 24 to 48 parameters, and the ordering holds at two noise levels. A new structure-aware stencil search reads the same kind of rows as sinusoids and also beats SPSA. On IBM's ibm_fez processor, in three interleaved runs at six and eight qubits, the batched optimizer reached SPSA's final training loss within 4 to 20 of its 50 jobs. Its test accuracy was clearly higher at eight qubits; at six qubits the difference was not significant. All hardware numbers can be re-derived from the raw shots.
We introduce a novel quantum optimization paradigm: the Fixed-Parameter-Count Quantum Approximate Optimization Algorithm (FPC-QAOA). It is a scalable variational framework that maintains a constant number of trainable parameters regardless of the number of qubits, Hamiltonian complexity, or circuit depth. By separating schedule function optimization from circuit digitization, FPC-QAOA enables accurate schedule approximations with minimal parameters while supporting arbitrarily deep digitized adiabatic evolutions, constrained only by NISQ hardware capabilities. This separation allows depth to scale without expanding the classical search space, mitigating overparameterization and optimization challenges typical of deep QAOA circuits, such as barren plateaus-like behaviors. We benchmark FPC-QAOA on random MaxCut instances and the Tail Assignment Problem, achieving performance comparable to or better than standard QAOA with nearly constant classical effort and significantly fewer quantum circuit evaluations. Experiments on the IBM Kingston superconducting processor with up to 50 qubits confirm robustness and hardware efficiency under realistic noise. These results position FPC-QAOA as a practical and scalable paradigm for variational quantum optimization on near-term quantum devices.
Quantum Approximate Optimization Algorithm (QAOA) is a promising quantum heuristic with empirical evidence of speedup over classical state-of-the-art for some problems. QAOA uses a parameterized circuit with p layers, where higher p yields better solutions, but requires optimizing 2p independent parameters, which is challenging at large p. We present an iterative interpolation method that exploits the smoothness of optimal parameter schedules by expressing them in a basis of orthogonal functions, generalizing the work of Zhou et al. By optimizing a small number of basis coefficients and iteratively increasing both circuit depth and coefficient count until convergence, our method constructs high-quality schedules for large p. We provide theoretical justification using Jackson's theorem and Lipschitz continuity to bound the required number of basis coefficients for a given accuracy. Our approach achieves better performance with fewer optimization steps than existing methods across three benchmark problems: the Sherrington-Kirkpatrick (SK) model, portfolio optimization, and Low Autocorrelation Binary Sequences (LABS). For the largest LABS instance, we achieve near-optimal merit factors with schedules exceeding 1000 layers, an order of magnitude beyond previous methods. Additionally, we observe that a mild growth in QAOA depth suffices to solve the SK model exactly, a result of independent theoretical interest.
Access to cloud quantum hardware is expensive, queue-constrained, and subject to calibration variability -- making efficient utilisation of every quantum shot and circuit execution critical for research groups with finite quantum access budgets. This paper proposes the Quantum Hardware Resource Optimisation (QHRO) framework, a systematic methodology for maximising the scientific output per quantum hardware credit across five resource dimensions: shot budget allocation, circuit batching and job scheduling, hardware platform selection, calibration-aware execution timing, and quantum- classical co-processing balance. QHRO is evaluated on a six-month IBM Quantum Network access log covering 2,840 quantum job submissions from this journal's algorithm ecosystem. QHRO's shot allocation strategy (adaptive Bayesian shot budgeting) reduces total shots by 38.4% at equal result quality. Circuit batching reduces queue wait time by 48.4% through intelligent job packing. Calibration-aware scheduling reduces effective error rate by 18.4% by submitting jobs during low-noise calibration windows. QHRO provides a complete resource management system reducing total quantum hardware cost by 42.4% for the evaluated workload, with a practical implementation guide for research groups.
The quantum approximate optimization algorithm (QAOA) is known for its capability and universality in solving combinatorial optimization problems on near-term quantum devices. The results yielded by QAOA depend strongly on its initial variational parameters. Hence, parameter selection for QAOA becomes an active area of research, as bad initialization might deteriorate the quality of the results, especially at great circuit depths. We first discuss the patterns of optimal parameters in QAOA in two directions: the angle index and the circuit depth. Then, we discuss the symmetries and periodicity of the expectation that is used to determine the bounds of the search space. Based on the patterns in optimal parameters and the bounds restriction, we propose a strategy that predicts the new initial parameters by taking the difference between the previous optimal parameters. Unlike most other strategies, the strategy we propose does not require multiple trials to ensure success. It only requires one prediction when progressing to the next depth. We compare this strategy with our previously proposed strategy and the layerwise strategy for solving the Max-cut problem in terms of the approximation ratio and the optimization cost. We also address the non-optimality in previous parameters, which is seldom discussed in other works despite its importance in explaining the behavior of variational quantum algorithms.
Abstract We present a detailed study of portfolio optimization using different versions of the quantum approximate optimization algorithm (QAOA). For a given list of assets, the portfolio optimization problem is formulated as quadratic binary optimization constrained on the number of assets contained in the portfolio. QAOA has been suggested as a possible candidate for solving this problem (and similar combinatorial optimization problems) more efficiently than classical computers in the case of a sufficiently large number of assets. However, the practical implementation of this algorithm requires a careful consideration of several technical issues, not all of which are discussed in the present literature. The present article intends to fill this gap and thereby provides the reader with a useful guide for applying QAOA to the portfolio optimization problem (and similar problems). In particular, we will discuss several possible choices of the variational form and of different classical algorithms for finding the corresponding optimized parameters. Viewing at the application of QAOA on error-prone NISQ hardware, we also analyse the influence of statistical sampling errors (due to a finite number of shots) and gate and readout errors (due to imperfect quantum hardware). Finally, we define a criterion for distinguishing between ‘easy’ and ‘hard’ instances of the portfolio optimization problem.