Your browser doesn't support javascript.
loading
Show: 20 | 50 | 100
Results 1 - 2 de 2
Filter
Add more filters










Database
Language
Publication year range
1.
Sci Rep ; 14(1): 16011, 2024 Jul 11.
Article in English | MEDLINE | ID: mdl-38992152

ABSTRACT

The Quantum Approximate Optimization Algorithm (QAOA) is a variational quantum algorithm for Near-term Intermediate-Scale Quantum computers (NISQ) providing approximate solutions for combinatorial optimization problems. The QAOA utilizes a quantum-classical loop, consisting of a quantum ansatz and a classical optimizer, to minimize some cost function, computed on the quantum device. This paper presents an investigation into the impact of realistic noise on the classical optimizer and the determination of optimal circuit depth for the Quantum Approximate Optimization Algorithm (QAOA) in the presence of noise. We find that, while there is no significant difference in the performance of classical optimizers in a state vector simulation, the Adam and AMSGrad optimizers perform best in the presence of shot noise. Under the conditions of real noise, the SPSA optimizer, along with ADAM and AMSGrad, emerge as the top performers. The study also reveals that the quality of solutions to some 5 qubit minimum vertex cover problems increases for up to around six layers in the QAOA circuit, after which it begins to decline. This analysis shows that increasing the number of layers in the QAOA in an attempt to increase accuracy may not work well in a noisy device.

2.
Sci Rep ; 14(1): 2422, 2024 Jan 29.
Article in English | MEDLINE | ID: mdl-38287087

ABSTRACT

Quantum computers offer significant potential for complex system analysis, yet their application in large systems is hindered by limitations such as qubit availability and quantum hardware noise. While the variational quantum eigensolver (VQE) was proposed to address these issues, its scalability remains limited. Many efforts, including new ansätze and Hamiltonian modifications, have been made to overcome these challenges. In this work, we introduced the novel Fragment Molecular Orbital/Variational Quantum Eigensolver (FMO/VQE) algorithm. This method combines the fragment molecular orbital (FMO) approach with VQE and efficiently utilizes qubits for quantum chemistry simulations. Employing the UCCSD ansatz, the FMO/VQE achieved an absolute error of just 0.053 mHa with 8 qubits in a [Formula: see text] system using the STO-3G basis set, and an error of 1.376 mHa with 16 qubits in a [Formula: see text] system with the 6-31G basis set. These results indicated a significant advancement in scalability over conventional VQE, maintaining accuracy with fewer qubits. Therefore, our FMO/VQE method exemplifies how integrating fragment-based quantum chemistry with quantum algorithms can enhance scalability, facilitating more complex molecular simulations and aligning with quantum computing advancements.

SELECTION OF CITATIONS
SEARCH DETAIL
...