Pavel A. Kamenskikh

We derive a necessary condition of the local equivalence between two-qudit gates in terms of singular values of transformed gate matrices. This condition is valid for arbitrary qudit dimensions $d$ and is thus a relatively simple general way of checking whether two gates can be reduced to one another with single-qudit (local) gates. We use this condition to investigate the local equivalence of two widely used trapped-ion two-qubit gates in qudit space: the Molmer-Sorensen (MS) gate and a special case of the Light-Shift (LS) gate, both of which we studied in one of our previous works.

Here we present the results of benchmarking a quantum processor based on trapped $^{171}$Yb$^{+}$ ions by performing basic quantum machine learning algorithms. Using a quantum-enhanced support vector machine algorithm with up to five qubits we perform a supervised binary classification on two types of datasets: small binary digit images and weighted graphs with a ring topology. For the first dataset, images are intentionally selected so that they could be classified with 100% accuracy. This allows us to specifically examine different types of quantum encodings of the digit dataset and study the impact of experimental noise. In the second dataset, graphs are divided into two categories based on the spectral structure of their Ising Hamiltonian models, which is related to the NP-hard problem. For this problem we consider an embedding of an exponentially large Hamiltonian spectrum into an entangled state of a linear number of qubits. For both problems, we study various levels of circuit optimization and found that, for all experiments conducted, we achieve classifiers with 100% accuracy on both training and testing datasets. This demonstrates that the quantum processor has the ability to correctly solve the basic classification task under consideration. As we expect, with the increase in the capabilities of quantum processors, they can be utilized for solving machine learning tasks.