Efficient quantum algorithms for state measurement and linear algebra applications

DOI10.1142/S021974991850048XzbMath1407.81071arXiv1710.01984OpenAlexW2964307483MaRDI QIDQ4620263

Apoorva Patel, Anjani Priyadarsini

Publication date: 8 February 2019

Published in: International Journal of Quantum Information (Search for Journal in Brave)

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

zbMATH Keywords

computational complexityChebyshev polynomialsNewton-Raphson methoddigital representationquantum simulations

Mathematics Subject Classification ID

Newton-type methods (49M15) Quantum computation (81P68) Best approximation, Chebyshev systems (41A50) Quantum measurement theory, state operations, state preparations (81P15) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (1)

Computing scalar products via a two-terminal quantum transmission line

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS
• Modern Computer Arithmetic
• Universal Quantum Simulators
• Adiabatic quantum state generation and statistical zero knowledge
• Faster Algorithms via Approximation Theory
• Methods of conjugate gradients for solving linear systems
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

This page was built for publication: Efficient quantum algorithms for state measurement and linear algebra applications