Results 61 to 70 of about 2,290,669 (124)
Scientific Reports, 2022 Prime factorization (P = M × N) is a promising application for quantum computing. Shor’s algorithm is a key concept for breaking the limit for analyzing P, which cannot be effectively solved by classical computation; however, the algorithm requires error-
Daisuke Saida +3 more
doaj +1 more source
Financial Management, Volume 55, Issue 3, Page 457-484, Fall 2026.ABSTRACT We examine how mergers and acquisitions (M&As) enable firms to adapt to climate policy shocks. Exploiting the adoption of the Nitrogen Oxides (NOx) Budget Trading Program (NBP) across US states as an exogenous shock, we find that firms with NOx‐emitting plants subject to the NBP are more likely to engage in M&As, particularly through vertical ...
Samer Adra +3 more
wiley +1 more source
Quantum Algorithm for Attacking RSA Based on Fourier Transform and Fixed-Point
, 2021 Shor in 1994 proposed a quantum polynomial-time algorithm for finding the order r of an element a in the multiplicative group Zn*, which can be used to factor the integer n by computing gcd(ar/2±1,n), and hence break the famous RSA cryptosystem. However,
Huanguo ZHANG, Yahui WANG
core +1 more source
Forum of Mathematics, PiIn 1994, Shor introduced his famous quantum algorithm to factor integers and compute discrete logarithms in polynomial time. In 2023, Regev proposed a multidimensional version of Shor’s algorithm that requires far fewer quantum gates.
Cédric Pilatte
doaj +1 more source
Bayesian Inference for Multivariate Monotone Densities
Scandinavian Journal of Statistics, Volume 53, Issue 3, Page 1206-1229, September 2026.ABSTRACT We consider a nonparametric Bayesian approach to estimation and testing for a multivariate monotone density. Instead of following the conventional Bayesian approach of imposing a prior that satisfies the monotonicity restriction, we place a prior on the step heights via binning and a Dirichlet distribution. The resulting posterior distribution
Kang Wang, Subhashis Ghosal
wiley +1 more source
Shor’s algorithm for integer factorization
, 2019 Shor’s algorithm is used to find the integer factors of a large number with exponential speed-up when compared to the best known classical algorithm.
Franklin de Lima Marquezino +5 more
core +1 more source
Oblivious signature based on the theory of elliptic curve isogeny
Научно-технический вестник информационных технологий, механики и оптикиThis paper presents a novel 1-out-of-n post-quantum oblivious signature scheme based on supersingular elliptic curve isogenies. The proposed scheme is built upon the Commutative Supersingular Isogeny based Fiat-Shamir scheme whose security relies on the ...
A. F. Khutsaeva
doaj +1 more source
International Journal for Numerical Methods in Engineering, Volume 127, Issue 16, 30 August 2026.ABSTRACT This study proposes a quantum computing algorithm for dynamic structural analysis, assuming the use of quantum computers. Specifically, we apply a quantum algorithm known as Hamiltonian Simulation (HS), which calculates the time evolution of the Schrödinger equation with time‐independent coefficients, to the equations of motion governing the ...
Koya Wagatsuma +2 more
wiley +1 more source
Remarks on Quantum Modular Exponentiation and Some Experimental Demonstrations of Shor’s Algorithm [PDF]
, 2014 . An efficient quantum modular exponentiation method is indispensible for Shor’s factoring algorithm. But we find that all descriptions presented by Shor, Nielsen and Chuang, Markov and Saeedi, et al., are flawed.
Zhengjun Cao, Zhenfu Cao, Lihua Liu
core
Epilepsia, Volume 67, Issue 8, Page 4139-4152, August 2026.Abstract Objective This study was undertaken to evaluate the safety and effectiveness of responsive thalamic stimulation as adjunctive therapy for drug‐resistant idiopathic generalized epilepsy (IGE) with generalized tonic–clonic seizures (GTCSs). Methods NAUTILUS is a prospective, multicenter, single‐blind, randomized sham‐controlled pivotal trial ...
Utku Uysal +49 more
wiley +1 more source