Towards fault-tolerant quantum computing with minimal resources.

Lead Research Organisation: University of Sheffield
Department Name: Physics and Astronomy

Abstract

This project concerns the future of high-performance computing, which is waiting for a quantum revolution. Advances in conventional processor clock speed have slowed and almost plateaued, and so traditional computer development has shifted to building machines with more cores instead of faster cores. On these multicore machines, many programs can run simultaneously and huge speed-ups are possible when parallel programming. But many computational tasks can not be parallelized or have exponentially growing processing demands. Quantum computing is an entirely different paradigm capable of efficiently dealing with some of these very hard computational tasks. The theory is that through exquisite control of quantum systems, such as individual electrons or photons, we can can execute algorithms following a quantum rather than binary logic. These quantum algorithms need fewer clock cycles than classical counterparts, and even exponentially fewer! The reality is that perfect control of quantum systems is impossible. The UK is home to some of the most advanced quantum computing laboratories, and the Oxford Ion trap group has achieved single processing steps at 99.9% perfection. This might yet be improved to 99.99%, but then unavoidable interactions between Ions and their surrounding make further progress unlikely.

Whilst impressive, this limits us to only a few hundred elementary steps before a catastrophic computational failure. This project develops important fault-tolerance techniques that can, despite inevitable experimental limitations, ensure reliable quantum computations of any length. Fault-tolerance already underpins many modern technologies; it allows lightly scratched Blu-ray discs to play movies, and communication through solar winds to the Voyager spacecraft at the edge of our solar system. This comes at some cost. High-end graphics cards are fault-tolerant but need 12.5% of their memory for this purpose. Fault-tolerant quantum computing is more challenging by nature and has to deal with more errors. Current estimates are upward of 99% of all quantum memory being used to provide fault-tolerance. Providing enough memory for a useful quantum computation would be a monumental engineering challenge.

The aim of this project is find a software solution. To find better approaches to fault tolerance and reduce these monstrous overheads to a more manageable amount. The biggest recent advances have been to use ideas from topology to encode information. Topology is a global feature. The real Earth and a flat Earth would both look flat on an everyday level, but are globally distinct. Quantum information can similarly be stored in global degrees of freedom, without leaving any evidence in local patches. The donut, or torus, topology has been the engine driving improvements in fault-tolerance theory. Before these improvements, the prerequisites for fault-tolerance were so stringent that experiments could not meet them. With the pressing urgency of reducing fault-tolerance overheads, this project again looks to topology for inspiration. This time stranger and more exotic topologies will be used as models upon which to build fault-tolerant quantum computers at lower resource costs. This project will develop numerical simulations of these topologically fault-tolerant computers, to compare different approaches and find the most cost-effective method. For optimal performance, the topology of fault-tolerance software must be reflected in the hardware design of a quantum computers. In collaboration with experimentalists, the project will produce realistic blueprints for the first generation of fault-tolerant quantum computers.

Planned Impact

Fault-tolerance theory is one of the central pillars of quantum computing, and essential to any experimental realizations. As such, immediate academic beneficiaries and commercial beneficiaries include all those developing quantum computing hardware. In particular, I will aid and complement the development of fault-tolerance protocols for the EPSRC funded quantum technology hubs. Through this project I will develop software that would form an essential complement to quantum computing hardware. Furthermore, beginning with my PDRA and collaborators, I will begin to train a larger group of fault-tolerance experts that would form the backbone of future generations of quantum computer software engineers. Beyond my immediate collaborators, I will foster closer ties between the physics, computer science and mathematics communities, through a series of European conferences and workshops on the general theme of fault-tolerant quantum computing.

In the commercial sector companies already invested in quantum computing include IBM, Microsoft, Google, Lockheed Martin, Nokia, Toshiba and Sandia Labs. This list will rapidly grow as quantum computers come closer to market. A primary objective of this project is to present a clear picture of the hardware requirements for fault-tolerant quantum computing, which is essential to help guide both academic and commercial hardware development. The project will also provide sophisticated software necessary to govern the fault-tolerance process. We have seen in the modern IT industry that the value of the software market has substantially outgrown the hardware market. With this in mind, the project will build the foundations of a budding quantum software economy that could thrive quite independently of whether the UK becomes a global exporter of quantum computing hardware.

The research will be exceptionally useful to policy-makers as WP4 assesses just how well UK experimental efforts are doing against the necessary fault-tolerance benchmarks. The project will generate advice on how large a quantum computer must be to compete with traditional computers, and so what timelines are realistic. This will manage expectations of the public and policy makers on realistic time scales in what is often an over-hyped area. This information will be communicated through public talks, exhibitions and visual media developed to portray the ideas behind fault-tolerance quantum computing.

Publications

10 25 50
 
Description Quantum technologies require that fragile quantum information can be stored for long periods of time. We devised a new technique, which we called a "cellular automata decoding" that works with topological quantum memories. The novel aspect is that it enables quantum devices to be built where the classical control electronics are very simple, and can feasibly be built "on chip" for fast performance.

Better performance is possible using error correcting codes other than the toric code, and we have found that semi-hyperbolic surface codes are a promising alternative.

Entanglement is the quintessential quantum resource used for secure (quantum) communication and other applications. Devices producing a source of entanglement will typically be noisy and also suffer from some unwanted correlations between entangled pairs. Standard distillation methods reduce noise, but are venerable to unwanted correlated. We devised new techniques for analysing and reducing any unwanted correlations, eliminating this vulnerability from quantum cryptographic networks.

