Skip to main content
Quantum Computing

Return to Question

edited body
Source Link
Sanchayan Dutta
Sanchayan Dutta
  • 17.8k
  • 8
  • 49
  • 111

I am new to the Quantumquantum world and wondering the bounds of which the technology is at the current state of the art: specifically in computing prime numbers.

I would like to, if possible, create a project that seeks to find mersenneMersenne prime numbers (see here and here for more info).

I know there have been an algorithm(s) proposed for finding primes, but are there any actual languages I can make use of at the current state of the art? I have access to a QPU/LaticesLattices using the pyquil language, but haven't seen anything in the documentation that does this (at least in English I understand).

I am new to the Quantum world and wondering the bounds of which the technology is at the current state of the art: specifically in computing prime numbers.

I would like to, if possible, create a project that seeks to find mersenne prime numbers (see here and here for more info).

I know there have been an algorithm(s) proposed for finding primes, but are there any actual languages I can make use of at the current state of the art? I have access to a QPU/Latices using the pyquil language, but haven't seen anything in the documentation that does this (at least in English I understand).

I am new to the quantum world and wondering the bounds of which the technology is at the current state of the art: specifically in computing prime numbers.

I would like to, if possible, create a project that seeks to find Mersenne prime numbers (see here and here for more info).

I know there have been an algorithm(s) proposed for finding primes, but are there any actual languages I can make use of at the current state of the art? I have access to a QPU/Lattices using the pyquil language but haven't seen anything in the documentation that does this (at least in English I understand).

Source Link
Daniel Connelly
Daniel Connelly
  • 133
  • 2

Newbie Project: Calculate a Mersenne Prime with Quantum Computing

I am new to the Quantum world and wondering the bounds of which the technology is at the current state of the art: specifically in computing prime numbers.

I would like to, if possible, create a project that seeks to find mersenne prime numbers (see here and here for more info).

I know there have been an algorithm(s) proposed for finding primes, but are there any actual languages I can make use of at the current state of the art? I have access to a QPU/Latices using the pyquil language, but haven't seen anything in the documentation that does this (at least in English I understand).