Near-term quantum algorithm for solving the MaxCut problem with fewer quantum resources
Authors:
- Xiumei ZhaoXZXiumei Zhao
- Yongmei LiYLYongmei Li
- Jing LiJLJing Li
- Shasha WangSWShasha Wang
- Song WangSWSong Wang
- Sujuan QinSQSujuan Qin
- Fei GaoFGFei Gao
- 17 July 2024
- journal article
- research article
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 648
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China
- Beijing Natural Science Foundation
This publication has 64 references indexed in Scilit:
- Multilevel Leapfrogging Initialization Strategy for Quantum Approximate Optimization AlgorithmAdvanced Quantum Technologies, 2024
- A quantum federated learning framework for classical clientsScience China Physics, Mechanics & Astronomy, 2024
- Quantum Algorithm for Anomaly Detection of SequencesAdvanced Quantum Technologies, 2023
- A Quantum Algorithm for Solving Eigenproblem of the Laplacian Matrix of a Fully Connected Weighted GraphAdvanced Quantum Technologies, 2023
- Quantum discriminative canonical correlation analysisQuantum Information Processing, 2023
- Novel quantum circuit implementation of Advanced Encryption Standard with low costsScience China Physics, Mechanics & Astronomy, 2022
- Quantum algorithms for anomaly detection using amplitude estimationPhysica A: Statistical Mechanics and its Applications, 2022
- An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problemMathematical Programming, 2009
- Semidefinite programming in combinatorial optimizationMathematical Programming, 1997
- On a positive semidefinite relaxation of the cut polytopeLinear Algebra and its Applications, 1995