Performing quantum computation on information stored within an error-correction code requires special techniques, such as preparation of magic state and circuit compiling. These techniques come with an associated resource overhead so that over 90% of a quantum computer is dedicated to these processing tasks. In a series of papers, we made significant innovations in this area that provided new protocols for distilling exotic magic states and new tools for circuit optimisation. These results set a new state-of-the-art in the field and combined reduce the resource overhead of quantum computing by over an order of magnitude.

We have developed several new approaches to circuit optimisation. This includes work on CNOT+T circuit optimisers that cut costs of some benchmark circuits by a factor 2. We have found new random compiling methods that have lead to significant speedups of quantum computers, especially for quantum chemistry applications, which could offer several orders of magnitude improvement.

The project has also yielded new techniques for simulating/validating quantum circuits which have been demoed on 50 qubit systems beyond the reach of previous simulators, including our joint project with IBM research.

The fellowship lead to the development of random compiler techniques that have applications to quantum chemistry.
Exploitation Route Key findings are important stepping stones within the wider research programme, and may play a role within later development of blueprints for quantum devices. However, further research is required first.
Sectors Digital/Communication/Information Technologies (including Software)

 
Description As part of our collaboration with IBM, we developed classical simulation tools to be incorporated into their QISkit platform, which has over 85 thousand users. The documentation can be found here https://qiskit.org/documentation/tutorials/simulators/6_extended_stabilizer_tutorial.html and the simulation techniques are an implementation of the ideas published in the paper Simulation of quantum circuits by low-rank stabilizer decompositions by Bravyi, Browne, Calpin, Campbell, Gosset & Howard, 2018, Quantum 3, 181 (2019). This work significantly impacted the research direction of the field, collecting 126 citations 2019-2022 and inspiring many follow up works. The paper "Random compiler for fast Hamiltonian simulation" Physical review letters 123 (7), 070503 invented a novel "random compiler" approach to quantum algorithms. It is the first algorithm (qDRIFT) to achieve a runtime complexity that is independent of the number of Hamiltonian terms. This work significantly impact the direction of quantum algorithms research, collecting 124 citations 2019-2022 with many of those citations directly building on the qDRIFT algorithm. It is available in QISKIT as a part of their algorithms library https://qiskit.org/documentation/stubs/qiskit.opflow.evolutions.QDrift.html. The paper "Application of a resource theory for magic states to fault-tolerant quantum computing" Physical Review Letters 118 (9), 090501, started a subfield of research connecting error correction protocols and resource theories. It has been cited 149 times 2017-2022 and had a substantial impact on the research direction of the field. The paper An efficient quantum compiler that reduces T count Quantum Science and Technology 4 (1), 015004, reformulated circuit compilation problems in terms of a tensor contraction problem and provided heuristic Clifford+T compiler for solving the problem. This work has gone on to inspire many other Clifford+T compilers, including several used in industry, especially by the team at Cambridge Quantum computing.
First Year Of Impact 2018
Sector Digital/Communication/Information Technologies (including Software)
Impact Types Cultural,Economic

 
Description QCDA network
Amount £1,300,000 (GBP)
Funding ID EP/R043825/1 
Organisation Engineering and Physical Sciences Research Council (EPSRC) 
Sector Public
Country United Kingdom
Start 02/2018 
End 02/2021
 
Title Data from Quantum algorithms for CSPs (07-2019) 
Description Quantum algorithms can deliver asymptotic speedups over their classical counterparts. However, there are few examples known where a substantial quantum speedup has been worked out in detail for reasonably-sized problems, when compared with the best classical algorithms and taking into account realistic hardware parameters and overheads for fault-tolerance. All known examples of such speedups correspond to problems related to simulation of quantum systems and cryptography. In this project we apply general-purpose quantum algorithms for solving constraint satisfaction problems to two families of prototypical NP-complete problems: boolean satisfiability and graph colouring. We consider two quantum approaches: Grover's algorithm and a quantum algorithm for accelerating backtracking algorithms. The data stored in the repository is numerical results from computational experiments, as well as corresponding source code. 
Type Of Material Database/Collection of data 
Year Produced 2019 
Provided To Others? Yes  
 
Title Source code and experimental results from Applying quantum algorithms to CSPs (10-2018) 
Description Quantum algorithms can deliver asymptotic speedups over their classical counterparts. However, there are few examples known where a substantial quantum speedup has been worked out in detail for reasonably-sized problems, when compared with the best classical algorithms and taking into account realistic hardware parameters and overheads for fault-tolerance. All known examples of such speedups correspond to problems related to simulation of quantum systems and cryptography. In this project we apply general-purpose quantum algorithms for solving constraint satisfaction problems to two families of prototypical NP-complete problems: boolean satisfiability and graph colouring. We consider two quantum approaches: Grover's algorithm and a quantum algorithm for accelerating backtracking algorithms. The data stored in the repository comprises numerical results from computational experiments, as well as corresponding source code. 
Type Of Material Database/Collection of data 
Year Produced 2018 
Provided To Others? Yes  
 
Description IBM - NQIT - Sheffield project on classical simulation of quantum circuits 
Organisation IBM
Department IBM T. J. Watson Research Center, Yorktown Heights
Country United States 
Sector Private 
PI Contribution Myself and Mark Howard worked with Sergey Bravyi and David Gosset at IBM research, and later we also brought on board Dan Browne and Padraic Calpin (University College London). We devised new approaches to classically simulating "near-Clifford" quantum circuits and developed software to be incorporated into IBM QISkit and made openly available.
Collaborator Contribution This was an industrial partnership supported (in-kind) by IBM, by Sheffield Impact acceleration account and Oxford's NQIT quantum computing hub.
Impact The project resulted in a preprint https://arxiv.org/abs/1808.00128 that is currently under review at a journal. It also generated open source software that is being integrated into IBM's quantum computing software platform QISkit https://qiskit.org/
Start Year 2018