In this work, we introduce a family of $[[6k,2k,2]]$ codes designed specifically to be compatible with adiabatic quantum computation. These codes support computationally universal sets of weight 2 logical operators and are particularly well suited for implementing dynamical decoupling error suppression. For Hamiltonians embeddable on a planar graph of fixed degree, our encoding maintains a planar connectivity graph and increases the graph degree by only two.In this work, we introduce a family of $[[6k,2k,2]]$ codes designed specifically to be compatible with adiabatic quantum computation. These codes support computationally universal sets of weight 2 logical operators and are particularly well suited for implementing dynamical decoupling error suppression. For Hamiltonians embeddable on a planar graph of fixed degree, our encoding maintains a planar connectivity graph and increases the graph degree by only two.

arXiv:1309.1674Physical Review AApr 16, 201420 citations

Adiabatic Quantum Computation

Catherine C. McGeoch

Synthesis lectures on quantum computingJan 1, 20147 citations

Experimental Adiabatic Quantum Factorization under Ambient Conditions Based on a Solid-State Single Spin System

Kebiao Xu, Tianyu Xie, Zhaokai Li +8 more

The adiabatic quantum computation is a universal and robust method of quantum computing. In this architecture, the problem can be solved by adiabatically evolving the quantum processor from the ground state of a simple initial Hamiltonian to that of a final one, which encodes the solution of the problem. Adiabatic quantum computation has been proved to be a compatible candidate for scalable quantum computation. In this Letter, we report on the experimental realization of an adiabatic quantum algorithm on a single solid spin system under ambient conditions. All elements of adiabatic quantum computation, including initial state preparation, adiabatic evolution (simulated by optimal control), and final state read-out, are realized experimentally. As an example, we found the ground state of the problem Hamiltonian S_{z}I_{z} on our adiabatic quantum processor, which can be mapped to the factorization of 35 into its prime factors 5 and 7.The adiabatic quantum computation is a universal and robust method of quantum computing. In this architecture, the problem can be solved by adiabatically evolving the quantum processor from the ground state of a simple initial Hamiltonian to that of a final one, which encodes the solution of the problem. Adiabatic quantum computation has been proved to be a compatible candidate for scalable quantum computation. In this Letter, we report on the experimental realization of an adiabatic quantum algorithm on a single solid spin system under ambient conditions. All elements of adiabatic quantum computation, including initial state preparation, adiabatic evolution (simulated by optimal control), and final state read-out, are realized experimentally. As an example, we found the ground state of the problem Hamiltonian S_{z}I_{z} on our adiabatic quantum processor, which can be mapped to the factorization of 35 into its prime factors 5 and 7.

arXiv:1611.03293Physical Review LettersMar 30, 201741 citations

Quantum Computation and Adiabatic Evolution

Stefano Olivares

Lecture notes in physicsJan 1, 20250 citations

In this work, we introduce a family of

[[6k,2k,2]]

codes designed specifically to be compatible with adiabatic quantum computation. These codes support computationally universal sets of weight 2 logical operators and are particularly well suited for implementing dynamical decoupling error suppression. For Hamiltonians embeddable on a planar graph of fixed degree, our encoding maintains a planar connectivity graph and increases the graph degree by only two.