中文
相关论文

相关论文: Anyons from non-solvable finite groups are suffici…

200 篇论文

The ability to perform computations on encrypted data is a powerful tool for protecting privacy. Recently, protocols to achieve this on classical computing systems have been found. Here we present an efficient solution to the quantum…

量子物理 · 物理学 2014-03-05 K. Fisher , A. Broadbent , L. K. Shalm , Z. Yan , J. Lavoie , R. Prevedel , T. Jennewein , K. J. Resch

We propose an effective set of elementary quantum gates which provide an encoded universality and demonstrate the physical feasibility of these gates for the solid-state quantum computer based on the multi-atomic systems in the QED cavity.…

量子物理 · 物理学 2011-09-05 Farid Ablayev , Sergey Andrianov , Sergey Moiseev , Alexander Vasiliev

Models for topological quantum computation are based on braiding and fusing anyons (quasiparticles of fractional statistics) in (2+1)-D. The anyons that can exist in a physical theory are determined by the symmetry group of the Hamiltonian.…

量子物理 · 物理学 2015-03-17 Meagan B. Thompson

A topological quantum computer should allow intrinsically fault-tolerant quantum computation, but there remains uncertainty about how such a computer can be implemented. It is known that topological quantum computation can be implemented…

量子物理 · 物理学 2012-06-22 Ben W. Reichardt

We show how it is possible to realize quantum computations on a system in which most of the parameters are practically unknown. We illustrate our results with a novel implementation of a quantum computer by means of bosonic atoms in an…

量子物理 · 物理学 2007-05-23 J. J. Garcia-Ripoll , J. I. Cirac

This review presents an entry-level introduction to topological quantum computation -- quantum computing with anyons. We introduce anyons at the system-independent level of anyon models and discuss the key concepts of protected fusion…

介观与纳米尺度物理 · 物理学 2017-09-14 Ville Lahtinen , Jiannis K. Pachos

We say that collection of $n$-qudit gates is universal if there exists $N_0\geq n$ such that for every $N\geq N_0$ every $N$-qudit unitary operation can be approximated with arbitrary precision by a circuit built from gates of the…

量子物理 · 物理学 2007-05-23 Gabor Ivanyos

We elucidate the profound connection between physics and computation by proposing and examining the model of the non-Hermitian quantum computer (NQC). In addition to conventional quantum gates such as the Hadamard, phase, and CNOT gates,…

量子物理 · 物理学 2026-04-03 Qi Zhang , Biao Wu

We propose an effective realization of a complete set of elementary quantum gates in the solid-state quantum computer based on the multi-atomic coherent (MAC-) ensembles in the QED cavity. Here, we use the two-ensemble qubit encoding and…

量子物理 · 物理学 2011-11-15 Farid Ablayev , Sergey N. Andrianov , Alexander Vasiliev , Sergey A. Moiseev

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…

量子物理 · 物理学 2007-09-11 Bei Zeng , Andrew Cross , Isaac L. Chuang

Geometric phases induced in quantum evolutions have built-in noise-resilient characters, and thus can find applications in many robust quantum manipulation tasks. Here, we propose a feasible and fast scheme for universal quantum computation…

量子物理 · 物理学 2020-01-31 Sai Li , Tao Chen , Zheng-Yuan Xue

In a previous publication [1] we showed that it is possible to implement universal quantum computation with the anisotropic XY-Heisenberg exchange acting as a single interaction. To achieve this we used encodings of the states of the…

量子物理 · 物理学 2009-11-07 J. Kempe , K. B. Whaley

This paper concerns the efficient implementation of quantum circuits for qudits. We show that controlled two-qudit gates can be implemented without ancillas and prove that the gate library containing arbitrary local unitaries and one…

量子物理 · 物理学 2007-05-23 Gavin K. Brennen , Stephen S. Bullock , Dianne P. O'Leary

Quantum computers allow to solve efficiently certain problems that are intractable for classical computers. For the realization of a quantum computer, a qubit design as the basic building block is a nontrivial starting point. We propose the…

介观与纳米尺度物理 · 物理学 2024-07-11 Shuang Li , Xichao Zhang , Motohiko Ezawa , Yan Zhou

One potential route toward fault-tolerant universal quantum computation is to use non-Abelian topological codes. In this work, we investigate how to achieve this goal with the quantum double model $\mathcal{D}(S_3)$ -- a specific…

量子物理 · 物理学 2025-07-08 Liyuan Chen , Yuanjie Ren , Ruihua Fan , Arthur Jaffe

It is shown that anisotropic spin chains with gapped bulk excitations and magnetically ordered ground states offer a promising platform for quantum computation, which bridges the conventional single-spin-based qubit concept with recently…

介观与纳米尺度物理 · 物理学 2011-10-14 Yaroslav Tserkovnyak , Daniel Loss

Topological quantum computation by way of braiding of Majorana fermions is not universal quantum computation. There are several attempts to make universal quantum computation by introducing some additional quantum gates or quantum states.…

量子物理 · 物理学 2024-07-12 Motohiko Ezawa

Universal quantum entangling gates are a crucial building block in the large-scale quantum computation and quantum communication, and it is an important task to find simple ways to implement them. Here an effective quantum circuit for the…

量子物理 · 物理学 2022-03-31 Wen-Qiang Liu , Hai-Rui Wei , Leong-Chuan Kwek

We propose a set of techniques that enable universal quantum computing to be carried out using dressed states. This applies in particular to the effort of realising quantum computation in trapped ions using long-wavelength radiation, where…

量子物理 · 物理学 2015-05-29 Gatis Mikelsons , Itsik Cohen , Alex Retzker , Martin B. Plenio

Universal quantum computation (UQC) using Majorana fermions on a 2D topological superconducting (TS) medium remains an outstanding open problem. This is because the quantum gate set that can be generated by braiding of the Majorana fermions…

介观与纳米尺度物理 · 物理学 2010-11-25 Jay D. Sau , Sumanta Tewari , S. Das Sarma