Related papers: Dual-Frequency Quantum Phase Estimation Mitigates the Spectral Leakage of Quantum Algorithms

Dual-Frequency Quantum Phase Estimation Mitigates the Spectral Leakage of Quantum Algorithms

URL: http://arxiv.org/abs/2201.09323v2
Date: Sun, 20 Mar 2022 03:38:13 GMT
Title: Dual-Frequency Quantum Phase Estimation Mitigates the Spectral Leakage of Quantum Algorithms
Authors: Yifeng Xiong, Soon Xin Ng, Gui-Lu Long, Lajos Hanzo
Abstract summary: 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.
Score: 76.15799379604898
License: http://creativecommons.org/licenses/by-sa/4.0/
Abstract: Quantum phase estimation is an important component in diverse quantum algorithms. However, it suffers from spectral leakage, when the reciprocal of the record length is not an integer multiple of the unknown phase, which incurs an accuracy degradation. For the existing single-sample estimation scheme, window-based methods have been proposed for spectral leakage mitigation. As a further advance, we propose a dual-frequency estimator, which asymptotically approaches the Cramer-Rao bound, when multiple samples are available. Numerical results show that the proposed estimator outperforms the existing window-based methods, when the number of samples is sufficiently high.

Related papers

Performing Non-Local Phase Estimation with a Rydberg-Superconducting Qubit Hybrid [0.0]
We numerically simulate the execution of the distributed phase estimation algorithm in a proposed novel superconducting-resonator-atom hybrid system. An entangling gate between two qubits is utilised in the distributed phase estimation algorithm, called an E2 gate. The GRAPE algorithm showed very accurate engineering of Rydberg atom single and multi-qubit gates with fidelities higher than 90%.
arXiv Detail & Related papers (2024-02-22T16:11:48Z)
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)
Finitely Repeated Adversarial Quantum Hypothesis Testing [22.102728605081534]
We formulate a passive quantum detector based on a quantum hypothesis testing framework under the setting of finite sample size. Under the assumption that the attacker adopts separable optimal strategies, we derive that the worst-case average error bound converges to zero exponentially. We adopt our formulations upon a case study of detection with quantum radars.
arXiv Detail & Related papers (2022-12-02T17:08:17Z)
Suppressing Amplitude Damping in Trapped Ions: Discrete Weak Measurements for a Non-unitary Probabilistic Noise Filter [62.997667081978825]
We introduce a low-overhead protocol to reverse this degradation. We present two trapped-ion schemes for the implementation of a non-unitary probabilistic filter against amplitude damping noise. This filter can be understood as a protocol for single-copy quasi-distillation.
arXiv Detail & Related papers (2022-09-06T18:18:41Z)
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)
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)
Robust quantum classifier with minimal overhead [0.8057006406834467]
Several quantum algorithms for binary classification based on the kernel method have been proposed. These algorithms rely on estimating an expectation value, which in turn requires an expensive quantum data encoding procedure to be repeated many times. We show that the kernel-based binary classification can be performed with a single-qubit measurement regardless of the number and the dimension of the data.
arXiv Detail & Related papers (2021-04-16T14:51:00Z)
Sampling Overhead Analysis of Quantum Error Mitigation: Uncoded vs. Coded Systems [69.33243249411113]
We show that Pauli errors incur the lowest sampling overhead among a large class of realistic quantum channels. We conceive a scheme amalgamating QEM with quantum channel coding, and analyse its sampling overhead reduction compared to pure QEM.
arXiv Detail & Related papers (2020-12-15T15:51:27Z)
Amplitude estimation via maximum likelihood on noisy quantum computer [3.5462326830737805]
We give an experimental demonstration on a superconducting IBM Quantum device. We show that the proposed maximum likelihood estimator achieves quantum speedup in the number of queries.
arXiv Detail & Related papers (2020-06-29T17:44:04Z)
Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
arXiv Detail & Related papers (2020-05-05T20:11:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.