English
Related papers

Related papers: Magic State Distillation using Asymptotically Good…

200 papers

We construct a pairwise measurement-based code on eight qubits that is error correcting for circuit noise, with fault distance 3. The code can be implemented on a subset of a rectangular array of qubits with nearest neighbor connectivity of…

Quantum Physics · Physics 2024-09-23 Linnea Grans-Samuelsson , David Aasen , Parsa Bonderson

High-fidelity logical \emph{T}-gate realization constitutes a core prerequisite for large-scale fault-tolerant quantum computing. However, conventional magic state distillation requires massive physical qubit overhead across successive…

Quantum Physics · Physics 2026-05-04 Cheng-Yun Ding , Li-Hua Zhang , Jian Zhou

In fault-tolerant quantum circuit synthesis, T gates supplied via magic states dominate space-time cost, while Clifford gates incur negligible overhead. Conventional flows minimize AND count in an {XOR, AND, NOT} basis as a proxy for T,…

Quantum Physics · Physics 2026-05-18 Hanyu Wang , Mingfei Yu , Xinrui Wu , Jason Cong

Quantum information science strives to leverage the quantum-mechanical nature of our universe in order to achieve large improvements in certain information processing tasks. In deep-space optical communications, current receivers for the…

Quantum Physics · Physics 2020-04-16 Narayanan Rengaswamy

Quantum computers are a revolutionary class of computational platforms with applications in combinatorial and global optimization, machine learning, and other domains involving computationally hard problems. While these machines typically…

Quantum Physics · Physics 2026-04-21 Aditya Sodhani , Keshab K. Parhi

Preparing arbitrary logical states is a central primitive for universal fault-tolerant quantum computation and the cost of encoded-state preparation contributes directly to the overall resource overhead. This makes the synthesis of…

Quantum Physics · Physics 2026-05-18 Tom Peham , Matthew Steinberg , Robert Wille , Sascha Heußen

We investigate stabilizer codes with carrier qudits of equal dimension $D$, an arbitrary integer greater than 1. We prove that there is a direct relation between the dimension of a qudit stabilizer code and the size of its corresponding…

Quantum Physics · Physics 2015-03-17 Vlad Gheorghiu

Building upon [arXiv:2509.01224], we present a few methods on how to simulate the non-Clifford $d=5$ magic state cultivation circuits [arXiv:2409.17595] with a sum of $\approx 8$ Clifford ZX-diagrams on average, at $0.1\%$ noise. Compared…

Quantum Physics · Physics 2026-04-03 Kwok Ho Wan , Zhenghao Zhong , Ainhoa Zapirain

Shadow estimation is a sample-efficient protocol for learning the properties of a quantum system using randomized measurements, but the current understanding of qudit shadow estimation is quite limited compared with the qubit setting. Here…

Quantum Physics · Physics 2025-04-30 Chengsi Mao , Changhao Yi , Huangjun Zhu

Resource-efficient and high-precision approximate synthesis of quantum circuits expressed in the Clifford+T gate set is vital for Fault-Tolerant quantum computing. Efficient optimal methods are known for single-qubit RZ unitaries, otherwise…

Quantum Physics · Physics 2026-04-27 Mathias Weiden , Justin Kalloor , John Kubiatowicz , Ed Younis , Costin Iancu

Quantum error correction is believed to be essential for scalable quantum computation, but its implementation is challenging due to its considerable space-time overhead. Motivated by recent experiments demonstrating efficient manipulation…

Entanglement distillation is a well-studied problem in quantum information, where one typically starts with $n$ noisy Bell pairs and distills $k$ Bell pairs of higher fidelity. While distilling Bell pairs is the canonical setting, it is…

Quantum Physics · Physics 2022-03-25 Narayanan Rengaswamy , Ankur Raina , Nithin Raveendran , Bane Vasić

A cluster state is a strongly entangled state, which is a source of measurement-based quantum computation. It is generated by applying controlled-Z (CZ) gates to the state $\left\vert ++\cdots +\right\rangle $. It is protected by the…

Quantum Physics · Physics 2026-02-25 Motohiko Ezawa

Fault-tolerant quantum computation (FTQC) schemes using large block codes that encode $k>1$ qubits in $n$ physical qubits can potentially reduce the resource overhead to a great extent because of their high encoding rate. However, the…

Quantum Physics · Physics 2020-08-04 Yi-Cong Zheng , Ching-Yi Lai , Todd A. Brun , Leong-Chuan Kwek

A fundamental problem in fault-tolerant quantum computation is the tradeoff between universality and dimensionality, exemplified by the the Bravyi-K\"onig bound for $n$-dimensional topological stabilizer codes. In this work, we extend…

Quantum Physics · Physics 2026-05-21 Ryohei Kobayashi , Guanyu Zhu , Po-Shen Hsin

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…

Quantum Physics · Physics 2017-10-05 Ryuji Takagi , Theodore J. Yoder , Isaac L. Chuang

We describe an efficient, fully fault-tolerant implementation of Measurement-Based Quantum Computation (MBQC) in the 3D cluster state. The two key novelties are (i) the introduction of a lattice defect in the underlying cluster state and…

Quantum Physics · Physics 2026-02-11 Gabrielle Tournaire , Marvin Schwiering , Robert Raussendorf , Sven Bachmann

Clifford group lies at the core of quantum computation -- it underlies quantum error correction, its elements can be used to perform magic state distillation and they form randomized benchmarking protocols, Clifford group is used to study…

Quantum Physics · Physics 2022-08-26 Sergey Bravyi , Joseph A. Latone , Dmitri Maslov

We report a resource estimation pipeline that explicitly compiles quantum circuits expressed using the Clifford+T gate set into a surface code lattice surgery instruction set. The cadence of magic state requests from the compiled circuit…

Quantum Physics · Physics 2024-10-28 Tyler LeBlond , Christopher Dean , George Watkins , Ryan S. Bennink

Quantum coherence in a qubit is vulnerable to environmental noise. When long quantum calculation is run on a quantum processor without error correction, the noise often causes fatal errors and messes up the calculation. Here, we propose…