arXiv subjects

Andrew M. Steane

Publications and source records attributed to Andrew M. Steane.

22 records · Page 2Linked to original sources

arXiv2002

Quantum computer architecture for fast entropy extraction

If a quantum computer is stabilized by fault-tolerant quantum error correction (QEC), then most of its resources (qubits and operations) are dedicated to the extraction of error information. Analysis of this process leads to a set of central requirements for candidate computing devices, in addition to the basic ones of stable qubits and controllable gates and measurements. The logical structure of the extraction process has a natural geometry and hierarchy of communication needs; a computer whose physical architecture is designed to reflect this will be able to tolerate the most noise. The relevant networks are dominated by quantum information transport, therefore to assess a computing device it is necessary to characterize its ability to transport quantum information, in addition to assessing the performance of conditional logic on nearest neighbours and the passive stability of the memory. The transport distances involved in QEC networks are estimated, and it is found that a device relying on swap operations for information transport must have those operations an order of magnitude more precise than the controlled gates of a device which can transport information at low cost.

quant-ph↗

arXiv1998

Efficient fault-tolerant quantum computing

Fault tolerant quantum computing methods which work with efficient quantum error correcting codes are discussed. Several new techniques are introduced to restrict accumulation of errors before or during the recovery. Classes of eligible quantum codes are obtained, and good candidates exhibited. This permits a new analysis of the permissible error rates and minimum overheads for robust quantum computing. It is found that, under the standard noise model of ubiquitous stochastic, uncorrelated errors, a quantum computer need be only an order of magnitude larger than the logical machine contained within it in order to be reliable. For example, a scale-up by a factor of 22, with gate error rate of order $10^{-5}$, is sufficient to permit large quantum algorithms such as factorization of thousand-digit numbers.

quant-ph↗

arXiv1998

Enlargement of Calderbank Shor Steane quantum codes

It is shown that a classical error correcting code C = [n,k,d] which contains its dual, C^{\perp} \subseteq C, and which can be enlarged to C' = [n,k' > k+1, d'], can be converted into a quantum code of parameters [[ n, k+k' - n, min(d, 3d'/2) ]]. This is a generalisation of a previous construction, it enables many new codes of good efficiency to be discovered. Examples based on classical Bose Chaudhuri Hocquenghem (BCH) codes are discussed.

quant-ph↗

arXiv1996

The Ion Trap Quantum Information Processor

An introductory review of the linear ion trap is given, with particular regard to its use for quantum information processing. The discussion aims to bring together ideas from information theory and experimental ion trapping, to provide a resource to workers unfamiliar with one or the other of these subjects. It is shown that information theory provides valuable concepts for the experimental use of ion traps, especially error correction, and conversely the ion trap provides a valuable link between information theory and physics, with attendant physical insights. Example parameters are given for the case of calcium ions. Passive stabilisation will allow about 200 computing operations on 10 ions; with error correction this can be greatly extended.

quant-ph↗