Clustering into three groups on a quantum processor of five spins S = 1, controlled by pulses of resonant RF fields

Abstract

We consider a quantum processor based on five qutrits represented by spins S=1, which is driven by radio fre-quency (RF) pulses selective in transitions between adjacent levels. Numerical simulation of the implementation of the quantum-adiabatic clustering algorithm was performed on the example of partitioning a set of six points into three groups. We find the amplitudes and durations of rectangular RF pulses, as well as the durations of free evolu-tion intervals in the control pulse sequence, which made it possible to engineer a time-dependent effective Hamilto-nian in the discrete-time approximation. Also we studied the dependence of the implementation fidelity on the pa-rameters. We took quadrupole nuclei as qutrits, but the results obtained will be useful for controlling quantum pro-cessors based on qutrits represented by other systems.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…