TL;DR
A generalization and a detailed proof of the statement that, assuming that the problem of integer factoring is not solvable in polynomial time, there exists an optimization problem for which there exists a polynomial-time quantum 0 .
The emergence of Quantum Computing has resulted in a slate of quantum algorithms that can solve a wide variety of algorithmic and computational problems faster than any classical computer. How we can apply these various quantum algorithms to practical problems in computing is still an ongoing area of research. In this...
We present a distributed quantum algorithm that $3$-colors cycles in $O(1)$ rounds, with high probability. It follows that all locally checkable labeling problems (LCLs) that have round complexity $O(\log^* n)$ in the classical LOCAL model can be solved in $O(1)$ rounds in the quantum-LOCAL model, with high probability...
This paper studies the problem of designing the shallowest quantum circuit for a given polynomial form as a classical binary linear problem and proves the NP-completeness of a variant of it, Tempura, and offers a scalable and performant heuristic method to tackle it, Tempura.
The Learning With Errors (LWE) problem, introduced by Regev in 2005, is central to modern cryptography and post-quantum security. The algorithms to solve the search version of the problem, Search-LWE, can be broadly categorised into algebraic, combinatorial and lattice-based. In this work we propose a new algebraic alg...
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.
