Robust ground-state energy estimation under depolarizing noise
- URL: http://arxiv.org/abs/2307.11257v2
- Date: Sun, 10 Mar 2024 21:55:20 GMT
- Title: Robust ground-state energy estimation under depolarizing noise
- Authors: Zhiyan Ding and Yulong Dong and Yu Tong and Lin Lin
- Abstract summary: We present a novel ground-state energy estimation algorithm that is robust under global depolarizing error channels.
Our research demonstrates the feasibility of ground-state energy estimation in the presence of depolarizing noise.
- Score: 4.969229261095783
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We present a novel ground-state energy estimation algorithm that is robust
under global depolarizing error channels. Building upon the recently developed
Quantum Exponential Least Squares (QCELS) algorithm, our new approach
incorporates significant advancements to ensure robust estimation while
maintaining a polynomial cost in precision. By leveraging the spectral gap of
the Hamiltonian effectively, our algorithm overcomes limitations observed in
previous methods like quantum phase estimation (QPE) and robust phase
estimation (RPE). Going beyond global depolarizing error channels, our work
underscores the significance and practical advantages of utilizing randomized
compiling techniques to tailor quantum noise towards depolarizing error
channels. Our research demonstrates the feasibility of ground-state energy
estimation in the presence of depolarizing noise, offering potential
advancements in error correction and algorithmic-level error mitigation for
quantum algorithms.
Related papers
- Fault Tolerance Embedded in a Quantum-Gap-Estimation Algorithm with Trial-State Optimization [0.0]
We show that the spectral peak of an exact target gap can be amplified beyond the noise threshold, thereby reducing gap-estimate error.
Our results reveal the potential for accurate quantum simulations on near-term noisy quantum computers.
arXiv Detail & Related papers (2024-05-16T17:57:15Z) - The quantum adiabatic algorithm suppresses the proliferation of errors [0.29998889086656577]
We analyze the proliferation of a single error event in the adiabatic algorithm.
Our findings indicate that low energy states could remain attainable even in the presence of a single error event.
arXiv Detail & Related papers (2024-04-23T18:00:00Z) - Lindblad-like quantum tomography for non-Markovian quantum dynamical maps [46.350147604946095]
We introduce Lindblad-like quantum tomography (L$ell$QT) as a quantum characterization technique of time-correlated noise in quantum information processors.
We discuss L$ell$QT for the dephasing dynamics of single qubits in detail, which allows for a neat understanding of the importance of including multiple snapshots of the quantum evolution in the likelihood function.
arXiv Detail & Related papers (2024-03-28T19:29:12Z) - 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) - Statistical phase estimation and error mitigation on a superconducting
quantum processor [2.624902795082451]
We practically implement statistical phase estimation on Rigetti's superconducting processors.
We incorporate error mitigation strategies including zero-noise extrapolation and readout error mitigation with bit-flip averaging.
Our work demonstrates that statistical phase estimation has a natural resilience to noise, particularly after mitigating coherent errors.
arXiv Detail & Related papers (2023-04-11T10:40:22Z) - Robustness of Variational Quantum Algorithms against stochastic parameter perturbation [0.0]
Variational quantum algorithms are tailored to perform within the constraints of current quantum devices.
We consider a noise model that reflects realistic gate errors inherent to variational quantum algorithms.
We show that certain gate errors have a significantly smaller impact on the coherence of the state, allowing us to reduce the execution time without compromising performance.
arXiv Detail & Related papers (2022-12-30T20:36:29Z) - Reducing the cost of energy estimation in the variational quantum
eigensolver algorithm with robust amplitude estimation [50.591267188664666]
Quantum chemistry and materials is one of the most promising applications of quantum computing.
Much work is still to be done in matching industry-relevant problems in these areas with quantum algorithms that can solve them.
arXiv Detail & Related papers (2022-03-14T16:51:36Z) - Numerical Simulations of Noisy Quantum Circuits for Computational
Chemistry [51.827942608832025]
Near-term quantum computers can calculate the ground-state properties of small molecules.
We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
arXiv Detail & Related papers (2021-12-31T16:33:10Z) - Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state.
In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
arXiv Detail & Related papers (2021-12-27T21:15:35Z) - Using Quantum Metrological Bounds in Quantum Error Correction: A Simple
Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates.
Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
arXiv Detail & Related papers (2020-04-24T17:58:10Z) - Policy Gradient based Quantum Approximate Optimization Algorithm [2.5614220901453333]
We show that policy-gradient-based reinforcement learning algorithms are well suited for optimizing the variational parameters of QAOA in a noise-robust fashion.
We analyze the performance of the algorithm for quantum state transfer problems in single- and multi-qubit systems.
arXiv Detail & Related papers (2020-02-04T00:46:51Z)
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.