Quantum signal processing over SU(N)
- URL: http://arxiv.org/abs/2311.03949v2
- Date: Mon, 1 Jul 2024 12:53:37 GMT
- Title: Quantum signal processing over SU(N)
- Authors: Lorenzo Laneve,
- Abstract summary: Quantum signal processing (QSP) and the quantum singular value transformation (QSVT) are pivotal tools for simplifying the development of quantum algorithms.
These techniques leverage transformations on the eigenvalues or singular values of block-encoded matrices, achieved with the use of just one control qubit.
In this work, we extend the original QSP ansatz by introducing multiple control qubits.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Quantum signal processing (QSP) and the quantum singular value transformation (QSVT) are pivotal tools for simplifying the development of quantum algorithms. These techniques leverage polynomial transformations on the eigenvalues or singular values of block-encoded matrices, achieved with the use of just one control qubit. In contexts where the control qubit is used to extract information about the eigenvalues or singular values, the amount of extractable information is limited to one bit per protocol. In this work, we extend the original QSP ansatz by introducing multiple control qubits. We show that, much like in the single-qubit case, nearly any vector of polynomials can be implemented with a multi-qubit QSP ansatz, and the gate complexity scales polynomially with the dimension of such states. Moreover, assuming that powers of the matrix to transform are easily implementable - as in Shor's algorithm - we can achieve polynomial transformations with degrees that scale exponentially with the number of control qubits. This work aims to provide a partial characterization of the polynomials that can be implemented using this approach, with phase estimation schemes and discrete logarithm serving as illustrative examples.
Related papers
- Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
We present a model for parallelizing simulation of quantum circuit executions.
The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
arXiv Detail & Related papers (2024-06-05T17:16:07Z) - On variants of multivariate quantum signal processing and their
characterizations [0.0]
Quantum signal processing (QSP) is a highly successful algorithmic primitive in quantum computing.
We show that Haah's characterization of general QSP can be extended to homogeneous bivariable (commuting) quantum signal processing.
We also show a similar result for an alternative inhomogeneous variant when the degree in one of the variables is at most 1, but construct a counterexample where both variables have degree 2.
arXiv Detail & Related papers (2023-12-14T16:06:58Z) - Variational-quantum-eigensolver-inspired optimization for spin-chain work extraction [39.58317527488534]
Energy extraction from quantum sources is a key task to develop new quantum devices such as quantum batteries.
One of the main issues to fully extract energy from the quantum source is the assumption that any unitary operation can be done on the system.
We propose an approach to optimize the extractable energy inspired by the variational quantum eigensolver (VQE) algorithm.
arXiv Detail & Related papers (2023-10-11T15:59:54Z) - Modular quantum signal processing in many variables [0.0]
We show that modular multi-input-based QSP-based superoperators can be snapped together with LEGO-like ease at the level of the functions they apply.
We also provide a Python package for assembling gadgets and compiling them to circuits.
arXiv Detail & Related papers (2023-09-28T17:58:51Z) - Determining the ability for universal quantum computing: Testing
controllability via dimensional expressivity [39.58317527488534]
Controllability tests can be used in the design of quantum devices to reduce the number of external controls.
We devise a hybrid quantum-classical algorithm based on a parametrized quantum circuit.
arXiv Detail & Related papers (2023-08-01T15:33:41Z) - Semantic embedding for quantum algorithms [0.0]
A need has developed for an assurance of the correctness of high-level quantum algorithmic reasoning.
Many quantum algorithms have been unified and improved using quantum signal processing (QSP) and quantum singular value transformation (QSVT)
We show that QSP/QSVT can be treated and combined modularly, purely in terms of the functional transforms they embed.
We also identify existing quantum algorithms whose use of semantic embedding is implicit, spanning from distributed search to soundness in quantum cryptography.
arXiv Detail & Related papers (2023-04-27T17:55:40Z) - Calculating the many-body density of states on a digital quantum
computer [58.720142291102135]
We implement a quantum algorithm to perform an estimation of the density of states on a digital quantum computer.
We use our algorithm to estimate the density of states of a non-integrable Hamiltonian on the Quantinuum H1-1 trapped ion chip for a controlled register of 18bits.
arXiv Detail & Related papers (2023-03-23T17:46:28Z) - Quantum Signal Processing, Phase Extraction, and Proportional Sampling [0.0]
Quantum Signal Processing (QSP) is a technique that can be used to implement a transformation $P(x)$ applied to the eigenvalues of a unitary $U$.
We show that QSP can be used to tackle a new problem, which we call phase extraction, and that this can be used to provide quantum speed-up for proportional sampling.
arXiv Detail & Related papers (2023-03-20T13:05:29Z) - Graph test of controllability in qubit arrays: A systematic way to
determine the minimum number of external controls [62.997667081978825]
We show how to leverage an alternative approach, based on a graph representation of the Hamiltonian, to determine controllability of arrays of coupled qubits.
We find that the number of controls can be reduced from five to one for complex qubit-qubit couplings.
arXiv Detail & Related papers (2022-12-09T12:59:44Z) - Analyzing Prospects for Quantum Advantage in Topological Data Analysis [35.423446067065576]
We analyze and optimize an improved quantum algorithm for topological data analysis.
We show that super-quadratic quantum speedups are only possible when targeting a multiplicative error approximation.
We argue that quantum circuits with tens of billions of Toffoli can solve seemingly classically intractable instances.
arXiv Detail & Related papers (2022-09-27T17:56:15Z) - Variational Quantum Singular Value Decomposition [8.145223158030259]
We propose a variational quantum algorithm for singular value decomposition (VQSVD)
By exploiting the variational principles for singular values and the Ky Fan Theorem, we design a novel loss function such that two quantum neural networks could be trained to learn the singular vectors and output the corresponding singular values.
Our work explores new avenues for quantum information processing beyond the conventional protocols that only works for Hermitian data.
arXiv Detail & Related papers (2020-06-03T15:32:08Z)
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.