Pages that link to "Item:Q1616488"

The following pages link to Efficient quantum algorithms of finding the roots of a polynomial function (Q1616488):

Displaying 3 items.

• Necessary and sufficient condition for quantum computing (Q1740946) (← links)
• Quantum communication based on an algorithm of determining a matrix (Q1740965) (← links)
• Solving Bernstein and Vazirani's problem with the 2-bit permutation function (Q2102201) (← links)