You can create a release to package software, along with release notes and links to binary files, for other people to use. Learn more about releases in our docs.

This repository demonstrates a resource-optimized implementation of Shor’s Algorithm for factoring semiprime integers on the Quantum Rings Simulator, from small (8-bit) to 64-bit so far. The approach ...

Let A = A0 ⊕ A1 be a semiprime associative superalgebra over a commutative unital ring Φ with 1 2 ∈ Φ and di : A → A be a homogeneous superderivation of degree i ∈ ℤ2. If di takes nilpotent values ...

Abstract: Factorization of a large semiprime is a hard problem on classical computers, and quantum annealing is one way to solve the prime factorization problem by converting to a combinatorial ...

We continue the study of the reflexivity of ideals, introduced by Mason, and extend this notion to the subsets in rings. We first construct the smallest reflexive ideal containing S from any proper ...