Variational Quantum Algorithm for Estimating the Quantum Fisher
Information
- URL: http://arxiv.org/abs/2010.10488v2
- Date: Tue, 4 Jan 2022 21:31:19 GMT
- Title: Variational Quantum Algorithm for Estimating the Quantum Fisher
Information
- Authors: Jacob L. Beckey, M. Cerezo, Akira Sone, Patrick J. Coles
- Abstract summary: We present a variational quantum algorithm called Variational Quantum Fisher Information Estimation (VQFIE)
By estimating lower and upper bounds on the QFI, based on bounding the fidelity, VQFIE outputs a range in which the actual QFI lies.
This result can then be used to variationally prepare the state that maximizes the QFI, for the application of quantum sensing.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The Quantum Fisher information (QFI) quantifies the ultimate precision of
estimating a parameter from a quantum state, and can be regarded as a
reliability measure of a quantum system as a quantum sensor. However,
estimation of the QFI for a mixed state is in general a computationally
demanding task. In this work we present a variational quantum algorithm called
Variational Quantum Fisher Information Estimation (VQFIE) to address this task.
By estimating lower and upper bounds on the QFI, based on bounding the
fidelity, VQFIE outputs a range in which the actual QFI lies. This result can
then be used to variationally prepare the state that maximizes the QFI, for the
application of quantum sensing. In contrast to previous approaches, VQFIE does
not require knowledge of the explicit form of the sensor dynamics. We simulate
the algorithm for a magnetometry setup and demonstrate the tightening of our
bounds as the state purity increases. For this example, we compare our bounds
to literature bounds and show that our bounds are tighter.
Related papers
- Evaluation of quantum Fisher information for large system [6.706593033554568]
Quantum Fisher information (QFI) plays a vital role in quantum precision measurement, quantum information, many-body physics, and other domains.
This paper presents a methodology for evaluating the QFI of high-dimensional systems by transferring information to an auxiliary system and measuring its sub-QFI.
arXiv Detail & Related papers (2024-08-23T08:50:52Z) - Mitigating Errors on Superconducting Quantum Processors through Fuzzy
Clustering [38.02852247910155]
A new Quantum Error Mitigation (QEM) technique uses Fuzzy C-Means clustering to specifically identify measurement error patterns.
We report a proof-of-principle validation of the technique on a 2-qubit register, obtained as a subset of a real NISQ 5-qubit superconducting quantum processor.
We demonstrate that the FCM-based QEM technique allows for reasonable improvement of the expectation values of single- and two-qubit gates based quantum circuits.
arXiv Detail & Related papers (2024-02-02T14:02:45Z) - An operational definition of quantum information scrambling [0.0]
Quantum information scrambling (QIS) is a characteristic feature of several quantum systems.
We propose a novel and computationally efficient QIS quantifier based on a formulation of QIS in terms of quantum state discrimination.
We show that the optimal guessing probability, which reflects the degree of QIS induced by an isometric quantum evolution, is directly connected to the accessible min-information.
arXiv Detail & Related papers (2023-12-18T19:00:01Z) - On the feasibility of performing quantum chemistry calculations on quantum computers [0.0]
We propose two criteria for evaluating two leading quantum approaches for finding the ground state of molecules.
The first criterion applies to the variational quantum eigensolver (VQE) algorithm.
The second criterion applies to the quantum phase estimation (QPE) algorithm.
arXiv Detail & Related papers (2023-06-05T06:41:22Z) - Scaling Limits of Quantum Repeater Networks [62.75241407271626]
Quantum networks (QNs) are a promising platform for secure communications, enhanced sensing, and efficient distributed quantum computing.
Due to the fragile nature of quantum states, these networks face significant challenges in terms of scalability.
In this paper, the scaling limits of quantum repeater networks (QRNs) are analyzed.
arXiv Detail & Related papers (2023-05-15T14:57:01Z) - Qafny: A Quantum-Program Verifier [39.47005122712576]
We present Qafny, an automated proof system for verifying quantum programs.
At its core, Qafny uses a type-guided quantum proof system that translates quantum operations to classical array operations.
We show how Qafny can efficiently verify important quantum algorithms, including quantum-walk algorithms, Grover's algorithm, and Shor's algorithm.
arXiv Detail & Related papers (2022-11-11T18:50:52Z) - Potential and limitations of quantum extreme learning machines [55.41644538483948]
We present a framework to model QRCs and QELMs, showing that they can be concisely described via single effective measurements.
Our analysis paves the way to a more thorough understanding of the capabilities and limitations of both QELMs and QRCs.
arXiv Detail & Related papers (2022-10-03T09:32:28Z) - 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 Quantum Algorithms for Fidelity Estimation [77.34726150561087]
We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees.
Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation.
We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
arXiv Detail & Related papers (2022-03-30T02:02:16Z) - Quantum Fisher information from randomized measurements [0.0]
The quantum Fisher information (QFI) is a fundamental quantity of interest in many areas.
We use measurements of the density matrix to construct lower bounds that converge to the QFI.
We present two examples of applications of the method in quantum systems made of coupled qubits and collective spins.
arXiv Detail & Related papers (2021-05-27T14:16:14Z) - Generalized Measure of Quantum Fisher Information [0.0]
We present a lower bound on the quantum Fisher information (QFI) which is efficiently computable on near-term quantum devices.
We show that it satisfies the canonical criteria of a QFI measure.
arXiv Detail & Related papers (2020-10-06T17:36:30Z)
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.