Pages that link to "Item:Q5900520"
From MaRDI portal
The following pages link to Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem (Q5900520):
Displaying 24 items.
- Computational indistinguishability between quantum states and its cryptographic application (Q434349) (← links)
- Quantum cryptography beyond quantum key distribution (Q908054) (← links)
- Representation-theoretical properties of the approximate quantum Fourier transform (Q937218) (← links)
- Quantum computation in algebraic number theory: Hallgren's efficient quantum algorithm for solving Pell's equation. (Q1404927) (← links)
- SICs and algebraic number theory (Q1698308) (← links)
- On the role of dealing with quantum coherence in amplitude amplification (Q1993814) (← links)
- On the quantum attacks against schemes relying on the hardness of finding a short generator of an ideal in \(\mathbb{Q}(\zeta_{2^s})\) (Q2009413) (← links)
- Deterministic algorithms for the hidden subgroup problem (Q2105456) (← links)
- On the quantum complexity of the continuous hidden subgroup problem (Q2119017) (← links)
- Quantum computation of zeta functions of curves (Q2506162) (← links)
- Sample complexity of hidden subgroup problem (Q2672576) (← links)
- Quantum algorithm based on the \(\varepsilon\)-random linear disequations for the continuous hidden shift problem (Q2685660) (← links)
- Quantum algorithms for algebraic problems (Q3077033) (← links)
- (Q3522513) (← links)
- Fast quantum algorithms for computing the unit group and class group of a number field (Q3581441) (← links)
- Quantum machine learning: a classical perspective (Q4556858) (← links)
- Solving Lyapunov equation by quantum algorithm (Q4574760) (← links)
- Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields (Q4575643) (← links)
- An FPGA-based quantum circuit emulation framework using heisenberg representation (Q4620269) (← links)
- Improved reversible and quantum circuits for Karatsuba-based integer multiplication. (Q4637981) (← links)
- Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time (Q5056439) (← links)
- A quantum algorithm for computing the unit group of an arbitrary degree number field (Q5259563) (← links)
- Quantum Random Walks – New Method for Designing Quantum Algorithms (Q5448636) (← links)
- Reduction of the semigroup-action problem on a module to the hidden-subgroup problem (Q6617025) (← links)
