Efficient protocol to estimate the Quantum Fisher Information Matrix for Commuting-Block Circuits

• URL: http://arxiv.org/abs/2505.09818v1
• Date: Wed, 14 May 2025 21:37:04 GMT
• Title: Efficient protocol to estimate the Quantum Fisher Information Matrix for Commuting-Block Circuits
• Authors: Rafael Gómez-Lurbe,
• Abstract summary: We introduce a novel protocol for computing the off-block-diagonal elements of the Quantum Fisher Information Matrix QFIM.<n>Our approach significantly reduces the quantum resources required, specifically lowering the number of distinct quantum state preparations.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The Quantum Fisher Information Matrix (QFIM) is a fundamental quantity in various subfields of quantum physics. It plays a crucial role in the study of parameterized quantum states, as it quantifies their sensitivity to variations in its parameters. Recently, the QFIM has been successfully employed to enhance the optimization of variational quantum algorithms. However, its practical applicability is often hindered by the high resource requirements for its estimation. In this work, we introduce a novel protocol for computing the off-block-diagonal elements of the QFIM between different layers in a particular class of variational quantum circuits, known as commuting-block circuits. Our approach significantly reduces the quantum resources required, specifically lowering the number of distinct quantum state preparations from $O(m^2)$ to $O(L^2)$, where $m$ is the total number of parameters and $L$ is the number of layers in the circuit. Consequently, our protocol also minimizes the number of classical measurements and post-processing operations needed to estimate the QFIM, leading to a substantial improvement in computational efficiency.

Related papers

• Differential equation quantum solvers: engineering measurements to reduce cost [0.6554326244334868]
  Two sample-efficient protocols are tested for solving non-linear differential equations.<n>We report up to $sim$ 100 fold reductions in circuit evaluations.<n>Our protocols thus hold the promise to unlock larger and more challenging non-linear differential equation demonstrations.
  arXiv  Detail & Related papers  (2025-03-28T17:43:35Z)
• Learning to Measure Quantum Neural Networks [10.617463958884528]
  We introduce a novel approach that makes the observable of the quantum system-specifically, the Hermitian matrix-learnable.<n>Our method features an end-to-end differentiable learning framework, where the parameterized observable is trained alongside the ordinary quantum circuit parameters.<n>Using numerical simulations, we show that the proposed method can identify observables for variational quantum circuits that lead to improved outcomes.
  arXiv  Detail & Related papers  (2025-01-10T02:28:19Z)
• Leveraging Pre-Trained Neural Networks to Enhance Machine Learning with Variational Quantum Circuits [48.33631905972908]
  We introduce an innovative approach that utilizes pre-trained neural networks to enhance Variational Quantum Circuits (VQC) This technique effectively separates approximation error from qubit count and removes the need for restrictive conditions. Our results extend to applications such as human genome analysis, demonstrating the broad applicability of our approach.
  arXiv  Detail & Related papers  (2024-11-13T12:03:39Z)
• A Novel Approach to Reduce Derivative Costs in Variational Quantum Algorithms [0.0]
  Quantum Non-Demolition Measurement (QNDM) to efficiently estimate the gradients or the Hessians of a quantum observable.<n>We find that the QNDM approach is more efficient, i.e. it needs fewer resources, in evaluating the derivatives of a cost function.<n>A significant outcome of our study is the implementation of the QNDM method in Python, provided in the supplementary material.
  arXiv  Detail & Related papers  (2024-04-02T19:06:01Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• 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)
• End-to-end resource analysis for quantum interior point methods and portfolio optimization [63.4863637315163]
  We provide a complete quantum circuit-level description of the algorithm from problem input to problem output. We report the number of logical qubits and the quantity/depth of non-Clifford T-gates needed to run the algorithm.
  arXiv  Detail & Related papers  (2022-11-22T18:54:48Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage [43.3054117987806]
  We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits. We show this method significantly improves the trainability and performance of PQCs on a variety of problems. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
  arXiv  Detail & Related papers  (2022-08-29T15:24:03Z)
• 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)
• 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)

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.