The following pages link to (Q3522431):
Displaying 15 items.
- Key masking using biometry (Q764394) (← links)
- Simulations of Shor's algorithm using matrix product states (Q1674568) (← links)
- Quantum arithmetic with the quantum Fourier transform (Q1679367) (← links)
- Resource analysis of quantum computing with noisy qubits for Shor's factoring algorithms (Q2102279) (← links)
- An automated deductive verification framework for circuit-building quantum programs (Q2233453) (← links)
- Quantum algorithms for typical hard problems: a perspective of cryptanalysis (Q2677252) (← links)
- A hybrid scheme for prime factorization and its experimental implementation using IBM quantum processor (Q2687214) (← links)
- Realization of a scalable Shor algorithm (Q2961622) (← links)
- An improved circuit for Shor's factoring algorithm using \(2n+2\) qubits (Q6139230) (← links)
- Variational quantum computation integer factorization algorithm (Q6145369) (← links)
- Concrete quantum cryptanalysis of binary elliptic curves via addition chain (Q6492517) (← links)
- An identity-based blind signature scheme using lattice with provable security (Q6534733) (← links)
- Use of global interactions in efficient quantum circuit constructions (Q6543508) (← links)
- Integer numeric multiplication using quantum Fourier transform (Q6589951) (← links)
- Space-efficient and noise-robust quantum factoring (Q6652983) (← links)
