Sequences of selective rotation operators to engineer interactions for quantum annealing on three qutrits

@inproceedings{Zobov2019SequencesOS,
  title={Sequences of selective rotation operators to engineer interactions for quantum annealing on three qutrits},
  author={V. E. Zobov and I. S. Pichkovskiy},
  booktitle={International Conference on Micro- and Nano-Electronics},
  year={2019}
}
We have done simulating of factorization the number 15 on three qutrits, represented by the spins S = 1, by quantum annealing. We assume that strong one-spin interaction allow selectively operate on different transitions between levels of the each qutrit. We present a sequence of selective rotation operators to engineer from dipole-dipole interaction a timedependent effective Hamiltonian necessary for solving the problem. Also we find dependence of fidelity versus different parameters: magnetic… 
3 Citations
Sequences of selective rotation operators for three group clustering on qutrits by means of quantum annealing
Recently, it was demonstrated1 that the clustering considered in this articlec, which consists in partitioning a set of data points into subsets depending on the proximity of some properties, can be
Associative memory on qutrits by means of quantum annealing
TLDR
This paper studies the function of associative memory using three-level quantum elements—qutrits, represented by spins with S  = 1, and recalls the state corresponding to one of the patterns recorded in the memory, or superposition of such states by means of quantum annealing.
Clustering by quantum annealing on the three-level quantum elements qutrits
TLDR
The simulation has shown that the clustering problem can be effectively solved on qutrits represented by the spins S = 1, and the advantages of clustering on qUTrits over that on qubits have been demonstrated.

References

SHOWING 1-10 OF 27 REFERENCES
Implementation of a quantum adiabatic algorithm for factorization on two qudits
Implementation of an adiabatic quantum algorithm for factorization on two qudits with the number of levels d1 and d2 is considered. A method is proposed for obtaining a time-dependent effective
Dynamical Engineering of Interactions in Qudit Ensembles.
TLDR
This work presents a 6-pulse sequence that decouples effective spin-1 dipolar interactions and demonstrates that a spin- 1 Ising chain can be engineered to study transitions among three distinct symmetry protected topological phases.
Quantum information processing by NMR: preparation of pseudopure states and implementation of unitary operations in a single-qutrit system
Theoretical Quantum Information Processing (QIP) has matured from the use of qubits to the use of qudits (systems having states >2). Whereas most of the experimental implementations have been
Quantum simulation of a three-body-interaction Hamiltonian on an NMR quantum computer
Extensions of average Hamiltonian theory to quantum computation permit the design of arbitrary Hamiltonians, allowing rotations throughout a large Hilbert space. In this way, the kinematics and
Experimental implementation of an adiabatic quantum optimization algorithm.
TLDR
A nuclear magnetic resonance computer with three quantum bits that simulates an adiabatic quantum optimization algorithm that agrees well with the prediction of a simple decoherence model is reported.
A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
TLDR
For the small examples that the authors could simulate, the quantum adiabatic algorithm worked well, providing evidence that quantum computers (if large ones can be built) may be able to outperform ordinary computers on hard sets of instances of NP-complete problems.
Qutrit quantum computer with trapped ions
TLDR
This work focuses its attention on a universal two-qutrit gate, which corresponds to a controlled-NOT gate between qutrits, which can be decomposed into a sequence of these gates for performing the quantum Fourier transform for n qUTrits.
Quantum annealing – foundations and frontiers
We briefly review various computational methods for the solution of optimization problems. First, several classical methods such as Metropolis algorithm and simulated annealing are discussed. We
Quantum annealing of a disordered magnet
TLDR
Thermal and quantum annealing are compared in a model disordered magnet, where the effects of quantum mechanics can be tuned by varying an applied magnetic field, and the results indicate that quantumAnnealing hastens convergence to the optimum state.
Factoring with Qutrits: Shor's Algorithm on Ternary and Metaplectic Quantum Architectures
TLDR
The cost of performing Shor's algorithm for integer factorization on a ternary quantum computer is determined using two natural models of universal fault-tolerant computing: a model based on magic state distillation and a modelbased on a metaplectic topological quantum computer.
...
...