pith. sign in

arxiv: 1511.03316 · v1 · pith:6TAH32SHnew · submitted 2015-11-10 · 🪐 quant-ph · cond-mat.mes-hall· cond-mat.supr-con

Digitized adiabatic quantum computing with a superconducting circuit

classification 🪐 quant-ph cond-mat.mes-hallcond-mat.supr-con
keywords adiabaticproblemsquantumcomputingalgorithmapproachcircuitdigitized
0
0 comments X
read the original abstract

A major challenge in quantum computing is to solve general problems with limited physical hardware. Here, we implement digitized adiabatic quantum computing, combining the generality of the adiabatic algorithm with the universality of the digital approach, using a superconducting circuit with nine qubits. We probe the adiabatic evolutions, and quantify the success of the algorithm for random spin problems. We find that the system can approximate the solutions to both frustrated Ising problems and problems with more complex interactions, with a performance that is comparable. The presented approach is compatible with small-scale systems as well as future error-corrected quantum computers.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.