2016Quantum Information and ComputationRequires access

An n-bit general implementation of shor's quantum factoring algorithm

T. DaviesJ., J RickerdChristopher, A GrimesMike, Ö GüneyDurdu

Open publisher page 1 citations

Abstract

The goal of this paper is to outline a general-purpose scalable implementation of Shor's period finding algorithm using fundamental quantum gates, and to act as a blueprint for linear optical imple...

About this research paper

What this paper is about

The goal of this paper is to outline a general-purpose scalable implementation of Shor's period finding algorithm using fundamental quantum gates, and to act as a blueprint for linear optical imple...

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The goal of this paper is to outline a general-purpose scalable implementation of Shor's period finding algorithm using fundamental quantum gates, and to act as a blueprint for linear optical imple...

Key concepts: Computer science, Scalability, Quantum computer, Quantum algorithm, Factoring, Algorithm, Blueprint, Quantum gate

Related papers

Back to paper searchBrowse research topicsOriginal source
An n-bit general implementation of shor's quantum factoring algorithm — Research Paper | ScholarLens