English
Related papers

Related papers: Time-optimal quantum computation

200 papers

Quantum computers can be protected from noise by encoding the logical quantum information redundantly into multiple qubits using error correcting codes. When manipulating the logical quantum states, it is imperative that errors caused by…

We present a method of concatenated quantum error correction in which improved classical processing is used with existing quantum codes and fault-tolerant circuits to more reliably correct errors. Rather than correcting each level of a…

Quantum Physics · Physics 2012-10-26 Zachary W. E. Evans , Ashley M. Stephens

The hopes for scalable quantum computing rely on the "threshold theorem": once the error per qubit per gate is below a certain value, the methods of quantum error correction allow indefinitely long quantum computations. The proof is based…

Quantum Physics · Physics 2014-01-17 M. I. Dyakonov

Fault-tolerant quantum error correction provides a strategy to protect information processed by a quantum computer against noise which would otherwise corrupt the data. A fault-tolerant universal quantum computer must implement a universal…

I discuss how to perform fault-tolerant quantum computation with concatenated codes using local gates in small numbers of dimensions. I show that a threshold result still exists in three, two, or one dimensions when next-to-nearest-neighbor…

Quantum Physics · Physics 2015-06-26 Daniel Gottesman

This study presents a roadmap towards utilizing a single arbitrary gate for universal quantum computing. Since two decades ago, it has been widely accepted that almost any single arbitrary gate with qubit number $>2$ is universal. Utilizing…

Quantum Physics · Physics 2024-10-01 Zhong-Yi Ni , Yu-Sheng Zhao , Jin-Guo Liu

A defining feature in the field of quantum computing is the potential of a quantum device to outperform its classical counterpart for a specific computational task. By now, several proposals exist showing that certain sampling problems can…

Quantum Physics · Physics 2020-09-23 Rawad Mezher , Joe Ghalbouni , Joseph Dgheim , Damian Markham

Achieving reliable performance on early fault-tolerant quantum hardware will depend on protocols that manage noise without incurring prohibitive overhead. We propose a novel framework that integrates quantum computation with the…

Quantum Physics · Physics 2026-03-10 IlKwon Sohn , Changyeol Lee , Wooyeong Song , Kwangil Bae , Wonhyuk Lee

We analyse a model for fault-tolerant quantum computation with low overhead suitable for situations where the noise is biased. The basis for this scheme is a gadget for the fault-tolerant preparation of magic states that enable universal…

Quantum Physics · Physics 2015-12-07 Paul Webster , Stephen D. Bartlett , David Poulin

A major challenge in developing quantum computing technologies is to accomplish high precision tasks by utilizing multiplex optimization approaches, on both the physical system and algorithm levels. Loss functions assessing the overall…

Quantum Physics · Physics 2021-03-03 Zhen Wang , Yanzhu Chen , Zixuan Song , Dayue Qin , Hekang Li , Qiujiang Guo , H. Wang , Chao Song , Ying Li

In this paper, we present efficient quantum algorithms that are exponentially faster than classical algorithms for solving the quantum optimal control problem. This problem involves finding the control variable that maximizes a physical…

Quantum Physics · Physics 2023-10-02 Xiantao Li , Chunhao Wang

How important is fast measurement for fault-tolerant quantum computation? Using a combination of existing and new ideas, we argue that measurement times as long as even 1,000 gate times or more have a very minimal effect on the quantum…

Quantum Physics · Physics 2007-10-09 David P. DiVincenzo , Panos Aliferis

We show that universal quantum computation can be concretely made fault-tolerant without mid-circuit measurements. To this end, we introduce a measurement-free deformation protocol of the Bacon-Shor code to realize a logical $\mathit{CCZ}$…

Quantum Physics · Physics 2025-11-18 Stefano Veroni , Alexandru Paler , Giacomo Giudice

We propose a scheme for the fault-tolerant implementation of arbitrary Clifford circuits. To achieve this, we extend previous work on flag gadgets for syndrome extraction to a general framework that flags any Clifford circuit. This…

Quantum Physics · Physics 2025-10-10 Benjamin Anker , Milad Marvian

It has been known that quantum error correction via concatenated codes can be done with exponentially small failure rate if the error rate for physical qubits is below a certain accuracy threshold. Other, unconcatenated codes with their own…

Quantum Physics · Physics 2008-12-18 Eric Dennis

We give a fault tolerant construction for error correction and computation using two punctured quantum Reed-Muller (PQRM) codes. In particular, we consider the $[[127,1,15]]$ self-dual doubly-even code that has transversal Clifford gates…

Quantum Physics · Physics 2024-11-01 Anqi Gong , Joseph M. Renes

Quantum error correction is a crucial tool for mitigating hardware errors in quantum computers by encoding logical information into multiple physical qubits. However, no single error-correcting code allows for an intrinsically…

We describe a method to execute globally controlled quantum information processing which admits a fault tolerant quantum error correction scheme. Our scheme nominally uses three species of addressable two-level systems which are arranged in…

Quantum Physics · Physics 2007-07-10 J. Fitzsimons , J. Twamley

We construct a fault-tolerant quantum error-correcting protocol based on a qubit encoded in a large spin qudit using a spin-cat code, analogous to the continuous variable cat encoding. With this, we can correct the dominant error sources,…

By taking into account the physical nature of quantum errors it is possible to improve the efficiency of quantum error correction. Here we consider an optimisation to conventional quantum error correction which involves exploiting…

Quantum Physics · Physics 2007-09-26 Z. W. E. Evans , A. M. Stephens , J. H. Cole , L. C. L. Hollenberg