Block encoding of matrix product operators

Abstract

Quantum signal processing combined with quantum eigenvalue transformation has recently emerged as a unifying framework for several quantum algorithms. In its standard form, it consists of two separate routines: block encoding, which encodes a Hamiltonian in a larger unitary, and signal processing, which achieves an almost arbitrary polynomial transformation of such a Hamiltonian using rotation gates. The bottleneck of the entire operation is typically constituted by block encoding and, in recent years, several problem-specific techniques have been introduced to overcome this problem. Within this framework, we present a procedure to block-encode a Hamiltonian based on its matrix product operator (MPO) representation. More specifically, we encode every MPO tensor in a larger unitary of dimension $D+2$, where $D=\lceil \log (\chi )\rceil$ is the number of subsequently contracted qubits that scales logarithmically with the virtual bond dimension $\chi$. Given any system of size $L$, our method requires $L+D$ ancillary qubits in total, while the number of one- and two-qubit gates decomposing the block encoding circuit scales as $\mathcal{O}(L\cdot {\chi }^2)$.

15 pages, 9 figures

References in corpus (17)

• The density-matrix renormalization group in the age of matrix product states
• Hamiltonian Simulation by Qubitization
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Quantum-state preparation with universal gate decompositions
• Time-evolving a matrix product state with long-ranged interactions
• Real- and imaginary-time evolution with compressed quantum circuits
• Applying matrix product operators to model systems with long-range interactions
• Lecture Notes of Tensor Network Contractions
• Isometric Tensor Network States in Two Dimensions
• Optimal polynomial based quantum eigenstate filtering with application to solving quantum linear systems
• Tensor operators: constructions and applications for long-range interaction systems
• Linear-Depth Quantum Circuits for n-qubit Toffoli gates with no Ancilla
• Linear-depth quantum circuits for multiqubit controlled gates
• Approaching the theoretical limit in quantum gate decomposition
• Efficient decomposition of unitary matrices in quantum circuit compilers
• Realization of quantum signal processing on a noisy quantum computer
• Matrix product operator representations for the local conserved quantities of the Heisenberg chain

Cited by in corpus (3)

• Tensor-Programmable Quantum Circuits for Solving Differential Equations
• Preparation Circuits for Matrix Product States by Classical Variational Disentanglement
• A Spectral Quantum Algorithm for Numerical Differentiation and Integration