English
Related papers

Related papers: MagicPool: Dealing with Magic State Distillation F…

200 papers

Nonstabilizerness, also known as magic, is a crucial resource for quantum computation. The growth in complexity of quantum processing units (QPUs) demands robust and scalable techniques for characterizing this resource. We introduce the…

We propose a method for universal fault-tolerant quantum computation using concatenated quantum error correcting codes. Namely, other than computational basis state preparation as required by the DiVincenzo criteria [1], our scheme requires…

Quantum Physics · Physics 2014-04-02 Tomas Jochym-O'Connor , Raymond Laflamme

It is well known, and appreciated, that quantum computers have the potential to be the most powerful computational devices ever created. This newfound power comes from a quantum parallelism effect that allows the computer to be in multiple…

Quantum Physics · Physics 2007-05-23 Mark A Bashuk

We introduce an error resilient distributed computing method based on an extension of the channel polarization phenomenon to distributed algorithms. The method leverages an algorithmic split operation that transforms two identical compute…

Information Theory · Computer Science 2021-09-10 Mert Pilanci

Noise is in general inevitable and detrimental to practical and useful quantum communication and computation. Under the resource theory framework, resource distillation serves as a generic tool to overcome the effect of noise. Yet,…

Quantum Physics · Physics 2024-06-26 Ting Zhang , Yukun Zhang , Lu Liu , Xiao-Xu Fang , Qian-Xi Zhang , Xiao Yuan , He Lu

Magic-state distillation (or non-stabilizer state manipulation) is a crucial component in the leading approaches to realizing scalable, fault-tolerant, and universal quantum computation. Related to non-stabilizer state manipulation is the…

Quantum Physics · Physics 2020-03-11 Xin Wang , Mark M. Wilde , Yuan Su

Recent theoretical results confirm that quantum theory provides the possibility of new ways of performing efficient calculations. The most striking example is the factoring problem. It has recently been shown that computers that exploit…

Quantum Physics · Physics 2008-11-26 Adriano Barenco

Indefinite causal order is an evolving field with potential involvement in quantum technologies. Here we propose and study one possible scenario of practical application in quantum communication: a compound entanglement distillation…

Quantum Physics · Physics 2023-12-08 Zai Zuo , Michael Hanks , M. S. Kim

The distribution of entangled states of light over long distances is a major challenge in the field of quantum information. Optical losses, phase diffusion and mixing with thermal states lead to decoherence and destroy the non-classical…

Distributed quantum computing can potentially address the scalability challenge by networking processors through photon-mediated remote entanglement. Prior approaches assumed that remote Bell pairs require distillation before use, incurring…

Entanglement distillation, an essential quantum information processing task, refers to the conversion from multiple copies of noisy entangled states to a smaller number of highly entangled states. In this work, we study the non-asymptotic…

Quantum Physics · Physics 2019-10-03 Kun Fang , Xin Wang , Marco Tomamichel , Runyao Duan

The initialization of quantum states or Quantum State Preparation (QSP) is a basic subroutine in quantum algorithms. In the worst case, general QSP algorithms are expensive due to the application of multi-controlled gates required to build…

Fault-tolerant quantum computing based on surface code has emerged as an attractive candidate for practical large-scale quantum computers to achieve robust noise resistance. To achieve universality, magic states preparation is a commonly…

The performance of quantum resource manipulation protocols, including key examples such as distillation of quantum entanglement, is measured in terms of the rate at which desired target states can be produced from a given noisy state.…

Quantum Physics · Physics 2026-05-15 Ludovico Lami , Bartosz Regula , Ryuji Takagi

Previous work has shown that there are two major complexity barriers in the synthesis of fault-tolerant distributed programs: (1) generation of fault-span, the set of states reachable in the presence of faults, and (2) resolving deadlock…

Distributed, Parallel, and Cluster Computing · Computer Science 2009-12-15 Fuad Abujarad , Borzoo Bonakdarpour , Sandeep S. Kulkarni

Fault-tolerant quantum computation on surface codes requires magic states for universal computation. Traditional distillation factories deliver magic states deterministically but consume large areas of logical qubits, forcing static,…

Quantum Physics · Physics 2026-05-20 Steven Hofmeyr , Mathias Weiden , Justin Kalloor , John Kubiatowicz , Costin Iancu

We introduce a method to suppress unwanted transition channels, even without knowing their couplings, and achieve perfect population transfer in multistate quantum systems by the application of composite pulse sequences. Unwanted transition…

Quantum Physics · Physics 2015-06-11 Genko T. Genov , Nikolay V. Vitanov

The distribution and processing of quantum entanglement form the basis of quantum communication and quantum computing. The realization of the two is difficult because quantum information inherently has a high susceptibility to decoherence,…

Quantum Physics · Physics 2012-08-30 Boris Hage , Aiko Samblowski , James DiGuglielmo , Jaromír Fiurášek , Roman Schnabel

One of the remarkable features of quantum mechanics is the ability to ensure secrecy. Private states embody this effect, as they are precisely those multipartite quantum states from which two parties can produce a shared secret that cannot…

Quantum Physics · Physics 2008-10-20 Joseph M. Renes , Jean-Christian Boileau

Quantum computers facing chaos. Quantum parallelism allows to perform computation in a radically new manner. A quantum computer based on these new principles may resolve certain problems exponentially faster than a classical computer. We…

Quantum Physics · Physics 2007-05-23 Bertrand Georgeot , Dima L. Shepelyansky