Transversal gates play an important role in the theory of fault-tolerant quantum computation due to their simplicity and robustness to noise. By definition, transversal operators do not couple physical subsystems within the same code block. Consequently, such operators do not spread errors within code blocks and are, therefore, fault tolerant. Nonetheless, other methods of ensuring fault tolerance are required, as it is invariably the case that some encoded gates cannot be implemented transversally. This observation has led to a long-standing conjecture that transversal encoded gate sets cannot be universal. Here we show that the ability of a quantum code to detect an arbitrary error on any single physical subsystem is incompatible with the existence of a universal, transversal encoded gate set for the code.
A long-standing open problem in fault-tolerant quantum computation has been to find a universal set of transversal gates. As three of us proved in arXiv: 0706.1382, such a set does not exist for binary stabilizer codes. Here we generalize our work to show that for subsystem stabilizer codes in $d$ dimensional Hilbert space, such a universal set of transversal gates cannot exist for even one encoded qudit, for any dimension $d$, prime or nonprime. This result strongly supports the idea that other primitives, such as quantum teleportation, are necessary for universal fault-tolerant quantum compu…
Entangled quantum states play an important role in quantum information science and also in quantum mechanics fundamental investigations. Implementation and characterization of techniques allowing for easy preparation of entangled states are important steps in such fields. Here we generated entangled quantum states encoded in photons transversal paths, obtained by pumping a non-linear crystal with multiple transversal Gaussian beams. Such approach allows us to generate entangled states of two qubits and two qutrits encoded in Gaussian transversal path of twin photons. We make a theoretical anal…
Transversal implementations of encoded unitary gates are highly desirable for fault-tolerant quantum computation. Though transversal gates alone cannot be computationally universal, they can be combined with specially distilled resource states in order to achieve universality. We show that "triorthogonal" stabilizer codes, introduced for state distillation by Bravyi and Haah [Phys. Rev. A 86 052329 (2012)], admit transversal implementation of the controlled-controlled-Z gate. We then construct a universal set of fault-tolerant gates without state distillation by using only transversal controll…
Certain quantum codes allow logic operations to be performed on the encoded data, such that a multitude of errors introduced by faulty gates can be corrected. An important class of such operations are {\em transversal}, acting bitwise between corresponding qubits in each code block, thus allowing error propagation to be carefully limited. If any quantum operation could be implemented using a set of such gates, the set would be {\em universal}; codes with such a universal, transversal gate set have been widely desired for efficient fault-tolerant quantum computation. We study the structure of G…
The Eastin-Knill theorem states that no quantum error correcting code can have a universal set of transversal gates. For CSS codes that can implement Clifford gates transversally it suffices to provide one additional non-Clifford gate, such as the T-gate, to achieve universality. Common methods to implement fault-tolerant T-gates like magic state distillation generate a significant hardware overhead that will likely prevent their practical usage in the near-term future. Recently methods have been developed to mitigate the effect of noise in shallow quantum circuits that are not protected by er…
We investigate a scheme of fault-tolerant quantum computation based on the cluster model. Logical qubits are encoded by a suitable code such as the Steane's 7-qubit code. Cluster states of logical qubits are prepared by post-selection through verification at high fidelity level, where the unsuccessful ones are discarded without recovery operation. Then, gate operations are implemented by transversal measurements on the prepared logical cluster states. The noise threshold is improved significantly by making the high fidelity preparation and transversal measurement. It is estimated to be about 3…
A method for the implementation of a universal set of fault-tolerant logical gates is presented using homological product codes. In particular, it is shown that one can fault-tolerantly map between different encoded representations of a given logical state, enabling the application of different classes of transversal gates belonging to the underlying quantum codes. This allows for the circumvention of no-go results pertaining to universal sets of transversal gates and provides a general scheme for fault-tolerant computation while keeping the stabilizer generators of the code sparse.
Active quantum error correction has been identified as a crucial ingredient of future quantum computers, motivating the recent experimental efforts to encode logical quantum bits using small topological codes. In addition to the demonstration of the beneficial role of the encoding, a break-even point in the progress towards large-scale quantum computers will be the implementation of a universal set of gates. This mid-term challenge will soon be faced by various quantum technologies, which urges the need of realistic assessments of their prospects. In this work, we pursue this goal by assessing…
A non-Clifford gate is required for universal quantum computation, and, typically, this is the most error-prone and resource intensive logical operation on an error-correcting code. Small, single-qubit rotations are popular choices for this non-Clifford gate, but certain three-qubit gates, such as Toffoli or controlled-controlled-Z (CCZ), are equivalent options that are also more suited for implementing some quantum algorithms, for instance those with coherent classical subroutines. Here, we calculate error rates and resource overheads for implementing logical CCZ with pieceable fault-toleranc…
We introduce a class of 3D color codes, which we call stacked codes, together with a fault-tolerant transformation that will map logical qubits encoded in two-dimensional (2D) color codes into stacked codes and back. The stacked code allows for the transversal implementation of a non-Clifford $π/8$ logical gate, which when combined with the logical Clifford gates that are transversal in the 2D color code give a gate set which is both fault-tolerant and universal without requiring nonstabilizer magic states. We then show that the layers forming the stacked code can be unfolded and arranged in a…
Transversality is a simple and effective method for implementing quantum computation fault-tolerantly. However, no quantum error-correcting code (QECC) can transversally implement a quantum universal gate set (Eastin and Knill, Phys. Rev. Lett., 102, 110502). Since reversible classical computation is often a dominating part of useful quantum computation, whether or not it can be implemented transversally is an important open problem. We show that, other than a small set of non-additive codes that we cannot rule out, no binary QECC can transversally implement a classical reversible universal ga…
We present a detailed description of an architecture for fault-tolerant quantum computation, which is based on the cluster model of encoded qubits. In this cluster-based architecture, concatenated computation is implemented in a quite different way from the usual circuit-based architecture where physical gates are recursively replaced by logical gates with error-correction gadgets. Instead, some relevant cluster states, say fundamental clusters, are recursively constructed through verification and postselection in advance for the higher-level one-way computation, which namely provides error-pr…
Color codes are a class of topological quantum codes with a high error threshold and large set of transversal encoded gates, and are thus suitable for fault tolerant quantum computation in two-dimensional architectures. Recently, computationally efficient decoders for the color codes were proposed. We describe an alternate efficient iterative decoder for topological color codes, and apply it to the color code on hexagonal lattice embedded on a torus. In numerical simulations, we find an error threshold of 7.8% for independent dephasing and spin flip errors.
We consider a task in which classical information is encoded into a quantum system by an operation restricted by symmetry. The maximum amount of classical information that can be encoded under this restriction, namely the symmetry-restricted classical information capacity, depends on the initial state of the system. Our focus is on whether the capacity of an asymmetric state can be strictly larger than that of any symmetric states, whereas the latter is a strictly positive constant. That is, we ask whether an analog of superdense coding is implementable in the resource theory of asymmetry. We …
The usual scenario in fault tolerant quantum computation involves certain amount of qubits encoded in each code block, transversal operations between them and destructive measurements of ancillary code blocks. We introduce a new approach in which a single code layer is used for the entire computation, in particular a surface code. Qubits can be created, manipulated and non-destructively measured by code deformations that amount to `cut and paste' operations in the surface. All the interactions between qubits remain purely local in a two-dimensional setting.
The implementation of fault-tolerant quantum gates on encoded logic qubits is considered. It is shown that transversal implementation of logic gates based on simple geometric control ideas is problematic for realistic physical systems suffering from imperfections such as qubit inhomogeneity or uncontrollable interactions between qubits. However, this problem can be overcome by formulating the task as an optimal control problem and designing efficient algorithms to solve it. In particular, we can find solutions that implement all of the elementary logic gates in a fixed amount of time with limi…
In the theory of operator quantum error correction (OQEC), the notion of correctability is defined under the assumption that states are perfectly initialized inside a particular subspace, a factor of which (a subsystem) contains the protected information. If the initial state of the system does not belong entirely to the subspace in question, the restriction of the state to the otherwise correctable subsystem may not remain invariant after the application of noise and error correction. It is known that in the case of decoherence-free subspaces and subsystems (DFSs) the condition for perfect un…
Genuine Multipartite Entanglement between Logical Qubits via Cross-Code Lattice Surgery
Universität Innsbruck（因斯布鲁克大学）；Technische Universität Wien（维也纳工业大学）；Institute for Theoretical Physics, University of Innsbruck（因斯布鲁克大学理论物理研究所）；neQxt GmbH（neQxt有限公司）；Alpine Quantum Technologies GmbH（阿尔卑斯量子技术有限公司）
Linear-Time Encodable and Decodable Quantum Error-Correcting Codes
Massachusetts Institute of Technology（麻省理工学院）；Hon Hai (Foxconn) Research Institute（鸿海（富士康）研究院）；University of California at San Diego（加州大学圣地亚哥分校）；CSAIL, Massachusetts Institute of Technology（麻省理工学院计算机科学与人工智能实验室）
We evaluate the usefulness of holographic stabilizer codes for practical purposes by studying their allowed sets of fault-tolerantly implementable gates. We treat them as subsystem codes and show that the set of transversally implementable logical operations is contained in the Clifford group for sufficiently localized logical subsystems. As well as proving this concretely for several specific codes, we argue that this restriction naturally arises in any stabilizer subsystem code that comes close to capturing certain properties of holography. We extend these results to approximate encodings, l…
Fault-tolerant quantum computation is a technique that is necessary to build a scalable quantum computer from noisy physical building blocks. Key for the implementation of fault-tolerant computations is the ability to perform a universal set of quantum gates that act on the code space of an underlying quantum code. To implement such a universal gate set fault-tolerantly is an expensive task in terms of physical operations, and any possible shortcut to save operations is potentially beneficial and might lead to a reduction in overhead for fault-tolerant computations. We show how the automorphis…
In this thesis we examine a variety of techniques for reducing the resources required for fault-tolerant quantum computation. First, we show how to simplify universal encoded computation by using only transversal gates and standard error correction procedures, circumventing existing no-go theorems. We then show how to simplify ancilla preparation, reducing the cost of error correction by more than a factor of four. Using this optimized ancilla preparation, we develop improved techniques for proving rigorous lower bounds on the noise threshold. Additional overhead can be incurred because quantu…
Fast computational primitives for La-cross qLDPC codes
University of Strasbourg（斯特拉斯堡大学）；CNRS, CESQ and ISIS (UMR 7006)（法国国家科学研究中心，量子化学与光谱学与成像中心及信息科学研究所联合研究实验室）；aQCess（量子计算、通信与安全应用中心）；QPerfect SAS（QPerfect公司）；European Center for Quantum Sciences（欧洲量子科学中心）；Institut Universitaire de France (IUF)（法国高等研究院）
Fraunhofer Institute for Industrial Mathematics ITWM（弗劳恩霍夫工业数学研究所）；University of Kaiserslautern（凯泽斯劳滕大学）
In image processing, the amount of data to be processed grows rapidly, in particular when imaging methods yield images of more than two dimensions or time series of images. Thus, efficient processing is a challenge, as data sizes may push even supercomputers to their limits. Quantum image processing promises to encode images with logarithmically less qubits than classical pixels in the image. In theory, this is a huge progress, but so far not many experiments have been conducted in practice, in particular on real backends. Often, the precise conversion of classical data to quantum states, the …
Universal quantum computation with group surface codes
Perimeter Institute for Theoretical Physics（理论物理前沿研究所）；Department of Physics and Astronomy, Purdue University（普渡大学物理与天文系）；Center for Quantum Mathematics & Danish Institute for Advanced Study (Danish IAS), Southern Denmark University（南丹麦大学量子数学中心与丹麦高等研究院）；Purdue Quantum Science and Engineering Institute, Purdue University（普渡大学普渡量子科学与工程研究所）
Engineering logical gates with irrep surface codes
Purdue University（普渡大学）；New York University（纽约大学）；State University of New York at Stony Brook（纽约州立大学石溪分校）；Perimeter Institute for Theoretical Physics（理论物理前沿研究所）；Southern Denmark University（南丹麦大学）
