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
- 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) - 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) - Approximation of the Nearest Classical-Classical State to a Quantum
State [0.0]
A revolutionary step in computation is driven by quantumness or quantum correlations, which are permanent in entanglements but often in separable states.
The exact quantification of quantumness is an NP-hard problem; thus, we consider alternative approaches to approximate it.
We show that the objective value decreases along the flow by proofs and numerical results.
arXiv Detail & Related papers (2023-01-23T08:26:17Z) - 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) - On exploring practical potentials of quantum auto-encoder with
advantages [92.19792304214303]
Quantum auto-encoder (QAE) is a powerful tool to relieve the curse of dimensionality encountered in quantum physics.
We prove that QAE can be used to efficiently calculate the eigenvalues and prepare the corresponding eigenvectors of a high-dimensional quantum state.
We devise three effective QAE-based learning protocols to solve the low-rank state fidelity estimation, the quantum Gibbs state preparation, and the quantum metrology tasks.
arXiv Detail & Related papers (2021-06-29T14:01:40Z) - 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) - Minimizing estimation runtime on noisy quantum computers [0.0]
"engineered likelihood function" (ELF) is used for carrying out Bayesian inference.
We show how the ELF formalism enhances the rate of information gain in sampling as the physical hardware transitions from the regime of noisy quantum computers.
This technique speeds up a central component of many quantum algorithms, with applications including chemistry, materials, finance, and beyond.
arXiv Detail & Related papers (2020-06-16T17:46:18Z)
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.