Light Cone Cancellation for Variational Quantum Eigensolver in Solving Noisy Max-Cut

[2404.19497] Light Cone Cancellation for Variational Quantum Eigensolver in Solving Noisy Max-Cut Skip to main content Search Submit Donate Log in Search arXiv Press Enter to search · Advanced search Quantum Physics arXiv:2404.19497 (quant-ph) [Submitted on 30 Apr 2024 ( v1 ), last revised 22 Sep 2025 (this version, v4)] Title: Light Cone Cancellation for Variational Quantum Eigensolver in Solving Noisy Max-Cut Authors: Xinwei Lee , Xinjian Yan , Ningyi Xie , Yoshiyuki Saito , Leo Kurosawa , Nobuyoshi Asai , Dongsheng Cai , Hoong Chuin LAU View a PDF of the paper titled Light Cone Cancellation for Variational Quantum Eigensolver in Solving Noisy Max-Cut, by Xinwei Lee and 6 other authors View PDF HTML (experimental) 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 reuslts 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. Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2404.19497 [quant-ph] (or arXiv:2404.19497v4 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2404.19497 Focus to learn more arXiv-issued DOI via DataCite Related DOI : https://doi.org/10.1038/s41598-025-31798-1 Focus to learn more DOI(s) linking to related resources Submission history From: Xinjian Yan [ view email ] [v1] Tue, 30 Apr 2024 12:31:03 UTC (672 KB) [v2] Mon, 9 Dec 2024 04:08:11 UTC (238 KB) [v3] Thu, 15 May 2025 06:50:44 UTC (760 KB) [v4] Mon, 22 Sep 2025 05:21:23 UTC (757 KB) Full-text links: Access Paper: View a PDF of the paper titled Light Cone Cancellation for Variational Quantum Eigensolver in Solving Noisy Max-Cut, by Xinwei Lee and 6 other authors View PDF HTML (experimental) TeX Source view license Current browse context: quant-ph < prev | next > new | recent | 2024-04 References & Citations INSPIRE HEP NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) scite.ai Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle Gotit.pub ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle TXYZ.AI ( What is TXYZ.AI? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs . Which authors of this paper are endorsers? | Disable MathJax ( What is MathJax? ) We gratefully acknowledge support from our major funders , member institutions , , and all contributors. About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab) Major funding support from

Related documents

• Quantum reality via late-time photodetection#498781
• Solving tricky quantum optics problems with assistance from (artificial) intelligence#141760
• High-Dimensional Carrier-Assisted Entanglement Purification Based on Mutually Unbiased Bases#973182
• Critical coupling with zero-mode corrections in discretized light-cone quantized $ϕ^4$ theory#1131630
• Classical and Quantum Speedups for Non-Convex Optimization via Energy Conserving Descent#13076