Efficient quantum circuits for Toeplitz and Hankel matrices

DOI10.1088/1751-8113/49/27/275301MaRDI QIDQ3186292zbMATH OpenOpenAlexFDO

Authors

Publication date 9 August 2016

Published in Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1605.07710

zbMATH Keywords

efficient quantum circuitquantum computationToeplitz and Hankel matrices

Mathematics Subject Classification ID

Toeplitz, Cauchy, and related matrices (15B05) Quantum computation (81P68)

Abstract: Toeplitz and Hankel matrices have been a subject of intense interest in a wide range of science and engineering related applications. In this paper, we show that quantum circuits can efficiently implement sparse or Fourier-sparse Toeplitz and Hankel matrices. This provides an essential ingredient for solving many physical problems with Toeplitz or Hankel symmetry in the quantum setting with deterministic queries.

Recommendations

• Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
• scientific article; zbMATH DE number 1406111
• Context-aware quantum simulation of a matrix stored in quantum memory
• QUANTUM SOFTWARE REUSABILITY
• Efficient quantum algorithms for simulating sparse Hamiltonians

Cited in

(3)

• A matrix representation of quantum circuits over non-adjacent qudits
• Efficient Quantum Tensor Product Expanders and k-Designs
• HHL algorithm without ancilla postselection for Toeplitz and Hankel systems

This page was built for publication: Efficient quantum circuits for Toeplitz and Hankel matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3186292)