Robust Angle Finding for Generalized Quantum Signal Processing
- URL: http://arxiv.org/abs/2402.03016v2
- Date: Thu, 27 Jun 2024 13:34:57 GMT
- Title: Robust Angle Finding for Generalized Quantum Signal Processing
- Authors: Shuntaro Yamamoto, Nobuyuki Yoshioka,
- Abstract summary: We extend the framework of GQSP and propose a robust angle finding algorithm.
We find that the number of calls, or queries, to signal operators are essentially halved compared to the ordinary framework of QSP.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum Signal Processing (QSP), together with the quantum singular value transformation, is one of the central quantum algorithms due to its efficiency and generality in many fields including quantum simulation, quantum machine learning, and quantum cryptography. The largest bottleneck of QSP and its family is its difficulty in finding the phase angle sequence for signal processing. We find that this is in particular prominent when one employs the generalized formalism of the QSP, or the GQSP, to employ arbitrary single-qubit unitaries for signal processing operator. In this work, we extend the framework of GQSP and propose a robust angle finding algorithm. The proposed angle finding algorithm, based on Prony's method, successfully generates angle sequence of precision $10^{-13}$ up to polynomial degrees of hundreds within a second. By applying our method to Hamiltonian simulation, we find that the number of calls, or queries, to signal operators are essentially halved compared to the ordinary framework of QSP.
Related papers
- Bias-field digitized counterdiabatic quantum optimization [39.58317527488534]
We call this protocol bias-field digitizeddiabatic quantum optimization (BF-DCQO)
Our purely quantum approach eliminates the dependency on classical variational quantum algorithms.
It achieves scaling improvements in ground state success probabilities, increasing by up to two orders of magnitude.
arXiv Detail & Related papers (2024-05-22T18:11:42Z) - Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
Quantum computing sets the foundation for new ways of designing algorithms.
New challenges arise concerning which field quantum speedup can be achieved.
Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
arXiv Detail & Related papers (2024-02-26T09:32:07Z) - Generalized Quantum Signal Processing [0.6768558752130311]
We present a Generalized Quantum Signal Processing approach, employing general SU(2) rotations as our signal processing operators.
Our approach lifts all practical restrictions on the family of achievable transformations, with the sole remaining condition being that $|P|leq 1$.
In cases where only $P$ is known, we provide an efficient GPU optimization capable of identifying in under a minute of time, a corresponding $Q$ for degree on the order of $107$.
arXiv Detail & Related papers (2023-08-03T01:51:52Z) - Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem.
The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
arXiv Detail & Related papers (2023-04-18T11:57:15Z) - Realization of quantum signal processing on a noisy quantum computer [0.4593579891394288]
We propose a strategy to run an entire QSP protocol on noisy quantum hardware by carefully reducing overhead costs at each step.
We test the protocol by running the algorithm on the Quantinuum H1-1 trapped-ion quantum computer powered by Honeywell.
Our results are the first step in the experimental realization of QSP-based quantum algorithms.
arXiv Detail & Related papers (2023-03-09T19:00:17Z) - Quantum process tomography of continuous-variable gates using coherent
states [49.299443295581064]
We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit.
We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
arXiv Detail & Related papers (2023-03-02T18:08:08Z) - Quantum-inspired optimization for wavelength assignment [51.55491037321065]
We propose and develop a quantum-inspired algorithm for solving the wavelength assignment problem.
Our results pave the way to the use of quantum-inspired algorithms for practical problems in telecommunications.
arXiv Detail & Related papers (2022-11-01T07:52:47Z) - 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) - A Grand Unification of Quantum Algorithms [0.0]
A number of quantum algorithms were recently tied together by a technique known as the quantum singular value transformation.
This paper provides a tutorial through these developments, first illustrating how quantum signal processing may be generalized to the quantum eigenvalue transform.
We then employ QSVT to construct intuitive quantum algorithms for search, phase estimation, and Hamiltonian simulation.
arXiv Detail & Related papers (2021-05-06T17:46:33Z) - Finding Angles for Quantum Signal Processing with Machine Precision [7.997203849017868]
We describe an algorithm for finding angle sequences in quantum signal processing.
We present both theoretical and experimental results that demonstrate the performance of the new algorithm.
arXiv Detail & Related papers (2020-03-05T18:58:20Z) - Efficient phase-factor evaluation in quantum signal processing [1.3614427997190908]
Quantum signal processing (QSP) is a powerful quantum algorithm to exactly implement matrixs on quantum computers.
There is so far no classically stable algorithm allowing computation of the phase factors that are needed to build QSP circuits.
We present here an optimization based method that can accurately compute the phase factors using standard double precision arithmetic operations.
arXiv Detail & Related papers (2020-02-26T17:23:55Z)
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.