Abstract
Variational Quantum Eigensolver (VQE) is a quantum-classical hybrid algorithm used to estimate the ground energy of a given Hamiltonian. It consists of a parameterized quantum circuit, which the parameters are optimized using a classical optimizer. With the increasing need in solving large-scale problems in real-world applications, solving those large problems with fewer qubits and fewer gates becomes essential, so that we reduce the simulation difficulty and mitigate the effect of noise in real quantum hardware. In this study, we applied the Light Cone Cancellation (LCC) method to reduce the number of qubits and gates required in a two-local ansatz. LCC removes redundant gates that are not required in the calculation of the expectation value for a local observable. This leads to two consequences: 1) the quantum circuit used to create the trial wavefunction of VQE can be broken down into multiple quantum subcircuits with fewer qubits, enabling large-scale problems to be solved without actually simulating the entire circuit; and 2) reduced number of quantum gates in the circuit leads to the noise mitigation in quantum hardware. The main purpose of this work is to demonstrate the effectiveness of this method (called the LCC-VQE) in mitigating the device noise when solving the Max-Cut problem up to 100 qubits, using simulations on small (7-qubit and 27-qubit) fake noisy backends. Employing a single-layer two-local ansatz circuit architecture, the results show that LCC-VQE yields higher approximation ratios than those cases without LCC, implying that the effect of noise is mitigated when LCC is applied. An analysis of more than one layer of two-local ansatz is also performed, but empirical results show that the single-layer ansatz still performs the best among them. We also compare LCC-VQE under noiseless conditions with the Goemans-Williamson algorithm.
Similar content being viewed by others
Data availability
We provide the code that implements the LCC framework, along with the benchmark and simulation datasets used in this paper. These resources is publicly available at https://github.com/xenoicwyce/lcc.
References
Cerezo, M. et al. Variational quantum algorithms. Nat. Rev. Phys. 3, 625–644 (2021).
Farhi, E., Goldstone, J. & Gutmann, S. A quantum approximate optimization algorithm arXiv:arXiv:1411.4028 (2014).
Zhou, L., Wang, S.-T., Choi, S., Pichler, H. & Lukin, M. D. Quantum approximate optimization algorithm: Performance, mechanism, and implementation on near-term devices. Phys. Rev. X 10, 021067. https://doi.org/10.1103/PhysRevX.10.021067 (2020).
Cook, J., Eidenbenz, S. & Bärtschi, A. The quantum alternating operator ansatz on maximum k-vertex cover. 2020 IEEE International Conference on Quantum Computing and Engineering (QCE) 83–92 (2020).
Lee, X., Xie, N., Cai, D., Saito, Y. & Asai, N. A depth-progressive initialization strategy for quantum approximate optimization algorithm. Mathematics 11, 2176. https://doi.org/10.3390/math11092176 (2023).
Farhi, E., Goldstone, J., Gutmann, S. & Sipser, M. Quantum computation by adiabatic evolution arXiv:arXiv:quant-ph/0001106 (2000).
Sack, S. H. & Serbyn, M. Quantum annealing initialization of the quantum approximate optimization algorithm. Quantum 5, 491, https://doi.org/10.22331/q-2021-07-01-491 (2021).
Peruzzo, A. et al. A variational eigenvalue solver on a photonic quantum processor. Nat. Commun. 5, 4213 (2014).
Sim, S., Johnson, P. D. & Aspuru-Guzik, A. Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms. Adv. Quantum Technol. 2, https://doi.org/10.1002/qute.201900070 (2019).
Yan, X., Lee, X., Cai, D. & Asai, N. Comparison between the performances of general two-local ansatzes and qaoa in max-cut problem. IPSJ SIG Technical Report 2024-QS-11, 1–8 (2024).
Herrman, R., Lotshaw, P. C., Ostrowski, J., Humble, T. S. & Siopsis, G. Multi-angle quantum approximate optimization algorithm. Sci. Rep. 12, 6781 (2022).
Preskill, J. Quantum computing in the nisq era and beyond. Quantum 2, 79 https://doi.org/10.22331/q-2018-08-06-79 (2018).
Lowe, A. et al. Unified approach to data-driven quantum error mitigation. Phys. Rev. Res. 3, https://doi.org/10.1103/physrevresearch.3.033098 (2021).
Leone, L., Oliviero, S. F., Cincio, L. & Cerezo, M. On the practical usefulness of the hardware efficient ansatz. Quantum 8, 1395 (2024).
Pelofske, E., Bärtschi, A. & Eidenbenz, S. Short-depth qaoa circuits and quantum annealing on higher-order ising models. npj Quantum Inf. 10, 30, https://doi.org/10.1038/s41534-024-00825-w (2024).
Huang, C. et al. Efficient parallelization of tensor network contraction for simulating quantum computation. Nat. Comput. Sci. 1, 578–587. https://doi.org/10.1038/s43588-021-00119-7 (2021).
Lykov, D., Schutski, R., Galda, A., Vinokur, V. & Alexeev, Y. Tensor network quantum simulator with step-dependent parallelization. In 2022 IEEE International Conference on Quantum Computing and Engineering (QCE), 582–593, https://doi.org/10.1109/QCE53715.2022.00081 (2022).
Lykov, D. & Alexeev, Y. Importance of diagonal gates in tensor network simulations. In 2021 IEEE Computer Society Annual Symposium on VLSI (ISVLSI), 447–452, https://doi.org/10.1109/ISVLSI51109.2021.00088 (2021).
Vidal, G. Class of quantum many-body states that can be efficiently simulated. Phys. Rev. Lett. 101, https://doi.org/10.1103/physrevlett.101.110501 (2008).
Frías-Pérez, M. & Bañuls, M. C. Light cone tensor network and time evolution. Phys. Rev. B 106, https://doi.org/10.1103/physrevb.106.115117 (2022).
Haghshenas, R., Gray, J., Potter, A. C. & Chan, G. K.-L. Variational power of quantum circuit tensor networks. Phys. Rev. X 12, https://doi.org/10.1103/physrevx.12.011047 (2022).
Suzuki, Y., Sakuma, R. & Kawaguchi, H. Light-cone feature selection for quantum machine learning. Adv. Quantum Technol. 8 (6), 2400647. https://doi.org/10.1002/qute.202400647 (2025).
Goemans, M. X. & Williamson, D. P. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42, 1115–1145 (1995).
Karp, R. M. Reducibility among combinatorial problems. In 50 Years of Integer Programming 1958-2008: from the Early Years to the State-of-the-Art, 219–241 (Springer, 2009).
Jagannath, A., Ko, J. & Sen, S. Max \(\kappa\)-cut and the inhomogeneous potts spin glass. Ann. Appl. Probab. 28, 1536–1572 (2018).
Benedetti, M., Fiorentini, M. & Lubasch, M. Hardware-efficient variational quantum algorithms for time evolution. Phys. Rev. Res. 3, 033083 (2021).
Brandao, F. G. S. L., Broughton, M., Farhi, E., Gutmann, S. & Neven, H. For fixed control parameters the quantum approximate optimization algorithm’s objective function value concentrates for typical instances arXiv:arXiv:1812.04170 (2018).
Basso, J., Farhi, E., Marwaha, K., Villalonga, B. & Zhou, L. The quantum approximate optimization algorithm at high depth for maxcut on large-girth regular graphs and the sherrington-kirkpatrick model. https://doi.org/10.4230/LIPICS.TQC.2022.7 (Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022).
Wurtz, J. & Lykov, D. Fixed-angle conjectures for the quantum approximate optimization algorithm on regular maxcut graphs. Phys. Rev. A 104, 052419. https://doi.org/10.1103/PhysRevA.104.052419 (2021).
Galda, A., Liu, X., Lykov, D., Alexeev, Y. & Safro, I. Transferability of optimal qaoa parameters between random graphs. In 2021 IEEE International Conference on Quantum Computing and Engineering (QCE), 171–180 (IEEE, 2021).
Powell, M. J. D. A Direct Search Optimization Method That Models the Objective and Constraint Functions by Linear Interpolation, 51–67 (1994).
Javadi-Abhari, A. et al. Quantum computing with Qiskit, https://doi.org/10.48550/arXiv.2405.08810 (2024). arXiv:2405.08810.
Qiskit contributors. Qiskit: An open-source framework for quantum computing, https://doi.org/10.5281/zenodo.2573505 (2023).
Muñoz-Arias, M. H., Kourtis, S. & Blais, A. Low-depth clifford circuits approximately solve maxcut. Phys. Rev. Res. 6, 023294 (2024).
Vijendran, V., Das, A., Koh, D. E., Assad, S. M. & Lam, P. K. An expressive ansatz for low-depth quantum approximate optimisation. Quantum Sci. Technol. 9, 025010 (2024).
Gurobi Optimization, LLC. Gurobi Optimizer Reference Manual (2024).
Bravo-Montes, J. A., Bastante, M., Botella, G., del Barrio, A. & Garcia-Herrero, F. A methodology to select and adjust quantum noise models through emulators: benchmarking against real backends. EPJ Quantum Technol. 11, 71 (2024).
Piskor, T. et al. Simulation and benchmarking of real quantum hardware arXiv:2508.04483 (2025).
Weber, T., Borras, K., Jansen, K., Krücker, D. & Riebisch, M. Construction and volumetric benchmarking of quantum computing noise models. Phys. Scr. 99, 065106 (2024).
Maschek, S. R., Schwitalla, J., Franz, M. & Mauerer, W. Make some noise! measuring noise model quality in real-world quantum software. In 2025 IEEE International Conference on Quantum Software (QSW), 1–11, https://doi.org/10.1109/qsw67625.2025.00010 (IEEE, 2025).
Computing resources \(|\) ibm quantum platform. https://quantum.cloud.ibm.com/computers (2025).
Lee, X., Saito, Y. & Yan, X. LCC-Dataset (GitHub). https://github.com/xenoicwyce/lcc (2024).
Funding
This work was supported by JST SPRING, Grant Number JPMJSP2124 and by the National Research Foundation, Singapore under its Quantum Engineering Programme 2.0 (NRF2021-QEP2-02-P01).
Author information
Authors and Affiliations
Contributions
X. Lee contributed to the idea, devised the main experiment and analyzed the results. X. Yan conducted the experiments and prepared the materials (figures and tables) for the manuscript. N. Xie derived the mathematical formulation for LCC. Y. Saito and L. Kurosawa analyzed the results. N. Asai, D. Cai and H.C. LAU supervised the project and revised the manuscript. All authors reviewed the manuscript.
Corresponding authors
Ethics declarations
Competing interests
The authors declare no competing interests.
Additional information
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Supplementary Information
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Lee, X., Yan, X., Xie, N. et al. Light cone cancellation for variational quantum eigensolver in solving noisy Max-Cut. Sci Rep (2026). https://doi.org/10.1038/s41598-025-31798-1
Received:
Accepted:
Published:
DOI: https://doi.org/10.1038/s41598-025-31798-1
