Quantum Gauss-Jordan elimination and simulation of accounting principles on quantum computers

DOI10.1007/S10773-017-3340-8zbMath1366.81115arXivquant-ph/0511062OpenAlexW2597876346MaRDI QIDQ2363143

Do Ngoc Diep, Nguyen Van Minh, Dô Hoàng Giang

Publication date: 13 July 2017

Published in: International Journal of Theoretical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0511062

zbMATH Keywords

complexityquantum algorithmquantum searchaccounting principlesquantum Gauss-Jordan eliminationsystem of linear equations in the economic model of Leontief

Mathematics Subject Classification ID

Searching and sorting (68P10) Quantum computation (81P68) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (10)

Efficient quantum algorithms of finding the roots of a polynomial function ⋮ Creating very true quantum algorithms for quantum energy based computing ⋮ Quantum communication and quantum multivariate polynomial interpolation ⋮ Quantum cryptography based on the Deutsch-Jozsa algorithm ⋮ Duality quantum simulation of the Yang-Baxter equation ⋮ Application of quantum Gauss-Jordan elimination code to quantum secret sharing code ⋮ New method of calculating a multiplication by using the generalized Bernstein-Vazirani algorithm ⋮ Some theoretically organized algorithm for quantum computers ⋮ Some quantum neural networks ⋮ Quantum algorithm for the root-finding problem

Cites Work

• Geometric quantum computation
• Unnamed Item

This page was built for publication: Quantum Gauss-Jordan elimination and simulation of accounting principles on quantum computers