Nfault-tolerant holonomic quantum computation bookshelf

Pulling a computational flux pair through a not pair. Abstracts qcmc 2016 centre for quantum technologies. Pdf fault tolerance for holonomic quantum computation. Faulttolerant holonomic quantum computation in surface codes. Here, we propose a fast scheme to construct universal quantum gates on superconducting circuits with nonabelian geometric phases using resonant.

Due to its geometric nature, holonomic quantum computation is fault tolerant against certain types of control errors. A quantum information science and technology roadmap. In this way we unify quantum robustness merits of this faulttolerant control scheme, the conventional hqc and decoherencefree subspace, and propose an expedited holonomic quantum computation. However, these methods all have advantages and disadvantages, which are detailed below. Such computation is faulttolerant by its physical nature. Fast holonomic quantum computation on superconducting. Recently shor showed how to perform fault tolerant quantum computation when the error probability is logarithmically small. Measurements can be performed by joining excitations in pairs and observing the result of fusion. Universal holonomic quantum gates over geometric spin qubits with. A twodimensional quantum system with anyonic excitations can be considered as a quantum computer. Holonomic quantum computation quantum information wiley. Especially, geometric phases induced in quantum evolutions have the builtin noiseresilient character, and thus found comprehensive applications in many robust quantum manipulation tasks. Meanwhile, their application to faulttolerant holonomic quantum computing, was proposed, and the geometric phase gate or holonomic. Faulttolerant holonomic quantum computation in surface.

Experimental realization of nonadiabatic holonomic quantum. Expedited holonomic quantum computation via net zeroenergy. In this paper, we will combine the good features of these architectures and avoid their weakness by. We show that universal holonomic quantum computation hqc can be achieved faulttolerantly by adiabatically deforming the gapped stabilizer hamiltonian of. Pdf faulttolerent holonomic quantum computation based. The approach to achieve fault tolerance is based on quantum error correction, in which information is encoded redundantly enabling error detection without. Book of abstracts european quantum technologies conference in. It is well known that surface codes are favorable candidates toward realizing largescale faulttolerant quantum computation. Because of its geometric nature, holonomic quantum computation is fault tolerant against certain types of control errors. We show that universal holonomic quantum computation hqc can be achieved faulttolerantly by adiabatically deforming the.

We explain its w orkings as based on adiabatic dragging of the subsystem containing the logical. Faulttolerant quantum computation with high threshold in. Brun submitted on 16 nov 2014, last revised 4 feb 2015 this version, v4 abstract. Fault tolerant quantum computation with constant error. Demonstrate faulttolerant quantum control of a single logical qubit. A type of quantum bit known as the gottesmankitaevpreskill qubit could be a key ingredient for practical, faulttolerant quantum computers. The phase factor plays a vital role in modern quantum physics. Quantum computing, quantum and quantum logic researchgate, the professional network for scientists. Please join the simons foundation and our generous member organizations in supporting arxiv during our giving campaign september 2327. Unitary transformations can be performed by moving the excitations around each other. We explain how to combine holonomic quantum computation hqc with fault tolerant quantum error correction. In this way we unify quantum robustness merits of this faulttolerant control scheme, the conventional hqc and decoherencefree subspace.

392 813 1335 203 545 1507 939 803 734 1430 392 678 812 1642 1568 640 976 1253 284 1277 214 1146 130 641 1034 133 915