English
Related papers

Related papers: Blind topological measurement-based quantum comput…

200 papers

As quantum computers become available through multi-tenant cloud platforms, ensuring privacy against adversaries sharing the same quantum processing unit becomes critical. We introduce and explore \emph{covert quantum computing}, a new…

Quantum Physics · Physics 2026-05-15 Evan J. D. Anderson , Kaushik Datta , Boulat A. Bash

Gate model quantum computers promise to solve currently intractable computational problems if they can be operated at scale with long coherence times and high fidelity logic. Neutral atom hyperfine qubits provide inherent scalability due to…

Quantum computing experiments are transitioning from running on physical qubits to using encoded, logical qubits. Fault-tolerant computation can identify and correct errors, and has the potential to enable the dramatically reduced logical…

Quantum computation is a promising emerging technology, and by utilizing the principles of quantum mechanics, it is expected to achieve faster computations than classical computers for specific problems. There are two distinct architectures…

Quantum Physics · Physics 2025-03-13 Takashi Imoto , Yuki Susa , Ryoji Miyazaki , Yuichiro Matsuzaki

Von Neumann's classic "multiplexing" method is unique in achieving high-threshold fault-tolerant classical computation (FTCC), but has several significant barriers to implementation: i) the extremely complex circuits required by randomized…

Quantum Physics · Physics 2017-07-25 Benjamin Cruikshank , Kurt Jacobs

We prove an accuracy threshold theorem for fault-tolerant quantum computation based on error detection and postselection. Our proof provides a rigorous foundation for the scheme suggested by Knill, in which preparation circuits for ancilla…

Quantum Physics · Physics 2008-02-27 Panos Aliferis , Daniel Gottesman , John Preskill

Topological quantum computers provide a fault-tolerant method for performing quantum computation. Topological quantum computers manipulate topological defects with exotic exchange statistics called anyons. The simplest anyon model for…

Quantum Physics · Physics 2022-04-01 Yuanye Zhu

In principle a 1D array of nearest-neighbour linked qubits is compatible with fault tolerant quantum computing. However such a restricted topology necessitates a large overhead for shuffling qubits and consequently the fault tolerance…

Quantum Physics · Physics 2018-06-12 Ying Li , Simon C. Benjamin

A novel scheme is presented for fault-tolerant quantum computation based on the cluster model. Some relevant logical cluster states are constructed in concatenation by post-selection through verification, without necessity of recovery…

Quantum Physics · Physics 2010-08-24 Keisuke Fujii , Katsuji Yamamoto

A significant branch of classical cryptography deals with the problems which arise when mistrustful parties need to generate, process or exchange information. As Kilian showed a while ago, mistrustful classical cryptography can be founded…

Quantum Physics · Physics 2009-11-07 Adrian Kent

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.…

Quantum Physics · Physics 2018-09-10 Michael Newman , Yaoyun Shi

Recently, Li {\it et al.} [Phys. Rev. Lett. {\bf 107}, 060501 (2011)] have demonstrated that topologically protected measurement-based quantum computation can be implemented on the thermal state of a nearest-neighbor two-body Hamiltonian…

Quantum Physics · Physics 2013-05-30 Keisuke Fujii , Tomoyuki Morimae

To successfully execute large-scale algorithms, a quantum computer will need to perform its elementary operations near perfectly. This is a fundamental challenge since all physical qubits suffer a considerable level of noise. Moreover, real…

Quantum Physics · Physics 2023-06-29 Armands Strikis , Simon C. Benjamin , Benjamin J. Brown

Quantum computers will require encoding of quantum information to protect them from noise. Fault-tolerant quantum computing architectures illustrate how this might be done but have not yet shown a conclusive practical advantage. Here we…

Quantum Physics · Physics 2019-03-01 Robin Harper , Steven T. Flammia

There had been well known claims of unconditionally secure quantum protocols for bit commitment. However, we, and independently Mayers, showed that all proposed quantum bit commitment schemes are, in principle, insecure because the sender,…

Quantum Physics · Physics 2009-10-30 H. -K. Lo , H. F. Chau

We propose a scheme to achieve quantum computation with neutral atoms whose interactions are catalyzed by single photons. Conditional quantum gates, including an $N$-atom Toffoli gate and nonlocal gates on remote atoms, are obtained through…

Quantum Physics · Physics 2009-11-11 L. -M. Duan , B. Wang , H. J. Kimble

Topological measurement-based quantum computation (MBQC) enables one to carry out universal fault-tolerant quantum computation via single-qubit Pauli measurements with a family of large entangled states called cluster states as resources.…

Quantum Physics · Physics 2022-01-06 Seok-Hyung Lee , Hyunseok Jeong

We report on the fault-tolerant operation of logical qubits on a neutral atom quantum computer, with logical performance surpassing physical performance for multiple circuits including Bell states (12x error reduction), random circuits…

We describe a fault-tolerant one-way quantum computer on cluster states in three dimensions. The presented scheme uses methods of topological error correction resulting from a link between cluster states and surface codes. The error…

Quantum Physics · Physics 2007-07-24 R. Raussendorf , J. Harrington , K. Goyal

Designing quantum processors is a complex task that demands advanced verification methods to ensure their correct functionality. However, traditional methods of comprehensively verifying quantum devices, such as quantum process tomography,…

Quantum Physics · Physics 2025-08-04 Keren Li , Peng Yan , Hanru Jiang , Nengkun Yu
‹ Prev 1 8 9 10 Next ›