Finding Angles for Quantum Signal Processing with Machine Precision
- URL: http://arxiv.org/abs/2003.02831v2
- Date: Sun, 8 Mar 2020 07:03:08 GMT
- Title: Finding Angles for Quantum Signal Processing with Machine Precision
- Authors: Rui Chao, Dawei Ding, Andras Gilyen, Cupjin Huang, Mario Szegedy
- Abstract summary: 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.
- Score: 7.997203849017868
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We describe an algorithm for finding angle sequences in quantum signal
processing, with a novel component we call halving based on a new algebraic
uniqueness theorem, and another we call capitalization. We present both
theoretical and experimental results that demonstrate the performance of the
new algorithm. In particular, these two algorithmic ideas allow us to find
sequences of more than 3000 angles within 5 minutes for important applications
such as Hamiltonian simulation, all in standard double precision arithmetic.
This is native to almost all hardware.
Related papers
- Quantum algorithms for Hopcroft's problem [45.45456673484445]
We study quantum algorithms for Hopcroft's problem which is a fundamental problem in computational geometry.
The classical complexity of this problem is well-studied, with the best known algorithm running in $O(n4/3)$ time.
Our results are two different quantum algorithms with time complexity $widetilde O(n5/6)$.
arXiv Detail & Related papers (2024-05-02T10:29:06Z) - 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) - Robust Angle Finding for Generalized Quantum Signal Processing [0.0]
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.
arXiv Detail & Related papers (2024-02-05T13:55:23Z) - Generalized quantum Arimoto-Blahut algorithm and its application to
quantum information bottleneck [55.22418739014892]
We generalize the quantum Arimoto-Blahut algorithm by Ramakrishnan et al.
We apply our algorithm to the quantum information bottleneck with three quantum systems.
Our numerical analysis shows that our algorithm is better than their algorithm.
arXiv Detail & Related papers (2023-11-19T00:06:11Z) - Logarithmic-Regret Quantum Learning Algorithms for Zero-Sum Games [7.962205145083434]
We propose the first online quantum algorithm for zero-sum games with $tilde O(1)$ regret under the game setting.
Our quantum algorithm computes an $varepsilon$-approximate Nash equilibrium of an $m times n$ matrix zero-sum game in quantum time.
arXiv Detail & Related papers (2023-04-27T14:02:54Z) - Mind the $\tilde{\mathcal{O}}$: Asymptotically Better, but Still
Impractical, Quantum Distributed Algorithms [0.0]
We present two algorithms in the Quantum CONGEST-CLIQUE model of distributed computation that succeed with high probability.
The algorithms achieve a lower round and message complexity than any known algorithms in the classical CONGEST-CLIQUE model.
An existing framework for using distributed version of Grover's search algorithm to accelerate triangle finding lies at the core of the speedup.
arXiv Detail & Related papers (2023-04-06T02:18:52Z) - 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) - Quantum Sparse Coding [5.130440339897477]
We develop a quantum-inspired algorithm for sparse coding.
The emergence of quantum computers and Ising machines can potentially lead to more accurate estimations.
We conduct numerical experiments with simulated data on Lightr's quantum-inspired digital platform.
arXiv Detail & Related papers (2022-09-08T13:00:30Z) - Partition Function Estimation: Quantum and Quantum-Inspired Algorithms [1.7510560590853574]
We present two algorithms, one quantum and one classical, for estimating partition functions of quantum spin Hamiltonians.
The former is a DQC1 (Deterministic quantum computation with one clean qubit) algorithm, and the first such for complex temperatures.
arXiv Detail & Related papers (2022-08-01T15:29:06Z) - 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) - Synthesis of Quantum Circuits with an Island Genetic Algorithm [44.99833362998488]
Given a unitary matrix that performs certain operation, obtaining the equivalent quantum circuit is a non-trivial task.
Three problems are explored: the coin for the quantum walker, the Toffoli gate and the Fredkin gate.
The algorithm proposed proved to be efficient in decomposition of quantum circuits, and as a generic approach, it is limited only by the available computational power.
arXiv Detail & Related papers (2021-06-06T13:15:25Z)
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.