相关论文: Convergence of Digitized-Counterdiabatic QAOA: cir…
Quantum Approximate Optimization Algorithm (QAOA) is one of the fundamental variational quantum algorithms, while a version of QAOA that includes counterdiabatic driving, termed Digitized Counterdiabatic QAOA (DC-QAOA), is generally…
We introduce a counterdiabatic (CD) extension of the Quantum Approximate Optimization Algorithm (QAOA) for constrained portfolio optimization. By incorporating approximate adiabatic gauge potentials generated from nested commutators of the…
The quantum approximate optimization algorithm (QAOA) has proved to be an effective classical-quantum algorithm serving multiple purposes, from solving combinatorial optimization problems to finding the ground state of many-body quantum…
The quantum approximate optimization algorithm (QAOA) is a near-term hybrid algorithm intended to solve combinatorial optimization problems, such as MaxCut. QAOA can be made to mimic an adiabatic schedule, and in the $p\to\infty$ limit the…
Solving optimization tasks using variational quantum algorithms has emerged as a crucial application of the current noisy intermediate-scale quantum devices. However, these algorithms face several difficulties like finding suitable ansatz…
Recently, digitized-counterdiabatic (CD) corrections to the quantum approximate optimization algorithm (QAOA) have been proposed, yielding faster convergence within the desired accuracy than standard QAOA. In this manuscript, we apply this…
The bin packing problem, a classical NP-hard combinatorial optimization challenge, has emerged as a promising candidate for quantum computing applications. In this work, we address the one-dimensional bin packing problem (1dBPP) using a…
The Quantum Approximate Optimization Algorithm (QAOA) is a promising approach for programming a near-term gate-based hybrid quantum computer to find good approximate solutions of hard combinatorial problems. However, little is currently…
The Quantum Approximate Optimization Algorithm (QAOA) is a quantum-classical hybrid algorithm intending to find the ground state of a target Hamiltonian. Theoretically, QAOA can obtain the approximate solution if the quantum circuit is deep…
Quantum Approximate Optimization Algorithm (QAOA) is a promising hybrid quantum-classical algorithm for solving combinatorial optimization problems. However, it cannot overcome qubit limitation for large-scale problems. Furthermore, the…
We consider digitized-counterdiabatic quantum computing as an advanced paradigm to approach quantum advantage for industrial applications in the NISQ era. We apply this concept to investigate a discrete mean-variance portfolio optimization…
Quantum Approximate Optimization Algorithm (QAOA) is a hybrid algorithm whose control parameters are classically optimized. In addition to the variational parameters, the right choice of hyperparameter is crucial for improving the…
The Quantum Approximate Optimization Algorithm (QAOA) has emerged as a promising approach for solving NP hard combinatorial optimization problems on noisy intermediate-scale quantum (NISQ) hardware. However, its performance is critically…
Molecular docking is a critical process for drug discovery and challenging due to the complexity and size of biomolecular systems, where the optimal binding configuration of a drug to a target protein is determined. Hybrid classical-quantum…
The Quantum Approximate Optimization Algorithm (QAOA) is a hybrid quantum-classical variational algorithm designed to tackle combinatorial optimization problems. Despite its promise for near-term quantum applications, not much is currently…
The Quantum Approximate Optimization Algorithm (QAOA) exhibits significant potential for tackling combinatorial optimization problems. Despite its promise for near-term quantum devices, a major challenge in applying QAOA lies in the cost of…
The quantum approximate optimization algorithm (QAOA) is a hybrid variational quantum-classical algorithm that solves combinatorial optimization problems. While there is evidence suggesting that the fixed form of the standard QAOA ansatz is…
The quantum approximate optimization algorithm (QAOA) generates an approximate solution to combinatorial optimization problems using a variational ansatz circuit defined by parameterized layers of quantum evolution. In theory, the…
Quantum computers are expected to offer significant advantages in solving complex optimization problems that are challenging for classical computers. Quadratic Unconstrained Binary Optimization (QUBO) problems represent an important class…
We introduce a novel quantum optimization paradigm: the Fixed-Parameter-Count Quantum Approximate Optimization Algorithm (FPC-QAOA). It is a scalable variational framework that maintains a constant number of trainable parameters regardless…