arXiv subjects

Evgeny Anikin

Publications and source records attributed to Evgeny Anikin.

4 recordsLinked to original sources

arXiv2025

Fast Mølmer-Sørensen gates in trapped-ion quantum processors with compensated carrier transition

Carrier transition is one of the major factors hindering the high-speed implementation of the Mølmer-Sørensen gates in trapped-ion quantum processors. We present an approach to design laser pulse shapes for the Mølmer-Sørensen gate in ion chains which accounts for the effect of carrier transition on qubit-phonon dynamics. We show that the fast-oscillating carrier term effectively modifies the spin-dependent forces acting on ions, and this can be compensated by a simple nonlinear transformation of a laser pulse. Using numerical simulations for short ion chains and perturbation theory for longer chains up to $20$ ions, we demonstrate that our approach allows to reach the infidelity below $10^{-4}$ while keeping the gate duration of the order of tens of microseconds.

quant-ph↗

arXiv2024

Surface trap with adjustable ion couplings for scalable and parallel gates

We describe the design and operation of a surface-electrode Paul trap for parallel entangling gate implementation. In particular, we demonstrate the possibility of separating or coupling ion motion by adjusting the DC-voltages on a set of electrodes and show the possibility of parallel MS-gate operations for specific voltage configurations. We verify the scalability of this approach and characterize the performance of these gates in the presence of the finite phonon mode occupation and of the finite drift of the phonon frequencies. Additionally, we investigate how the number of ions per individual trapping site and anharmonic potential terms affect the coupling between the wells.

quant-ph↗

arXiv2023

Individual addressing of ion qubits with counter-propagating optical frequency combs

We propose a new method of individual single-qubit addressing of linear trapped-ion chains utilizing two ultrastable femtosecond frequency combs. For that, we suggest implementing the single-qubit gates with two counter-propagating frequency combs overlapping on the target ion and causing the AC Stark shift between the qubit levels. With analytical calculations and numerical modeling, we show that the arbitrary single-qubit rotations can be indeed realized using only laser fields propagating along the ion chain. We analyze the error sources for the proposed addressing method and prove that it allows implementing the single-qubit gates with high fidelity.

quant-ph↗

arXiv2022

Ion native variational ansatz for quantum approximate optimization

Variational quantum algorithms involve training parameterized quantum circuits using a classical co-processor. An important variational algorithm, designed for combinatorial optimization, is the quantum approximate optimization algorithm. Realization of this algorithm on any modern quantum processor requires either embedding a problem instance into a Hamiltonian or emulating the corresponding propagator by a gate sequence. For a vast range of problem instances this is impossible due to current circuit depth and hardware limitations. Hence we adapt the variational approach -- using ion native Hamiltonians -- to create ansatze families that can prepare the ground states of more general problem Hamiltonians. We analytically determine symmetry protected classes that make certain problem instances inaccessible unless this symmetry is broken. We exhaustively search over six qubits and consider upto twenty circuit layers, demonstrating that symmetry can be broken to solve all problem instances of the Sherrington-Kirkpatrick Hamiltonian. Going further, we numerically demonstrate training convergence and level-wise improvement for up to twenty qubits. Specifically these findings widen the class problem instances which might be solved by ion based quantum processors. Generally these results serve as a test-bed for quantum approximate optimization approaches based on system native Hamiltonians and symmetry protection.

quant-ph↗