64 citations · 157 across the 5 of their papers we have counts for
5 papers · 1 filter
Towards Large-Scale Quantum Computation
Austin G. Fowler
This thesis deals with a series of quantum computer implementation issues from the Kane 31P in 28Si architecture to Shor's integer factoring algorithm and beyond. The discussion be…
Implementation of Shor's Algorithm on a Linear Nearest Neighbour Qubit Array
Austin G. Fowler, Simon J. Devitt, Lloyd C. L. Hollenberg
Shor's algorithm, which given appropriate hardware can factorise an integer in a time polynomial in its binary length , has arguable spurred the race to build a practical qu…
Quantum Error Correction on Linear Nearest Neighbor Qubit Arrays
Austin G. Fowler, Charles D. Hill, Lloyd C. L. Hollenberg
A minimal depth quantum circuit implementing 5-qubit quantum error correction in a manner optimized for a linear nearest neighbor architecture is described. The canonical decomposi…
Scalability of Shor's algorithm with a limited set of rotation gates
Austin G. Fowler, Lloyd C. L. Hollenberg
Typical circuit implementations of Shor's algorithm involve controlled rotation gates of magnitude where is the binary length of the integer N to be factored. Such g…
Error Rate of the Kane Quantum Computer CNOT Gate in the Presence of Dephasing
Austin G. Fowler, Cameron J. Wellard, Lloyd C. L. Hollenberg
We study the error rate of CNOT operations in the Kane solid state quantum computer architecture. A spin Hamiltonian is used to describe the system. Dephasing is included as expone…