How many bits does your quantum estimation return?
- URL: http://arxiv.org/abs/2403.17345v1
- Date: Tue, 26 Mar 2024 03:08:00 GMT
- Title: How many bits does your quantum estimation return?
- Authors: Xi Lu, Wojciech Górecki, Chiara Macchiavello, Lorenzo Maccone,
- Abstract summary: We give two upper bounds to the mutual information in arbitrary quantum estimation strategies.
We illustrate the usefulness of these bounds by characterizing the quantum phase estimation algorithm in the presence of noise.
- Score: 1.9865335779110387
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We give two upper bounds to the mutual information in arbitrary quantum estimation strategies. The first is based on some simple Fourier properties of the estimation apparatus. The second is derived using the first but, interestingly, depends only on the Fisher information of the parameter, so it is valid even beyond quantum estimation. We illustrate the usefulness of these bounds by characterizing the quantum phase estimation algorithm in the presence of noise. In addition, for the noiseless case, we extend the analysis beyond applying the bound and we discuss the optimal entangled and adaptive strategies, clarifying inaccuracies appearing on this topic in the literature.
Related papers
- Power Characterization of Noisy Quantum Kernels [52.47151453259434]
We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small.
We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
arXiv Detail & Related papers (2024-01-31T01:02:16Z) - 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) - Bayesian Learning of Parameterised Quantum Circuits [0.0]
We take a probabilistic point of view and reformulate the classical optimisation as an approximation of a Bayesian posterior.
We describe a dimension reduction strategy based on a maximum a posteriori point estimate with a Laplace prior.
Experiments on the Quantinuum H1-2 computer show that the resulting circuits are faster to execute and less noisy than circuits trained without a gradient.
arXiv Detail & Related papers (2022-06-15T14:20:14Z) - Quantum Augmented Dual Attack [8.134961550216618]
We present a quantum augmented variant of the dual lattice attack on the Learning with Errors (LWE) problem, using classical memory with quantum random access (QRACM)
Applying our results to lattice parameters from the literature, we find that our algorithm outperforms previous algorithms, assuming unit cost access to a QRACM.
arXiv Detail & Related papers (2022-05-27T13:54:31Z) - Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle.
We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm.
We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
arXiv Detail & Related papers (2022-05-26T20:32:36Z) - Quantum state inference from coarse-grained descriptions: analysis and
an application to quantum thermodynamics [101.18253437732933]
We compare the Maximum Entropy Principle method, with the recently proposed Average Assignment Map method.
Despite the fact that the assigned descriptions respect the measured constraints, the descriptions differ in scenarios that go beyond the traditional system-environment structure.
arXiv Detail & Related papers (2022-05-16T19:42:24Z) - 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 algorithms for estimating quantum entropies [6.211541620389987]
We propose quantum algorithms to estimate the von Neumann and quantum $alpha$-R'enyi entropies of an fundamental quantum state.
We also show how to efficiently construct the quantum entropy circuits for quantum entropy estimation using single copies of the input state.
arXiv Detail & Related papers (2022-03-04T15:44:24Z) - Dual-Frequency Quantum Phase Estimation Mitigates the Spectral Leakage
of Quantum Algorithms [76.15799379604898]
Quantum phase estimation suffers from spectral leakage when the reciprocal of the record length is not an integer multiple of the unknown phase.
We propose a dual-frequency estimator, which approaches the Cramer-Rao bound, when multiple samples are available.
arXiv Detail & Related papers (2022-01-23T17:20:34Z) - Near-Optimal Quantum Algorithms for Multivariate Mean Estimation [0.0]
We propose the first near-optimal quantum algorithm for estimating in Euclidean norm the mean of a vector-valued random variable.
We exploit a variety of additional algorithmic techniques such as amplitude amplification, the Bernstein-Vazirani algorithm, and quantum singular value transformation.
arXiv Detail & Related papers (2021-11-18T16:35:32Z) - Variational Quantum Algorithms for Trace Distance and Fidelity
Estimation [7.247285982078057]
We introduce hybrid quantum-classical algorithms for two distance measures on near-term quantum devices.
First, we introduce the Variational Trace Distance Estimation (VTDE) algorithm.
Second, we introduce the Variational Fidelity Estimation (VFE) algorithm.
arXiv Detail & Related papers (2020-12-10T15:56:58Z)
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.