English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Quantum computing is a winsome field that concerns with the behaviour andnature of energy at the quantum level to improve the efficiency ofcomputations. In recent years, quantum computation is receiving much attentionfor its capability to solve difficult problems efficiently in contrast toclassical computers. Specifically, some well-known public-key cryptosystemsdepend on the difficulty of factoring large numbers, which takes a very longtime. It is expected that the emergence of a quantum computer has the potentialto break such cryptosystems by 2020 due to the discovery of powerful quantumalgorithms (Shor's factoring, Grover's search algorithm and many more). In thispaper, we have designed a quantum variant of the second fastest classicalfactorization algorithm named "Quadratic Sieve". We have constructed thesimulation framework of quantized quadratic sieve algorithm using high-levelprogramming language Mathematica. Further, the simulation results are performedon a classical computer to get a feel of the quantum system and proved that itis more efficient than its classical variants from computational complexitypoint of view.

Quadratic Sieve Factorization Quantum Algorithm and its Simulation