122 citations · 243 across the 15 of their papers we have counts for
16 papers
Integrable symplectic maps with a polygon tessellation
Timofey Zolkin, Yaroslav Kharkov, Sergei Nagaitsev
The identification of integrable dynamics remains a formidable challenge, and despite centuries of research, only a handful of examples are known to date. In this article, we explo…
Improved Digital Quantum Simulation by Non-Unitary Channels
W. Gong, Yaroslav Kharkov, Minh C. Tran +2
Simulating quantum systems is one of the most promising avenues to harness the computational power of quantum computers. However, hardware errors in noisy near-term devices remain…
Arline Benchmarks: Automated Benchmarking Platform for Quantum Compilers
Y. Kharkov, A. Ivanova, E. Mikhantiev +1
Efficient compilation of quantum algorithms is vital in the era of Noisy Intermediate-Scale Quantum (NISQ) devices. While multiple open-source quantum compilation and circuit optim…
Discovering hydrodynamic equations of many-body quantum systems
Yaroslav Kharkov, Oles Shtanko, Alireza Seif +4
Simulating and predicting dynamics of quantum many-body systems is extremely challenging, even for state-of-the-art computational methods, due to the spread of entanglement across…
Behavior of Analog Quantum Algorithms
Lucas T. Brady, Lucas Kocia, Przemyslaw Bienias +3
Analog quantum algorithms are formulated in terms of Hamiltonians rather than unitary gates and include quantum adiabatic computing, quantum annealing, and the quantum approximate…
Programmable Quantum Annealers as Noisy Gibbs Samplers
Marc Vuffray, Carleton Coffrin, Yaroslav A. Kharkov +1
Drawing independent samples from high-dimensional probability distributions represents the major computational bottleneck for modern algorithms, including powerful machine learning…