Implementation of Measurement Reduction for the Variational Quantum Eigensolver

• URL: http://arxiv.org/abs/2012.02765v2
• Date: Wed, 28 Jul 2021 17:33:51 GMT
• Title: Implementation of Measurement Reduction for the Variational Quantum Eigensolver
• Abstract summary: Unitary partitioning reduces overhead by transforming the problem Hamiltonian into one containing fewer terms. To our knowledge, this work also demonstrates the first experimental implementation of LCU on quantum hardware.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: One limitation of the variational quantum eigensolver algorithm is the large number of measurement steps required to estimate different terms in the Hamiltonian of interest. Unitary partitioning reduces this overhead by transforming the problem Hamiltonian into one containing fewer terms. We explore two different circuit constructions of the transformation required - one built by a sequence of rotations and the other a linear combination of unitaries (LCU). To assess performance, we simulated chemical Hamiltonians and studied the ground states of H2 and LiH. Both implementations are successful even in the presence of noise. The sequence of rotations realization offers the greatest benefit to calculations, whereas the probabilistic nature of LCU reduces its effectiveness. To our knowledge, this work also demonstrates the first experimental implementation of LCU on quantum hardware.

Related papers

• Signatures of quantum noise in the operation of Deutsch's algorithm [0.0]
  We study how quantum properties of an environment manifest themselves in results that can be obtained on quantum computers.<n>We find that a single run of the algorithm yields the same effect in both cases, but running the algorithm twice leads to stark differences.<n>We present results obtained on one of the IBM Quantum processors, which fully reproduce the predicted effect regardless of the assumptions made in the derivation.
  arXiv  Detail & Related papers  (2026-05-18T19:13:03Z)
• Randomized Quantum Singular Value Transformation [18.660349597156266]
  We introduce the first randomized algorithms for Quantum Singular Value Transformation (QSVT)<n>Standard implementations of QSVT rely on block encodings of the Hamiltonian, requiring a logarithmic number of ancilla qubits, intricate multi-qubit control, and circuit depth scaling linearly with the number of Hamiltonian terms.<n>Our algorithms use only a single ancilla qubit and entirely avoid block encodings.
  arXiv  Detail & Related papers  (2025-10-08T10:14:15Z)
• Variational Quantum Algorithm for Solving the Liouvillian Gap [0.0]
  In open quantum systems, the Liouvillian gap characterizes the relaxation time toward the steady state.<n>We propose a variational quantum algorithm for efficiently estimating the Liouvillian gap.
  arXiv  Detail & Related papers  (2025-05-22T05:59:55Z)
• Variational Quantum Subspace Construction via Symmetry-Preserving Cost Functions [39.58317527488534]
  We propose a variational strategy based on symmetry-preserving cost functions to iteratively construct a reduced subspace for extraction of low-lying energy states.<n>As a proof of concept, we test the proposed algorithms on H4 chain and ring, targeting both the ground-state energy and the charge gap.
  arXiv  Detail & Related papers  (2024-11-25T20:33:47Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• 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)
• Forward and Backward Constrained Bisimulations for Quantum Circuits using Decision Diagrams [3.788308836856851]
  We develop efficient methods for the simulation of quantum circuits on classic computers. In particular, we show that constrained bisimulation can boost decision-diagram-based quantum circuit simulation by several orders of magnitude.
  arXiv  Detail & Related papers  (2023-08-18T12:40:47Z)
• Applicability of Measurement-based Quantum Computation towards Physically-driven Variational Quantum Eigensolver [17.975555487972166]
  Variational quantum algorithms are considered one of the most promising methods for obtaining near-term quantum advantages. The roadblock to developing quantum algorithms with the measurement-based quantum computation scheme is resource cost. We propose an efficient measurement-based quantum algorithm for quantum many-body system simulation tasks, called measurement-based Hamiltonian variational ansatz (MBHVA)
  arXiv  Detail & Related papers  (2023-07-19T08:07:53Z)
• Resource-frugal Hamiltonian eigenstate preparation via repeated quantum phase estimation measurements [0.0]
  Preparation of Hamiltonian eigenstates is essential for many applications in quantum computing. We adopt ideas from variants of this method to implement a resource-frugal iterative scheme. We characterise an extension involving a modification of the target Hamiltonian to increase overall efficiency.
  arXiv  Detail & Related papers  (2022-12-01T20:07:36Z)
• Efficient Quantum Analytic Nuclear Gradients with Double Factorization [0.0]
  We report a Lagrangian-based approach for evaluating relaxed one- and two-particle reduced density matrices from double factorized Hamiltonians. We demonstrate the accuracy and feasibility of our Lagrangian-based approach to recover all off-diagonal density matrix elements in classically-simulated examples.
  arXiv  Detail & Related papers  (2022-07-26T18:47:48Z)
• Variational determination of arbitrarily many eigenpairs in one quantum circuit [8.118991737495524]
  A variational quantum eigensolver (VQE) was first introduced for computing ground states. We propose a new algorithm to determine many low energy eigenstates simultaneously. Our algorithm reduces significantly the complexity of circuits and the readout errors.
  arXiv  Detail & Related papers  (2022-06-22T13:01:37Z)
• Quantum algorithms for grid-based variational time evolution [36.136619420474766]
  We propose a variational quantum algorithm for performing quantum dynamics in first quantization. Our simulations exhibit the previously observed numerical instabilities of variational time propagation approaches.
  arXiv  Detail & Related papers  (2022-03-04T19:00:45Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• A posteriori corrections to the Iterative Qubit Coupled Cluster method to minimize the use of quantum resources in large-scale calculations [0.0]
  We present a variety of a posteriori corrections to the iQCC energies to reduce the number of iterations to achieve the desired accuracy. We demonstrate the utility and efficiency of our approach numerically on the examples of 10-qubit N$$ molecule, the 24-qubit H$$O stretch, and 56-qubit singlet-triplet gap calculations.
  arXiv  Detail & Related papers  (2020-09-28T20:57:32Z)
• 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.