Bayesian Quantum Multiphase Estimation Algorithm

• URL: http://arxiv.org/abs/2010.09075v2
• Date: Fri, 23 Jul 2021 14:12:20 GMT
• Title: Bayesian Quantum Multiphase Estimation Algorithm
• Authors: Valentin Gebhart, Augusto Smerzi, Luca Pezz\`e
• Abstract summary: We study a parallel (simultaneous) estimation of multiple arbitrary phases. The algorithm proves a certain noise resilience and can be implemented using single photons and standard optical elements.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum phase estimation (QPE) is the key subroutine of several quantum computing algorithms as well as a central ingredient in quantum computational chemistry and quantum simulation. While QPE strategies have focused on the estimation of a single phase, applications to the simultaneous estimation of several phases may bring substantial advantages; for instance, in the presence of spatial or temporal constraints. In this work, we study a Bayesian algorithm for the parallel (simultaneous) estimation of multiple arbitrary phases. The protocol gives access to correlations in the Bayesian multi-phase distribution resulting in covariance matrix elements scaling inversely proportional to the square of the total number of quantum resources. The parallel estimation allows to surpass the sensitivity of sequential single-phase estimation strategies for optimal linear combinations of phases. Furthermore, the algorithm proves a certain noise resilience and can be implemented using single photons and standard optical elements in currently accessible experiments.

Related papers

• Classical simulation of universal measurement-based quantum computation using multipartite Bell scenarios [0.0]
  We introduce a new classical simulation algorithm based on non-signaling polytopes of multipartite Bell scenarios. In our model, the simultaneous presence of non-stabilizerness and entanglement is necessary for quantum speedup.
  arXiv  Detail & Related papers  (2024-10-31T08:40:51Z)
• 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)
• Reductive Quantum Phase Estimation [0.0]
  We show a circuit that distinguishes an arbitrary set of phases with a fewer number of qubits and unitary applications. We show a trade-off between measurement precision and phase distinguishability, which allows one to tune the circuit to be optimal for a specific application.
  arXiv  Detail & Related papers  (2024-02-06T23:38:36Z)
• Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
  We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
  arXiv  Detail & Related papers  (2022-12-13T16:04:16Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Improved maximum-likelihood quantum amplitude estimation [0.0]
  Quantum estimation is a key subroutine in a number of powerful quantum algorithms, including quantum-enhanced Monte Carlo simulation and quantum machine learning. In this article, we deepen the analysis of Maximum-likelihood quantum amplitude estimation (MLQAE) to put the algorithm in a more prescriptive form, including scenarios where quantum circuit depth is limited. We then propose and numerically validate a modification to the algorithm to overcome this problem, bringing the algorithm even closer to being useful as a practical subroutine on near- and mid-term quantum hardware.
  arXiv  Detail & Related papers  (2022-09-07T17:30:37Z)
• 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)
• 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)
• Quantum Krylov subspace algorithms for ground and excited state energy estimation [0.0]
  Quantum Krylov subspace diagonalization (QKSD) algorithms provide a low-cost alternative to the conventional quantum phase estimation algorithm. We show that a wide class of Hamiltonians relevant to condensed matter physics and quantum chemistry contain symmetries that can be exploited to avoid the use of the Hadamard test. We develop a unified theory of quantum Krylov subspace algorithms and present three new quantum-classical algorithms for the ground and excited-state energy estimation problems.
  arXiv  Detail & Related papers  (2021-09-14T17:56:53Z)
• Statistical Approach to Quantum Phase Estimation [62.92678804023415]
  We introduce a new statistical and variational approach to the phase estimation algorithm (PEA) Unlike the traditional and iterative PEAs which return only an eigenphase estimate, the proposed method can determine any unknown eigenstate-eigenphase pair. We show the simulation results of the method with the Qiskit package on the IBM Q platform and on a local computer.
  arXiv  Detail & Related papers  (2021-04-21T00:02:00Z)
• Quantum machine learning with adaptive linear optics [0.0]
  We study supervised learning algorithms in which a quantum device is used to perform a computational subroutine. We design implementations of these quantum subroutines using Boson Sampling architectures in linear optics, supplemented by adaptive measurements.
  arXiv  Detail & Related papers  (2021-02-08T23:56:49Z)

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.