Experimental implementation of continuous-variable QAOA on a quad-rail lattice cluster state

• URL: http://arxiv.org/abs/2606.10432v1
• Date: Tue, 09 Jun 2026 05:18:12 GMT
• Title: Experimental implementation of continuous-variable QAOA on a quad-rail lattice cluster state
• Abstract summary: We experimentally demonstrate the continuous-variable quantum approximate optimization algorithm (CV-QAOA) for multi-variable problems and multiple QAOA depths.<n>We show that increasing the depth from 1 to 2 improves performance, whereas further increases yield only limited gains.
• Score: 0.7481338856995555
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We experimentally demonstrate the continuous-variable quantum approximate optimization algorithm (CV-QAOA) for multi-variable problems and multiple QAOA depths using a measurement-based CV quantum computing platform on a quad-rail lattice (QRL) cluster state. We propose a systematic method to map arbitrary quadratic cost functions onto the QRL architecture and examine the resulting construction in settings involving up to 100 modes. Using the programmable platform, we prepare the CV-QAOA ansatz and optimize the variational parameters via Bayesian optimization. We then investigate the performance on quadratic optimization problems and observe that increasing the depth from 1 to 2 improves performance, whereas further increases yield only limited gains. In contrast, numerical simulations under idealized conditions, assuming an infinite number of measurement shots and gradient-based optimization, indicate that the performance of CV-QAOA can improve with increasing depth, suggesting that the experimentally observed limitations primarily arise from noise accumulation and classical optimization challenges. This work provides an experimental demonstration of CV-QAOA on a programmable CV platform and establishes a foundation for future developments of variational quantum algorithms in CV systems.

Related papers

• Comparing the Performance of Leading VQE Algorithms for Computing Ground-State Energies of Amino Acids [0.0]
  We present an integrated repository with reproducible benchmarks of over 10 different ansatzes from published papers.<n>We apply them to simulate different amino acids, using hamiltonians taken from the QMProt dataset.
  arXiv  Detail & Related papers  (2026-07-02T06:38:31Z)
• Beyond Outliers: A Study of Optimizers Under Quantization [82.75879062804955]
  We study impact of choice on model robustness under quantization.<n>We evaluate how model performance degrades when trained with different baselines.<n>We derive scaling laws for quantization-aware training under different parameters.
  arXiv  Detail & Related papers  (2025-09-27T21:15:22Z)
• Low Cost Bayesian Experimental Design for Quantum Frequency Estimation with Decoherence [45.74830585715129]
  We introduce WES: a Window Expansion Strategy for low cost adaptive Bayesian experimental design.<n>We employ empirical cost-reduction techniques to keep the optimization overhead low, curb scaling problems, and enable high degrees of parallelism.<n> Numerical simulations show that WES delivers the most reliable performance and fastest learning rate, saturating the Heisenberg limit.
  arXiv  Detail & Related papers  (2025-08-09T23:41:58Z)
• Optimization Strategies for Variational Quantum Algorithms in Noisy Landscapes [0.061173711613792085]
  Variational Quantum Algorithms (VQAs) are a leading approach for near-term quantum computing.<n>We benchmarked more than fifty metaheuristic algorithms for the Variational Quantumsolver (VQE)<n>Results identify a small set of resilient algorithms for noisy VQE and provide guidance for optimization strategies on near-term quantum devices.
  arXiv  Detail & Related papers  (2025-06-02T14:22:30Z)
• Branch-and-bound digitized counterdiabatic quantum optimization [39.58317527488534]
  Branch-and-bound algorithms effectively solve convex optimization problems, relying on the relaxation the objective function to obtain tight lower bounds.<n>We propose a branch-and-bound digitized counterdiabatic quantum optimization (BB-DCQO) algorithm that addresses the relaxation difficulties.
  arXiv  Detail & Related papers  (2025-04-21T18:19:19Z)
• Proactively incremental-learning QAOA [9.677961025372115]
  We propose an advanced Quantum Approximate Optimization Algorithm (QAOA) based on incremental learning. Our method has superior performance on Approximation Ratio (AR) and training time compared to prevalent works of QAOA.
  arXiv  Detail & Related papers  (2023-11-04T02:15:26Z)
• Soft Convex Quantization: Revisiting Vector Quantization with Convex Optimization [40.1651740183975]
  We propose Soft Convex Quantization (SCQ) as a direct substitute for Vector Quantization (VQ) SCQ works like a differentiable convex optimization (DCO) layer. We demonstrate its efficacy on the CIFAR-10, GTSRB and LSUN datasets.
  arXiv  Detail & Related papers  (2023-10-04T17:45:14Z)
• Q-FW: A Hybrid Classical-Quantum Frank-Wolfe for Quadratic Binary Optimization [44.96576908957141]
  We present a hybrid classical-quantum framework based on the Frank-Wolfe algorithm, Q-FW, for solving quadratic, linear iterations problems on quantum computers.
  arXiv  Detail & Related papers  (2022-03-23T18:00:03Z)
• Practical Continuous-variable Quantum Key Distribution with Feasible Optimization Parameters [19.571035318944674]
  Continuous-variable quantum key distribution (CV-QKD) offers an approach to achieve a potential high secret key rate (SKR) in metropolitan areas. Here, a systematic optimization method, combining the modulation variance and error correction matrix optimization, is proposed to improve the performance of a practical CV-QKD system. The results show that the SKR of a CV-QKD system can be improved by 24% and 200% compared with previous frequently used optimization methods theoretically with a transmission distance of 50 km.
  arXiv  Detail & Related papers  (2021-11-25T06:48:54Z)
• Machine Learning Framework for Quantum Sampling of Highly-Constrained, Continuous Optimization Problems [101.18253437732933]
  We develop a generic, machine learning-based framework for mapping continuous-space inverse design problems into surrogate unconstrained binary optimization problems. We showcase the framework's performance on two inverse design problems by optimizing thermal emitter topologies for thermophotovoltaic applications and (ii) diffractive meta-gratings for highly efficient beam steering.
  arXiv  Detail & Related papers  (2021-05-06T02:22:23Z)
• Empirical performance bounds for quantum approximate optimization [0.27998963147546135]
  Quantifying performance bounds provides insight into when QAOA may be viable for solving real-world applications. We find QAOA exceeds the Goemans-Williamson approximation ratio bound for most graphs. The resulting data set is presented as a benchmark for establishing empirical bounds on QAOA performance.
  arXiv  Detail & Related papers  (2021-02-12T23:12:09Z)
• Layer VQE: A Variational Approach for Combinatorial Optimization on Noisy Quantum Computers [5.644434841659249]
  We propose an iterative Layer VQE (L-VQE) approach, inspired by the Variational Quantum Eigensolver (VQE) We show that L-VQE is more robust to finite sampling errors and has a higher chance of finding the solution as compared with standard VQE approaches. Our simulation results show that L-VQE performs well under realistic hardware noise.
  arXiv  Detail & Related papers  (2021-02-10T16:53:22Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.