Estimation of Quantum Fisher Information via Stein's Identity in Variational Quantum Algorithms

• URL: http://arxiv.org/abs/2502.17231v2
• Date: Fri, 11 Jul 2025 17:57:25 GMT
• Title: Estimation of Quantum Fisher Information via Stein's Identity in Variational Quantum Algorithms
• Authors: Mourad Halla,
• Abstract summary: The Quantum Fisher Information Matrix (QFIM) plays a crucial role in quantum optimization algorithms.<n> computing the full QFIM incurs a quadratic computational cost of O(d2) with respect to the number of parameters d.<n>We propose an alternative estimation framework based on Stein's identity that also achieves constant computational complexity.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The Quantum Fisher Information Matrix (QFIM) plays a crucial role in quantum optimization algorithms such as Variational Quantum Imaginary Time Evolution and Quantum Natural Gradient Descent. However, computing the full QFIM incurs a quadratic computational cost of O(d^2) with respect to the number of parameters d, limiting its scalability for high-dimensional quantum systems. To address this limitation, stochastic methods such as the Simultaneous Perturbation Stochastic Approximation (SPSA) have been employed to reduce computational complexity to a constant (Quantum 5, 567 (2021)). In this work, we propose an alternative estimation framework based on Stein's identity that also achieves constant computational complexity. Furthermore, our method reduces the quantum resources required for QFIM estimation compared to the SPSA approach. We provide numerical examples using the transverse-field Ising model and the lattice Schwinger model to demonstrate the feasibility of applying our method to realistic quantum systems.

Related papers

• An Introduction to Variational Quantum Eigensolver Applied to Chemistry [0.0]
  Variational Quantum Algorithms (VQAs) stand out as a feasible approach to demonstrating advantages over classical methods in the near term.<n>We present the application of quantum mechanics to the study of molecules, provide an introduction to the fundamentals of quantum computing, and explore the integration of these fields by employing the VQE in molecular simulations.
  arXiv  Detail & Related papers  (2025-05-07T19:46:15Z)
• Quantum natural gradient with thermal-state initialization [3.481985817302898]
  We provide exact methods to compute three quantum generalizations of the Fisher information matrix-the Fisher-Bures, Wigner-Yanase, and Kubo-Mori information matrix-for PQCs with thermal states.<n>We prove that these matrix elements can be estimated using quantum algorithms combining the Hadamard test, classical random sampling, and Hamiltonian simulation.
  arXiv  Detail & Related papers  (2025-02-26T19:00:05Z)
• Quantum Simulation for Dynamical Transition Rates in Open Quantum Systems [0.0]
  We introduce a novel and efficient quantum simulation method to compute dynamical transition rates in Markovian open quantum systems.<n>Our new approach holds the potential to surpass the bottlenecks of current quantum chemical research.
  arXiv  Detail & Related papers  (2024-12-23T02:53:05Z)
• Sample-Efficient Estimation of Nonlinear Quantum State Functions [5.641998714611475]
  We introduce the quantum state function (QSF) framework by extending the SWAP test via linear combination of unitaries and parameterized quantum circuits.<n>Our framework enables the implementation of arbitrarily normalized degree-$n$ functions of quantum states with precision.<n>We apply QSF for developing quantum algorithms for fundamental tasks, including entropy, fidelity, and eigenvalue estimations.
  arXiv  Detail & Related papers  (2024-12-02T16:40:17Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Quantum Natural Stochastic Pairwise Coordinate Descent [6.187270874122921]
  Quantum machine learning through variational quantum algorithms (VQAs) has gained substantial attention in recent years. This paper introduces the quantum natural pairwise coordinate descent (2QNSCD) optimization method. We develop a highly sparse unbiased estimator of the novel metric tensor using a quantum circuit with gate complexity $Theta(1)$ times that of the parameterized quantum circuit and single-shot quantum measurements.
  arXiv  Detail & Related papers  (2024-07-18T18:57:29Z)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• Solving reaction dynamics with quantum computing algorithms [42.408991654684876]
  We study quantum algorithms for response functions, relevant for describing different reactions governed by linear response.<n>We focus on nuclear-physics applications and consider a qubit-efficient mapping on the lattice, which can efficiently represent the large volumes required for realistic scattering simulations.
  arXiv  Detail & Related papers  (2024-03-30T00:21:46Z)
• Low-Rank Variational Quantum Algorithm for the Dynamics of Open Quantum Systems [0.5120567378386615]
  A variational quantum algorithm is developed to simulate the real-time evolution of the density matrix governed by the Lindblad master equation.<n>The algorithm encodes each pure state of the statistical mixture as a parametrized quantum circuit.<n>Two variational Ans"atze are proposed, and their effectiveness is assessed in the simulation of the dynamics of a 2D dissipative transverse field Ising model.
  arXiv  Detail & Related papers  (2024-03-09T13:23:14Z)
• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)
• 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)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• Resource-efficient encoding algorithm for variational bosonic quantum simulations [0.0]
  In the Noisy Intermediate Scale Quantum (NISQ) era of quantum computing, quantum resources are limited. We present a resource-efficient quantum algorithm for bosonic ground and excited state computations.
  arXiv  Detail & Related papers  (2021-02-23T19:00:05Z)
• Quantum Computation of Finite-Temperature Static and Dynamical Properties of Spin Systems Using Quantum Imaginary Time Evolution [0.0]
  We develop scalable quantum algorithms to study finite-temperature physics of quantum many-body systems. Our work demonstrates that the ansatz-independent QITE algorithm is capable of computing diverse finite-temperature observables on near-term quantum devices.
  arXiv  Detail & Related papers  (2020-09-08T06:49:08Z)
• Classical variational simulation of the Quantum Approximate Optimization Algorithm [0.0]
  We introduce a method to simulate layered quantum circuits consisting of parametrized gates. A neural-network parametrization of the many-qubit wave function is used. For the largest circuits simulated, we reach 54 qubits at 4 QAOA layers.
  arXiv  Detail & Related papers  (2020-09-03T15:55:27Z)

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.