English
Related papers

Related papers: Optimal Short-Circuit Resilient Formulas

200 papers

Quantum error correction offers a promising path to suppress errors in quantum processors, but the resources required to protect logical operations from noise, especially non-Clifford operations, pose a substantial challenge to achieve…

Quantum Physics · Physics 2026-05-01 Dawei Zhong , Todd A. Brun

Understanding fault-tolerant properties of quantum circuits is important for the design of large-scale quantum information processors. In particular, simulating properties of encoded circuits is a crucial tool for investigating the…

Quantum Physics · Physics 2014-11-19 Easwar Magesan , Daniel Puzzuoli , Christopher E. Granade , David G. Cory

A major obstacle towards realizing a practical quantum computer is the noise that arises due to system-environment interactions. While it is very well known that quantum error correction (QEC) provides a way to protect against errors that…

Quantum Physics · Physics 2023-02-24 Akshaya Jayashankar

We present two new positive results for reliable computation using formulas over physical alphabets of size $q > 2$. First, we show that for logical alphabets of size $\ell = q$ the threshold for denoising using gates subject to $q$-ary…

Information Theory · Computer Science 2024-11-28 Andrew K. Tan , Matthew Ho , Isaac L. Chuang

Color code is a promising topological code for fault-tolerant quantum computing. Insufficient research on the color code has delayed its practical application. In this work, we address several key issues to facilitate practical…

Quantum Physics · Physics 2024-06-04 Jiaxuan Zhang , Yu-Chun Wu , Guo-Ping Guo

The hope of the quantum computing field is that quantum architectures are able to scale up and realize fault-tolerant quantum computing. Due to engineering challenges, such ''cheap'' error correction may be decades away. In the meantime, we…

Quantum Physics · Physics 2025-02-17 Rutuja Kshirsagar , Amara Katabarwa , Peter D. Johnson

We show that linear codes combined with rejection sampling can yield a capacity-achieving scheme for simulating additive exchangeable noise channels. Specifically, our scheme achieves an amount of communication within $\log e + 1$ bits from…

Information Theory · Computer Science 2026-01-21 Jianguo Zhao , Cheuk Ting Li

Ancilla systems are often indispensable to universal control of a nearly isolated quantum system. However, ancilla systems are typically more vulnerable to environmental noise, which limits the performance of such ancilla-assisted quantum…

To solve classically hard problems, quantum computers need to be resilient to the influence of noise and decoherence. In such a fault-tolerant quantum computer, noise-induced errors must be detected and corrected in real-time to prevent…

Ultra-Reliable Low-Latency Communications have stringent delay constraints, and hence use codes with small block length (short codewords). In these cases, classical models that provide good approximations to systems with infinitely long…

Information Theory · Computer Science 2021-01-29 Nourhan Hesham , Anas Chaaban

As large language models (LLMs) increasingly integrate native code interpreters, they enable powerful real-time execution capabilities, substantially expanding their utility. However, such integrations introduce potential system-level…

Cryptography and Security · Computer Science 2025-07-28 Gabriel Chua

Proving threshold theorems for fault-tolerant quantum computation is a burdensome endeavor with many moving parts that come together in relatively formulaic but lengthy ways. It is difficult and rare to combine elements from multiple papers…

Quantum Physics · Physics 2025-08-15 Zhiyang He , Quynh T. Nguyen , Christopher A. Pattison

Current hardware for quantum computing suffers from high levels of noise, and so to achieve practical fault-tolerant quantum computing will require powerful and efficient methods to correct for errors in quantum circuits. Here, we explore…

Quantum Physics · Physics 2023-08-16 Aditya Jain , Pavithran Iyer , Stephen D. Bartlett , Joseph Emerson

The robustness to different sources of error of the scheme for non-adiabatic holonomic gates proposed in [New J. Phys. {\bf 14}, 103035 (2012)] is investigated. Open system effects as well as errors in the driving fields are considered. It…

Coherent errors are a dominant noise process in many quantum computing architectures. Unlike stochastic errors, these errors can combine constructively and grow into highly detrimental overrotations. To combat this, we introduce a simple…

Quantum Physics · Physics 2018-12-26 Dripto Debroy , Muyuan Li , Michael Newman , Kenneth R. Brown

The development of robust architectures capable of large-scale fault-tolerant quantum computation should consider both their quantum error-correcting codes, and the underlying physical qubits upon which they are built, in tandem. Following…

Quantum Physics · Physics 2021-10-19 Andrew S. Darmawan , Benjamin J. Brown , Arne L. Grimsmo , David K. Tuckett , Shruti Puri

We introduce crosstalk-robust gate sets, which are obtained using a novel, scalable optimal control problem exploiting locality. Through the suppression of pairwise quantum crosstalk, the gate sets enable robustness that extends to…

We present and analyze protocols for fault-tolerant quantum computing using color codes. We present circuit-level schemes for extracting the error syndrome of these codes fault-tolerantly. We further present an integer-program-based…

Quantum Physics · Physics 2011-08-31 Andrew J. Landahl , Jonas T. Anderson , Patrick R. Rice

This letter introduces a novel channel coding design framework for short-length codewords that permits balancing the tradeoff between the bit error rate floor and waterfall region by modifying a single real-valued parameter. The proposed…

Information Theory · Computer Science 2016-11-17 Mikel Hernaez , Pedro M. crespo , Javier Del Ser

We investigate weakly constrained codes, in which specific patterns occur with prescribed frequencies rather than being strictly forbidden as in conventional constrained coding. We propose a capacity-achieving construction of a weakly…

Information Theory · Computer Science 2026-05-22 Prachi Mishra , Sidharth Jaggi , Navin Kashyap , Michael Langberg
‹ Prev 1 3 4 5 6 7 10 Next ›