pith. sign in

arxiv: 2104.01410 · v2 · pith:6Z3CYQFMnew · submitted 2021-04-03 · 🪐 quant-ph

Hamiltonian singular value transformation and inverse block encoding

classification 🪐 quant-ph
keywords transformationblockhamiltonianquantumsingularvalueencodinginverse
0
0 comments X
read the original abstract

The quantum singular value transformation is a powerful quantum algorithm that allows one to apply a polynomial transformation to the singular values of a matrix that is embedded as a block of a unitary transformation. This paper shows how to perform the quantum singular value transformation for a matrix that can be embedded as a block of a Hamiltonian. The transformation can be implemented in a purely Hamiltonian context by the alternating application of Hamiltonians for chosen intervals: it is an example of the Quantum Alternating Operator Ansatz (generalized QAOA). We also show how to use the Hamiltonian quantum singular value transformation to perform inverse block encoding to implement a unitary of which a given Hamiltonian is a block. Inverse block encoding leads to novel procedures for matrix multiplication and for solving differential equations on quantum information processors in a purely Hamiltonian fashion.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Pulse-optimised circuit elements for scalable and noise-resilient quantum chemistry

    quant-ph 2026-06 unverdicted novelty 6.0

    Pulse-optimized implementations of single- and double-qubit excitations in VQE reduce runtimes by up to 15.3 times on silicon spin-qubit processors.