Implementation of the Projective Quantum Eigensolver on a Quantum Computer

• URL: http://arxiv.org/abs/2310.04520v1
• Date: Fri, 6 Oct 2023 18:30:20 GMT
• Title: Implementation of the Projective Quantum Eigensolver on a Quantum Computer
• Authors: Jonathon P. Misiewicz and Francesco A. Evangelista
• Abstract summary: We study the performance of our previously proposed Projective Quantum Eigensolver (PQE) on IBM's quantum hardware. We find that we are able to obtain energies within 4 millihartree (2.5 kcal/mol) of the exact energy along the entire potential energy curve, with the accuracy limited by both error and inconsistent performance of the IBM devices.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study the performance of our previously proposed Projective Quantum Eigensolver (PQE) on IBM's quantum hardware in conjunction with error mitigation techniques. For a single qubit model of H$_2$, we find that we are able to obtain energies within 4 millihartree (2.5 kcal/mol) of the exact energy along the entire potential energy curve, with the accuracy limited by both stochastic error and inconsistent performance of the IBM devices. We find that an optimization algorithm using direct inversion of the iterative subspace can converge swiftly, even to excited states, but stochastic noise can cause large parameter updates. For the four-site transverse-field Ising model at the critical point, PQE with an appropriate application of qubit tapering can recover 99% of the correlation energy, even discarding several parameters. The large number of CNOT gates needed for the additional parameters introduces a concomitant error that, on the IBM devices, results in loss of accuracy, despite the increased expressivity of the trial state. Error extrapolation techniques and tapering or postselection are recommended to mitigate errors in PQE hardware experiments.

Related papers

• Error Mitigation of Fault-Tolerant Quantum Circuits with Soft Information [39.64742821341961]
  We show that Quantum error mitigation (QEM) can continue to provide substantial benefits in the era of quantum error correction (QEC)<n>We develop and analyze three logical-level QEM techniques: post-selection and runtime abort policies, probabilistic error cancellation, and zero-noise extrapolation.<n>Our techniques reduce logical error rates by more than 100x while discarding fewer than 0.1% of shots.
  arXiv  Detail & Related papers  (2025-12-10T17:49:06Z)
• Improving VQE Parameter Quality on Noisy Quantum Processors with Cost-Effective Readout Error Mitigation [0.0]
  This study examines the impact of error mitigation strategies on VQE performance.<n>We show that, for small molecular systems, an older-generation 5-qubit quantum processing unit (IBMQ Belem) achieves ground-state energy estimations an order of magnitude more accurate than those obtained from a more advanced 156-qubit device (IBM Fez) without error mitigation.<n>Our results point to the critical role of error mitigation in extending the utility of noisy quantum hardware for molecular simulations.
  arXiv  Detail & Related papers  (2025-08-20T21:14:22Z)
• Prospects of Quantum Error Mitigation for Quantum Signal Processing [0.0]
  This work explores the performance of zero-noise-extrapolation (ZNE) on a Hamiltonian simulation algorithm designed within quantum signal processing (QSP)<n>We quantify for which noise and depth regimes our ZNE protocol can recover an approximation of the noiseless expectation value.<n>We briefly discuss and present a numerical study on the region where ZNE is unusable, even given an unlimited sample budget.
  arXiv  Detail & Related papers  (2025-05-08T19:49:54Z)
• Extending Quantum Perceptrons: Rydberg Devices, Multi-Class Classification, and Error Tolerance [67.77677387243135]
  Quantum Neuromorphic Computing (QNC) merges quantum computation with neural computation to create scalable, noise-resilient algorithms for quantum machine learning (QML) At the core of QNC is the quantum perceptron (QP), which leverages the analog dynamics of interacting qubits to enable universal quantum computation.
  arXiv  Detail & Related papers  (2024-11-13T23:56:20Z)
• Quantum subspace expansion in the presence of hardware noise [0.0]
  Finding ground state energies on current quantum processing units (QPUs) continues to pose challenges. Hardware noise severely affects both the expressivity and trainability of parametrized quantum circuits. We show how to integrate VQE with a quantum subspace expansion, allowing for an optimal balance between quantum and classical computing capabilities and costs.
  arXiv  Detail & Related papers  (2024-04-14T02:48:42Z)
• Real-time error mitigation for variational optimization on quantum hardware [45.935798913942904]
  We define a Real Time Quantum Error Mitigation (RTQEM) algorithm to assist in fitting functions on quantum chips with VQCs. Our RTQEM routine can enhance VQCs' trainability by reducing the corruption of the loss function.
  arXiv  Detail & Related papers  (2023-11-09T19:00:01Z)
• Pre-optimizing variational quantum eigensolvers with tensor networks [1.4512477254432858]
  We present and benchmark an approach where we find good starting parameters for parameterized quantum circuits by simulating VQE. We apply this approach to the 1D and 2D Fermi-Hubbard model with system sizes that use up to 32 qubits. In 2D, the parameters that VTNE finds have significantly lower energy than their starting configurations, and we show that starting VQE from these parameters requires non-trivially fewer operations to come down to a given energy.
  arXiv  Detail & Related papers  (2023-10-19T17:57:58Z)
• Variational-quantum-eigensolver-inspired optimization for spin-chain work extraction [39.58317527488534]
  Energy extraction from quantum sources is a key task to develop new quantum devices such as quantum batteries. One of the main issues to fully extract energy from the quantum source is the assumption that any unitary operation can be done on the system. We propose an approach to optimize the extractable energy inspired by the variational quantum eigensolver (VQE) algorithm.
  arXiv  Detail & Related papers  (2023-10-11T15:59:54Z)
• Fast Flux-Activated Leakage Reduction for Superconducting Quantum Circuits [84.60542868688235]
  leakage out of the computational subspace arising from the multi-level structure of qubit implementations. We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation. We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
  arXiv  Detail & Related papers  (2023-09-13T16:21:32Z)
• Toward Consistent High-fidelity Quantum Learning on Unstable Devices via Efficient In-situ Calibration [5.0854551390284]
  In the near-term noisy intermediate-scale quantum (NISQ) era, high noise will significantly reduce the fidelity of quantum computing. In this paper, we propose a novel quantum pulse-based noise adaptation framework, namely QuPAD. Experiments show that the runtime on quantum devices of QuPAD with 8-10 qubits is less than 15 minutes, which is up to 270x faster than the parameter-shift approach.
  arXiv  Detail & Related papers  (2023-09-12T15:39:06Z)
• 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)
• Improved variational quantum eigensolver via quasi-dynamical evolution [0.0]
  The variational quantum eigensolver (VQE) is a hybrid quantum-classical algorithm designed for current and near-term quantum devices. There are problems with VQE that forbid a favourable scaling towards quantum advantage. We propose and extensively test a quantum annealing inspired algorithm that supplements VQE. The improved VQE avoids barren plateaus, exits local minima, and works with low-depth circuits.
  arXiv  Detail & Related papers  (2022-02-21T11:21:44Z)
• 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)
• The Cost of Improving the Precision of the Variational Quantum Eigensolver for Quantum Chemistry [0.0]
  We study how various types of errors affect the variational quantum eigensolver (VQE) We find that the optimal way of running the hybrid classical-quantum optimization is to allow some noise in intermediate energy evaluations.
  arXiv  Detail & Related papers  (2021-11-09T06:24:52Z)
• Bosonic field digitization for quantum computers [62.997667081978825]
  We address the representation of lattice bosonic fields in a discretized field amplitude basis. We develop methods to predict error scaling and present efficient qubit implementation strategies.
  arXiv  Detail & Related papers  (2021-08-24T15:30:04Z)

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.