Implementation of Shor's Algorithm on a Linear Nearest Neighbour Qubit Array

Details Implementation of Shor's Algorithm on a Linear Nearest Neighbour Qubit Array Implementation of Shor's Algorithm on a Linear Nearest Neighbour Qubit Array

2004-02-25

arxiv.org/abs/quant-ph/0402196v1

Quant. Info. Comput. 4, 237-251 (2004)

Physics

Quantum Physics

9 pages, 8 figures

Scientific paper

Shor's algorithm, which given appropriate hardware can factorise an integer $N$ in a time polynomial in its binary length $L$, has arguable spurred the race to build a practical quantum computer. Several different quantum circuits implementing Shor's algorithm have been designed, but each tacitly assumes that arbitrary pairs of qubits within the computer can be interacted. While some quantum computer architectures possess this property, many promising proposals are best suited to realising a single line of qubits with nearest neighbour interactions only. In light of this, we present a circuit implementing Shor's factorisation algorithm designed for such a linear nearest neighbour architecture. Despite the interaction restrictions, the circuit requires just $2L+4$ qubits and to first order requires $8L^{4}$ gates arranged in a circuit of depth $32L^{3}$ -- identical to first order to that possible using an architecture that can interact arbitrary pairs of qubits.

Affiliated with

Also associated with

No associations

Rating

Implementation of Shor's Algorithm on a Linear Nearest Neighbour Qubit Array does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Implementation of Shor's Algorithm on a Linear Nearest Neighbour Qubit Array, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Implementation of Shor's Algorithm on a Linear Nearest Neighbour Qubit Array will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-130695