An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation
DOI10.1137/21M1439298zbMath1492.81037arXiv2108.03283OpenAlexW3187623092WikidataQ114073990 ScholiaQ114073990MaRDI QIDQ5094212
Roel Van Beeumen, Alexander F. Kemper, Lindsay Bassman, Efekan Kökcü, Daan Camps, Wibe A. de Jong
Publication date: 2 August 2022
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.03283
quantum computingfree fermionsquantum circuit synthesisNISQHamiltonian simulationalgebraic circuit compression
Factorization of matrices (15A23) Quantum computation (81P68) Groups and algebras in quantum theory and relations with integrable systems (81R12) Applications to the sciences (65Z05) Multilinear algebra, tensor calculus (15A69) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum gates (81P65)
Uses Software
Cites Work
- Computing the complete CS decomposition
- Stable Computation of the CS Decomposition: Simultaneous Bidiagonalization
- Chasing Bulges or Rotations? A Metamorphosis of the QR-Algorithm
- Quantum Computation and Quantum Information
- Universal Quantum Simulators
- On the Product of Semi-Groups of Operators
- Splitting methods
- Core-Chasing Algorithms for the Eigenvalue Problem
- A Generalization of the Multishift QR Algorithm
- Convergence Analysis of High-Order Time-Splitting Pseudospectral Methods for Nonlinear Schrödinger Equations
- Hartree-Fock on a superconducting qubit quantum computer
- Quantum Algorithm for Simulating Real Time Evolution of Lattice Hamiltonians
- Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
This page was built for publication: An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation
