arXiv subjects

A. G. Fowler

Publications and source records attributed to A. G. Fowler.

26 records · Page 2Linked to original sources

arXiv2009

Graphical algorithms and threshold error rates for the 2d colour code

Recent work on fault-tolerant quantum computation making use of topological error correction shows great potential, with the 2d surface code possessing a threshold error rate approaching 1% (NJoP 9:199, 2007), (arXiv:0905.0531). However, the 2d surface code requires the use of a complex state distillation procedure to achieve universal quantum computation. The colour code of (PRL 97:180501, 2006) is a related scheme partially solving the problem, providing a means to perform all Clifford group gates transversally. We review the colour code and its error correcting methodology, discussing one approximate technique based on graph matching. We derive an analytic lower bound to the threshold error rate of 6.25% under error-free syndrome extraction, while numerical simulations indicate it may be as high as 13.3%. Inclusion of faulty syndrome extraction circuits drops the threshold to approximately 0.1%.

quant-ph↗

arXiv2009

Threshold error rates for the toric and surface codes

The surface code scheme for quantum computation features a 2d array of nearest-neighbor coupled qubits yet claims a threshold error rate approaching 1% (NJoP 9:199, 2007). This result was obtained for the toric code, from which the surface code is derived, and surpasses all other known codes restricted to 2d nearest-neighbor architectures by several orders of magnitude. We describe in detail an error correction procedure for the toric and surface codes, which is based on polynomial-time graph matching techniques and is efficiently implementable as the classical feed-forward processing step in a real quantum computer. By direct simulation of this error correction scheme, we determine the threshold error rates for the two codes (differing only in their boundary conditions) for both ideal and non-ideal syndrome extraction scenarios. We verify that the toric code has an asymptotic threshold of p = 15.5% under ideal syndrome extraction, and p = 7.8 10^-3 for the non-ideal case, in agreement with prior work. Simulations of the surface code indicate that the threshold is close to that of the toric code.

quant-ph↗

arXiv2008

Deterministic optical quantum computer using photonic modules

The optical quantum computer is one of the few experimental systems to have demonstrated small scale quantum information processing. Making use of cavity quantum electrodynamics approaches to operator measurements, we detail an optical network for the deterministic preparation of arbitrarily large two-dimensional cluster states. We show that this network can form the basis of a large scale deterministic optical quantum computer that can be fabricated entirely on chip.

quant-ph↗

arXiv2008

Universal fault tolerant quantum computation on bilinear nearest neighbor arrays

Assuming an array that consists of two parallel lines of qubits and that permits only nearest neighbor interactions, we construct physical and logical circuitry to enable universal fault tolerant quantum computation under the [[7,1,3]] quantum code. A rigorous lower bound to the fault tolerant threshold for this array is determined in a number of physical settings. Adversarial memory errors, two-qubit gate errors, and readout errors are included in our analysis. In the setting where the physical memory failure rate is equal to one-tenth of the physical gate error rate, the physical readout error rate is equal to the physical gate error rate, and the duration of physical readout is ten times the duration of a physical gate, we obtain a lower bound to the asymptotic threshold of 1.96x10^-6.

quant-ph↗

arXiv2006

Gate-level simulation of logical state preparation

Quantum error correction and fault-tolerant quantum computation are two fundamental concepts which make quantum computing feasible. While providing a theoretical means with which to ensure the arbitrary accuracy of any quantum circuit, fault-tolerant error correction is predicated upon the robust preparation of logical states. An optimal direct circuit and a more complex fault-tolerant circuit for the preparation of the [[7,1,3]] Steane logical-zero are simulated in the presence of discrete quantum errors to quantify the regime within which fault-tolerant preparation of logical states is preferred.

quant-ph↗

arXiv2005

Spin transport and quasi 2D architectures for donor-based quantum computing

Through the introduction of a new electron spin transport mechanism, a 2D donor electron spin quantum computer architecture is proposed. This design addresses major technical issues in the original Kane design, including spatial oscillations in the exchange coupling strength and cross-talk in gate control. It is also expected that the introduction of a degree of non-locality in qubit gates will significantly improve the scaling fault-tolerant threshold over the nearest-neighbour linear array.

quant-ph↗

arXiv2004

Global control and fast solid-state donor electron spin quantum computing

We propose a scheme for quantum information processing based on donor electron spins in semiconductors, with an architecture complementary to the original Kane proposal. We show that a naive implementation of electron spin qubits provides only modest improvement over the Kane scheme, however through the introduction of global gate control we are able to take full advantage of the fast electron evolution timescales. We estimate that the latent clock speed is 100-1000 times that of the nuclear spin quantum computer with the ratio $T_{2}/T_{ops}$ approaching the $10^{6}$ level.

quant-ph↗

arXiv2004

Single-spin readout for buried dopant semiconductor qubits

In the design of quantum computer architectures that take advantage of the long coherence times of dopant nuclear and electron spins in the solid-state, single-spin detection for readout remains a crucial unsolved problem. Schemes based on adiabatically induced spin-dependent electron tunnelling between individual donor atoms, detected using a single electron transistor (SET) as an ultra-sensitive electrometer, are thought to be problematic because of the low ionisaton energy of the final D- state. In this paper we analyse the adiabatic scheme in detail. We find that despite significant stabilization due to the presence of the D+, the field strengths required for the transition lead to a shortened dwell-time placing severe constraints on the SET measurement time. We therefore investigate a new method based on resonant electron transfer, which operates with much reduced field strengths. Various issues in the implementation of this method are also discussed.

quant-ph↗