A formulation of a matrix sparsity approach for the quantum ordered search algorithm

DOI10.1142/S0219749917500137zbMath1375.81071arXiv1610.02117MaRDI QIDQ5370953

Saarim Rahman, Jupinder Parmar, Jaskaran Thiara

Publication date: 20 October 2017

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

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

zbMATH Keywords

quantum algorithmGrover's ordered search problemsparse semidefinite program

Mathematics Subject Classification ID

Searching and sorting (68P10) Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Uses Software

• CVXOPT
• NumPy

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: A formulation of a matrix sparsity approach for the quantum ordered search algorithm