Pages that link to "Item:Q5901044"

The following pages link to Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem (Q5901044):

Displaying 9 items.

• Finding shortest lattice vectors faster using quantum search (Q887421) (← links)
• Quantum computation in algebraic number theory: Hallgren's efficient quantum algorithm for solving Pell's equation. (Q1404927) (← links)
• Quantum algorithm design: techniques and applications (Q1730317) (← links)
• A novel fault-tolerant quantum divider and its simulation (Q2107957) (← links)
• Quantum binary search algorithm (Q2323771) (← links)
• Progress in quantum algorithms (Q2386407) (← links)
• On the probability of generating a lattice (Q2437315) (← links)
• Quantum and classical complexity classes: Separations, collapses, and closure properties (Q2486397) (← links)
• A polynomial quantum algorithm for approximating the Jones polynomial (Q5896964) (← links)