Reducing the Resources Required by ADAPT-VQE Using Coupled Exchange Operators and Improved Subroutines

• URL: http://arxiv.org/abs/2407.08696v3
• Date: Mon, 12 May 2025 17:35:24 GMT
• Title: Reducing the Resources Required by ADAPT-VQE Using Coupled Exchange Operators and Improved Subroutines
• Authors: Mafalda Ramôa, Panagiotis G. Anastasiou, Luis Paulo Santos, Nicholas J. Mayhall, Edwin Barnes, Sophia E. Economou,
• Abstract summary: We show the cost of running state-of-the-art ADAPT-VQE on hardware in terms of measurement counts and circuit depth.<n>We also find that our state-of-the-art CEO-ADAPT-VQE outperforms the Unitary Coupled Cluster Singles and Doubles ansatz.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Adaptive variational quantum algorithms arguably offer the best prospects for quantum advantage in the Noisy Intermediate-Scale Quantum era. Since the inception of the first such algorithm, the Adaptive Derivative-Assembled Problem-Tailored Variational Quantum Eigensolver (ADAPT-VQE), many improvements have appeared in the literature. We combine the key improvements along with a novel operator pool -- which we term Coupled Exchange Operator (CEO) pool -- to assess the cost of running state-of-the-art ADAPT-VQE on hardware in terms of measurement counts and circuit depth. We show a dramatic reduction of these quantum computational resources compared to the early versions of the algorithm: CNOT count, CNOT depth and measurement costs are reduced by up to 88%, 96% and 99.6%, respectively, for molecules represented by 12 to 14 qubits (LiH, H6 and BeH2). We also find that our state-of-the-art CEO-ADAPT-VQE outperforms the Unitary Coupled Cluster Singles and Doubles ansatz, the most widely used static VQE ansatz, in all relevant metrics, and offers a five order of magnitude decrease in measurement costs as compared to other static ans\"atze with competitive CNOT counts.

Related papers

• A Neural-Guided Variational Quantum Algorithm for Efficient Sign Structure Learning in Hybrid Architectures [11.258303973058377]
  Variational quantum algorithms hold great promise for unlocking the power of near-term quantum processors.<n>Here, we introduce sVQNHE, a neural-guided variational quantum algorithm that decouples amplitude and sign learning across classical and quantum modules.<n>This hybrid quantum-classical synergy not only reduces measurement costs but also achieves high expressivity with limited quantum resources.
  arXiv  Detail & Related papers  (2025-07-10T08:54:49Z)
• Variational Quantum Algorithms in the era of Early Fault Tolerance [2.7899834802862284]
  Quantum computing roadmaps predict the availability of 10,000 qubit devices within the next 3-5 years.<n>We introduce partial error correction (pQEC), a strategy that error-corrects Clifford operations while performing Rz rotations via magic state injection.<n>Our results show that pQEC can improve VQA fidelities by 9.27x over standard approaches.
  arXiv  Detail & Related papers  (2025-03-26T20:06:32Z)
• Non-unitary Variational Quantum Eigensolver with the Localized Active Space Method and Cost Mitigation [0.33923727961771083]
  Hardware-efficient localized active space self-consistent field (SCFS) approximates complete active space self-consistent field (CFF)<n>HEA offer affordable and shallower circuits, yet they often fail to capture the necessary correlation.<n>LAS-nuVQE is shown to recover interfragment correlations, reach chemical accuracy with a small number of gates (70) in both H4 and square cyclobutadiene.
  arXiv  Detail & Related papers  (2025-01-23T04:18:57Z)
• Reclaiming Residual Knowledge: A Novel Paradigm to Low-Bit Quantization [41.94295877935867]
  This paper explores a novel paradigm in low-bit (i.e. 4-bits or lower) quantization, by framing optimal quantization as an architecture search problem within convolutional neural networks (ConvNets) Our framework, dubbed textbfCoRa, searches for the optimal architectures of low-rank adapters. textbfCoRa achieves comparable performance against both state-of-the-art quantization-aware training and post-training quantization baselines.
  arXiv  Detail & Related papers  (2024-08-01T21:27:31Z)
• Efficient DCQO Algorithm within the Impulse Regime for Portfolio Optimization [41.94295877935867]
  We propose a faster digital quantum algorithm for portfolio optimization using the digitized-counterdiabatic quantum optimization (DCQO) paradigm. Our approach notably reduces the circuit depth requirement of the algorithm and enhances the solution accuracy, making it suitable for current quantum processors. We experimentally demonstrate the advantages of our protocol using up to 20 qubits on an IonQ trapped-ion quantum computer.
  arXiv  Detail & Related papers  (2023-08-29T17:53:08Z)
• Benchmarking Adaptative Variational Quantum Algorithms on QUBO Instances [0.0]
  Adaptative VQAs dynamically modify the circuit structure by adding and removing, and optimize their parameters during the training. We analyze three Adaptative VQAs: Variational Quantum Eigensolver (EVQE), Variable Ansatz (VAns), and Random Adapt-VQE (RA-VQE), a random approach we introduce as a baseline. Our analysis sets benchmarks for Adaptative VQAs designed for near-term quantum devices.
  arXiv  Detail & Related papers  (2023-08-03T14:39:02Z)
• Weight Re-Mapping for Variational Quantum Algorithms [54.854986762287126]
  We introduce the concept of weight re-mapping for variational quantum circuits (VQCs) We employ seven distinct weight re-mapping functions to assess their impact on eight classification datasets. Our results indicate that weight re-mapping can enhance the convergence speed of the VQC.
  arXiv  Detail & Related papers  (2023-06-09T09:42:21Z)
