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% [1,2]. However, the 2d surface code requires the use of a complex state distillation procedure to achieve universal quantum computation. The colour code of [3] 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%.

Dense, near-surface (within ∼ 10 nm) ensembles of nitrogen-vacancy (NV) centres in diamond are rapidly moving into prominence as the workhorse of a variety of envisaged applications, ranging from the imaging of fast-fluctuating magnetic signals to the facilitation of nuclear hyperpolarisation. Unlike their bulk counterparts, near-surface ensembles suffer from charge stability issues and reduced NV formation efficiency due to the diamond surface's role as a vacancy sink during annealing and an electron sink afterwards. To this end, work is ongoing to determine the best methods for producing high-quality ensembles in this regime. Here we examine the prospects for creating such ensembles cost-effectively by implanting nitrogen-rich type Ib diamond with electron donors, aiming to exploit the high bulk nitrogen density to combat surface-induced band bending in the process. This approach has previously been successful at creating deeper ensembles, however we find that in the near-surface regime there are fewer benefits over nitrogen implantation into pure diamond substrates. Our results suggest that control over diamond surface termination during annealing is key to successfully creating high-yield near-surface NV ensembles generally, and implantation into type Ib diamond may be worth revisiting once that has been accomplished.

Dense, near-surface (within $$\sim 10$$ ∼ 10  nm) ensembles of nitrogen-vacancy (NV) centres in diamond are moving into prominence as the workhorse of many envisaged applications, from the imaging of fast-fluctuating magnetic signals to enacting nuclear hyperpolarisation. Unlike their bulk counterparts, near-surface ensembles suffer from charge stability issues and reduced formation efficiency due to proximity to the diamond surface. Here we examine the prospects for creating such ensembles by implanting nitrogen-rich type Ib diamond, aiming to exploit the high bulk nitrogen density to combat surface-induced band bending. This approach has previously been successful at creating deeper ensembles, however we find that in the near-surface regime there are fewer benefits over nitrogen implantation into pure diamond substrates. Our results suggest that control over diamond surface termination during annealing is key to successfully creating high-yield near-surface NV ensembles generally and implantation into type Ib diamond may be worth revisiting once that has been accomplished. Graphical Abstract

There are two important, and potentially interconnecting, avenues to the realisation of large-scale quantum algorithms: improvement of the hardware, and reduction of resource requirements demanded by algorithm components. In focusing on the latter, one crucial subroutine to many sought-after applications is the quantum adder. A variety of different implementations exist with idiosyncratic pros and cons. One of these, the Draper quantum Fourier adder, offers the lowest qubit count of any adder, but requires a substantial number of gates as well as extremely fine rotations. In this work, we present a modification of the Draper adder which eliminates smallangle rotations to highly coarse levels, matched with some strategic corrections. This reduces hardware requirements without sacrificing the qubit saving. We show that the inherited loss of fidelity is directly given by the rate of carry and borrow bits in the computation. We derive formulae to predict this, complemented by complete gate-level matrix product state simulations of the circuit. Moreover, we analytically describe the effects of possible stochastic control error. We present an in-depth analysis of this approach in the context of Shor's algorithm, focusing on the factoring of RSA-2048. Surprisingly, we find that each of the 7 × 10 7 quantum Fourier transforms may be truncated down to π/64, with additive rotations left only slightly finer. This result is much more efficient than previously realised. We quantify savings both in terms of logical resources and raw magic states, demonstrating that phase adders can be competitive with Toffoli-based constructions.