Multiuser MIMO (MU-MIMO) deployment jointly serves multiple users over shared time-frequency Resource Blocks (RBs) to achieve substantial spectral efficiency improvement. To exploit the full potential of MU-MIMO, users should be scheduled on RBs with strong channels and low Co-Channel Interference (CCI). This paper leverages Variational Quantum Algorithm (VQA) framework, tailored for near-term Noisy Intermediate-Scale Quantum (NISQ) devices, for efficient user scheduling in broadband MU-MIMO systems, which is NP-hard. Specifically, our designed quantum circuit incorporates parameterized entangling gates to create controllable correlations between quantum states, which may explore the solution space more efficiently. To facilitate the challenging variational parameters optimization in VQAs, exacerbated by entangling operations, our framework adopts a two-stage approach. First, we utilize Bayesian Optimization (BO) which constructs a global surrogate model to find sets of promising parameters. Second, we perform local optimization to fine-tune the result of BO by leveraging Gaussian kernels to approximate the noisy optimization landscape with a limited amount of quantum shots. Through extensive simulations, we demonstrate the efficacy of our VQA in achieving near-optimal performance for broadband MU-MIMO user scheduling problems.
Multiuser MIMO (MU-MIMO) deployment jointly serves multiple users over shared time-frequency Resource Blocks (RBs) to achieve substantial spectral efficiency improvement. To exploit the full potential of MU-MIMO, users should be scheduled on RBs with strong channels and low Co-Channel Interference (CCI). This paper leverages Variational Quantum Algorithm (VQA) framework, tailored for near-term Noisy Intermediate-Scale Quantum (NISQ) devices, for efficient user scheduling in broadband MU-MIMO systems, which is NP-hard. Specifically, our designed quantum circuit incorporates parameterized entangling gates to create controllable correlations between quantum states, which may explore the solution space more efficiently. To facilitate the challenging variational parameters optimization in VQAs, exacerbated by entangling operations, our framework adopts a two-stage approach. First, we utilize Bayesian Optimization (BO) which constructs a global surrogate model to find sets of promising parameters. Second, we perform local optimization to fine-tune the result of BO by leveraging Gaussian kernels to approximate the noisy optimization landscape with a limited amount of quantum shots. Through extensive simulations, we demonstrate the efficacy of our VQA in achieving near-optimal performance for broadband MU-MIMO user scheduling problems.
Massive multiple-input multiple-output (MIMO) systems are a key enabling technology for 5G-Advanced and emerging 6G networks, yet their performance is fundamentally constrained by high-dimensional, non-convex optimization problems arising from beamforming, power allocation, and user scheduling under imperfect channel state information (CSI).This paper proposes a hybrid quantum-classical optimization framework that formulates discrete and continuous massive MIMO resource allocation problems using Quadratic Unconstrained Binary Optimization (QUBO) and variational quantum algorithms.Discrete beam selection is addressed using quantum annealing, while continuous power control and hybrid beamforming are refined using variational quantum circuits within a classical feedback loop.Simulation results demonstrate improvements in aggregate spectral efficiency, runtime scalability, and robustness under imperfect CSI compared to conventional ZF and WMMSE baselines.The benefits of using the proposed solution include scalable runtime performance with respect to larger numbers of antennas; thus, it highlights the potential of optimizing quantum-assisted technologies for the future of wireless networks based on realistic assumptions regarding near-term NISQ-era performance.
Variational quantum algorithms have promising applications in noisy intermediate-scale quantum (NISQ) devices. These algorithms rely on a classical optimization outer loop that minimizes a parameterized quantum circuit function. The optimization in variational quantum eigensolver (VQE) is NP-hard, meaning that finding the optimal solution is infeasible in the worst-case scenario. One way to address this challenge is through parallel optimization of parameters using multiple-parameterized quantum circuits. However, this approach is unsuitable for cloud-based quantum processing unit utilization due to the increased number of quantum circuit executions. Although NISQ devices have limitations in terms of gate depth, their size has been growing in recent years. Therefore, implementing multiple-parameterized quantum circuits in NISQ devices can suppress the increase in the number of executions. In this study, we propose a parallel-VQE, which leverages the parallel execution of parameterized quantum circuits to perform parallel parameter optimization in VQE, achieving convergence to solutions closer to the ground state. We validate the effectiveness of parallel-VQE in solving the random weighted max-cut problem using numerical simulations and a real quantum device. We present the results of running up to six circuits in parallel (120 qubits) and demonstrate the advantages of using multiple units to improve computational accuracy. This study provides a potential method for solving eigenvalue problems and combinatorial optimization problems for future quantum devices.
Quantum computers face challenges due to limited resources, particularly in cloud environments. Despite these ob-stacles, Variational Quantum Algorithms (VQAs) are considered promising applications for present-day Noisy Intermediate-Scale Quantum (NISQ) systems. VQAs require multiple optimization iterations to converge on a globally optimal solution. Moreover, these optimizations, known as restarts, need to be repeated from different points to mitigate the impact of noise. Unfortunately, the job scheduling policies for each VQA task in the cloud are heavily unoptimized. Notably, each VQA execution instance is typically scheduled on a single NISQ device. Given the variety of devices in the cloud, users often prefer higher-fidelity devices to ensure higher-quality solutions. However, this preference leads to increased queueing delays and unbalanced resource utilization. We propose Qoncord, an automated job scheduling framework to address these cloud-centric challenges for VQAs. Qoncord leverages the insight that not all training iterations and restarts are equal, Qoncord strategically divides the training process into exploratory and fine-tuning phases. Early exploratory iterations, more resilient to noise, are executed on less busy machines, while fine-tuning occurs on high-fidelity machines. This adaptive approach mitigates the impact of noise, optimizes resource usage, and reduces queuing delays in cloud environments. Qoncord also significantly reduces execution time and minimizes restart overheads by eliminating low-performance iterations. Thus, Qoncord offers similar solutions 17.4 × faster. It also provides 13.3% better solutions for the same time budget as the baseline.
In the era of Noisy Intermediate-Scale Quantum (NISQ) computing, traditional quantum algorithms face the challenges of limited number of qubits, noise and decoherence. In order to address these issues, we propose a Quantum Architecture Search (QAS) method driven by Bayesian Optimization (BO), which is applied to variational quantum algorithms. In this work, QAS is regarded as a fixed-scale sampling problem. We innovatively propose a quantum gate pool and use a parameterized probabilistic model to dynamically determine the optimal quantum gate for each position in the quantum circuit, thus optimizing the circuit structure. Through using a gradient-free BO method based on radial basis function, we adaptively design end-to-end quantum circuits, significantly reducing circuit depths and improving computational accuracy. We conducted experiments on ground state energy estimation in quantum chemistry and combinatorial optimization problem. The experimental results show that our method is significantly superior to traditional methods and other meta-heuristic search methods in accuracy and efficiency. Our method not only reduces the depth of quantum circuits by up to 85% under a certain accuracy, but also improves the accuracy rate to nearly 100% in combinatorial optimization problem. This provides a powerful and efficient tool for designing optimal quantum circuits and promotes the practical application of quantum algorithms in the NISQ era.
Job scheduling is an NP-hard optimization problem with clear industrial relevance. In practice, distributing work across a team is not only about meeting deadlines or improving productivity; it also affects fatigue, stress, and employee well-being. Variational Quantum Algorithms (VQAs) provide a promising way to address these problems through QUBO formulations, although their scalability on near-term NISQ hardware is still limited by Hilbert-space growth and barren plateaus. In this work, we simulate a VQA for a realistic Multi-Skill Resource-Constrained Project Scheduling Problem (MS-RCPSP), including worker capacities, skill matrices, task priorities, deadlines, and calendar stability during rescheduling. To keep the problem within a near-term circuit size, we use a temporal batch decomposition that solves one day at a time, propagates the remaining workload, and combines it with a logarithmic binary encoding that keeps every batch at or below 30 qubits. Because the ground state of a QUBO Hamiltonian is a computational basis state, entanglement is not required to represent the solution, raising the question of whether it helps or hinders ansatz training. We address this question by comparing the linear and brick-wall entangling topologies of a hardware-efficient ansatz with an entanglement-free reference that has the same number of parameters and by training every configuration with COBYLA and with Adam using SPSA gradient estimation. For the instance and initialization studied, the entanglement-free reference produced feasible schedules under both optimizers. With COBYLA, it produced the feasible schedule closest to the required workload at a fraction of the simulation cost of the entangled topologies, indicating that entanglement did not improve the solutions found by the VQA.
This paper investigates a quantum extension of classical Multiple-Input Multiple-Output (MIMO) communication in which the conventional linear channel model is replaced by a parameterized multi-qubit unitary transformation. Within this framework, interference is represented through coherent quantum interactions rather than additive signal coupling. To recover transmitted information, a Variational Quantum Circuit (VQC) receiver is introduced that learns an approximate inverse channel transformation through supervised variational optimization. The proposed system is evaluated under realistic noisy intermediate-scale quantum (NISQ) conditions incorporating depolarizing noise, thermal relaxation, and measurement imperfections, and its performance is compared with that of standard classical detection methods. The results reveal a trade-off between the two approaches: classical detectors achieve substantially lower bit-error rates across much of the investigated parameter range but exhibit pronounced performance degradation for specific channel configurations, whereas the VQC receiver maintains a more uniform error profile as channel complexity increases, albeit at a higher average BER. These findings suggest that variational quantum receivers are not a direct replacement for classical detection methods, but rather a complementary approach that may offer increased performance stability in communication scenarios characterized by strong coupling and complex interference patterns.