• Error Mitigation-Aided Optimization of Parameterized Quantum Circuits: Convergence Analysis [42.275148861039895]
  Variational quantum algorithms (VQAs) offer the most promising path to obtaining quantum advantages via noisy processors. gate noise due to imperfections and decoherence affects the gradient estimates by introducing a bias. Quantum error mitigation (QEM) techniques can reduce the estimation bias without requiring any increase in the number of qubits. QEM can reduce the number of required iterations, but only as long as the quantum noise level is sufficiently small.
  arXiv  Detail & Related papers  (2022-09-23T10:48:04Z)
• TETRIS-ADAPT-VQE: An adaptive algorithm that yields shallower, denser circuit ans\"atze [0.0]
  We introduce an algorithm called TETRIS-ADAPT-VQE, which iteratively builds up variational ans"atze a few operators at a time. It results in denser but significantly shallower circuits, without increasing the number of CNOT gates or variational parameters. These improvements bring us closer to the goal of demonstrating a practical quantum advantage on quantum hardware.
  arXiv  Detail & Related papers  (2022-09-21T18:00:02Z)
• On quantum factoring using noisy intermediate scale quantum computers [0.0]
  We show better chance of finding the ground state when using VQE rather than QAOA for optimization. In gradient-based optimization we find that the time required for quantum circuit gradient estimation is a significant problem.
  arXiv  Detail & Related papers  (2022-08-15T09:32:07Z)
• Theoretical Error Performance Analysis for Variational Quantum Circuit Based Functional Regression [83.79664725059877]
  In this work, we put forth an end-to-end quantum neural network, namely, TTN-VQC, for dimensionality reduction and functional regression. We also characterize the optimization properties of TTN-VQC by leveraging the Polyak-Lojasiewicz (PL) condition.
  arXiv  Detail & Related papers  (2022-06-08T06:54:07Z)
• Adiabatic Quantum Computing for Multi Object Tracking [170.8716555363907]
  Multi-Object Tracking (MOT) is most often approached in the tracking-by-detection paradigm, where object detections are associated through time. As these optimization problems are often NP-hard, they can only be solved exactly for small instances on current hardware. We show that our approach is competitive compared with state-of-the-art optimization-based approaches, even when using of-the-shelf integer programming solvers.
  arXiv  Detail & Related papers  (2022-02-17T18:59:20Z)
• Scaling Quantum Approximate Optimization on Near-term Hardware [49.94954584453379]
  We quantify scaling of the expected resource requirements by optimized circuits for hardware architectures with varying levels of connectivity. We show the number of measurements, and hence total time to synthesizing solution, grows exponentially in problem size and problem graph degree. These problems may be alleviated by increasing hardware connectivity or by recently proposed modifications to the QAOA that achieve higher performance with fewer circuit layers.
  arXiv  Detail & Related papers  (2022-01-06T21:02:30Z)
• Quantum circuit architecture search on a superconducting processor [56.04169357427682]
  Variational quantum algorithms (VQAs) have shown strong evidences to gain provable computational advantages for diverse fields such as finance, machine learning, and chemistry. However, the ansatz exploited in modern VQAs is incapable of balancing the tradeoff between expressivity and trainability. We demonstrate the first proof-of-principle experiment of applying an efficient automatic ansatz design technique to enhance VQAs on an 8-qubit superconducting quantum processor.
  arXiv  Detail & Related papers  (2022-01-04T01:53:42Z)
• Efficient Parabolic Optimisation Algorithm for adaptive VQE implementations [0.0]
  Variational Quantum Eigensolver (VQE) is one of the most promising applications of quantum computing. We introduce the parabolic optimiser that we designed specifically for the needs of VQE.
  arXiv  Detail & Related papers  (2021-10-25T09:36:56Z)
• Avoiding symmetry roadblocks and minimizing the measurement overhead of adaptive variational quantum eigensolvers [0.0]
  Quantum simulation of strongly correlated systems is potentially the most feasible useful application of near-term quantum computers. A promising class of algorithms for this purpose consists of variational quantum eigensolvers (VQEs) Here, we show that this overhead can be reduced to an amount that grows only linearly with the number $n$ of qubits, instead of quartically as in the original ADAPT-VQE.
  arXiv  Detail & Related papers  (2021-09-11T18:53:27Z)
• An investigation of IBM Quantum Computing device performance on Combinatorial Optimisation Problems [0.0]
  This paper juxtaposes classical and quantum optimisation algorithms' performance to solve two common COP, the Travelling Salesman Problem (TSP) and the Quadratic Assignment Problem (QAP) Two accepted classical optimisation methods, Branch and Bound (BNB) and Simulated Annealing (SA), are compared to two quantum optimisation methods, Variational Quantum Eigensolver (VQE) algorithm and Quantum Approximate optimisation Algorithm (QAOA) Our results show that the VQE performs better than QAOA for these metrics, and we infer that this is due to the increased number of operations required.
  arXiv  Detail & Related papers  (2021-07-08T07:02:50Z)
• Efficient measure for the expressivity of variational quantum algorithms [72.59790225766777]
  We exploit an advanced tool in statistical learning theory, i.e., covering number, to study the expressivity of variational quantum algorithms. We first exhibit how the expressivity of VQAs with an arbitrary ansatze is upper bounded by the number of quantum gates and the measurement observable. We then explore the expressivity of VQAs on near-term quantum chips, where the system noise is considered.
  arXiv  Detail & Related papers  (2021-04-20T13:51:08Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
  Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-05-11T17:20:51Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.