VKViacheslav Kuzmin

Viacheslav Kuzmin

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Viacheslav Kuzmin has a total of 17 co-authors. Here are the top co-authors by number of shared publications:

  • Alessio Celi

    Center for Quantum Physics, University of Innsbruck, Innsbruck A-6020, Austria

    1 shared publication
  • C. A. Muschik

    Institute for Theoretical Physics, University of Innsbruck, A-6020, Innsbruck, Austria

    1 shared publication
  • Christian Kokail

    Center for Quantum Physics, University of Innsbruck, Innsbruck A-6020, Austria

    1 shared publication
  • Denis V. Vasilyev

    Center for Quantum Physics, University of Innsbruck, 6020 Innsbruck, Austria and Institute for Quantum Optics and Quantum Information of the Austrian Academy of Sciences, 6020 Innsbruck, Austria

    1 shared publication
  • Denis V. Vasilyev

    Center for Quantum Physics, University of Innsbruck, 6020 Innsbruck, Austria

    1 shared publication
  • Lorenzo Pastori

    Center for Quantum Physics, University of Innsbruck, Innsbruck A-6020, Austria

    1 shared publication

Latest Publications

  • Open Access

    Gaussian process model kernels for noisy optimization in variational quantum algorithms

    by L. Arceci, V. Kuzmin, R. van Bijnen

    Variational quantum algorithms (VQAs) aim at solving classical or quantum optimization problems by optimizing parametrized trial states on a quantum device, based on the outcomes of noisy projective measurements. The associated optimization process benefits from an accurate modeling of the cost function landscape using Gaussian process models (GPMs), whose performance is critically affected by the choice of their kernel. Here, we introduce specialized trigonometric kernels, inspired by the observation that typical VQA cost functions display oscillatory behavior with only few frequencies. Appropriate scores to benchmark the reliability of a GPM are defined, and a systematic comparison between different kernels is carried out on prototypical problems from quantum chemistry and combinatorial optimization. We further introduce RotoGP, a sequential line-search optimizer equipped with a GPM, and test how different kernels can help mitigate noise and improve optimization convergence. Overall, we observe that the trigonometric kernels show the best performance in most of the cases under study.

  • Open Access

    Qubit‐Efficient Quantum Local Search for Combinatorial Optimization

    by Mikhail Podobrii, Viacheslav Kuzmin, Vladimir Voloshinov, Margarita Veshchezerova, Michael R. Perelshtein


  • Open Access

    Probing Infinite Many-Body Quantum Systems with Finite-Size Quantum Simulators

    by Viacheslav Kuzmin, Torsten V. Zache, Christian Kokail, Lorenzo Pastori, Alessio Celi, Mikhail Baranov, Peter Zoller

    Experimental studies of synthetic quantum matter are necessarily restricted to approximate ground states prepared on finite-size quantum simulators. In general, this limits their reliability for strongly correlated systems, for instance, in the vicinity of a quantum phase transition (QPT). Here, we propose a protocol that makes optimal use of a given finite-size simulator by directly preparing, on its bulk region, a mixed state representing the reduced density operator of the translation-invariant infinite-sized system of interest. This protocol is based on coherent evolution with a local deformation of the system Hamiltonian. For systems of free fermions in one and two spatial dimensions, we illustrate and explain the underlying physics, which consists of quasiparticle transport towards the system’s boundaries while retaining the bulk “vacuum.” For the example of a nonintegrable extended Su-Schrieffer-Heeger model, we demonstrate that our protocol enables a more accurate study of QPTs. In addition, we demonstrate the protocol for an interacting spinful Fermi-Hubbard model with doping for one-dimensional chains and a small two-leg ladder, where the initial state is a random superposition of energetically low-lying states.


  • Diagrammatic technique for simulation of large-scale quantum repeater networks with dissipating quantum memories

    by Viacheslav V. Kuzmin, Denis V. Vasilyev

    We present a detailed description of the diagrammatic technique for a semianalytical description of large-scale quantum repeater networks devised recently by V. V. Kuzmin et al. [ npj Quantum Inf. 5, 115 (2019)]. The technique takes into account all essential experimental imperfections, including continuous dissipative Liouville dynamics of the network quantum memories and the classical communication delays. The results obtained with the semianalytic method match the exact Monte Carlo simulations while the required computational resources scale only linearly with the network size, thus allowing for precise comparison and optimization of large-scale quantum networks subjected to relevant realistic imperfections. We illustrate the potential of the method by optimizing the secret key rate in one- and two-dimensional quantum networks for a range of network sizes and memory coherence times. The presented approach opens new possibilities for the development and efficient optimization of future quantum networks.


  • Open Access

    Scalable repeater architectures for multi-party states

    by V. V. Kuzmin, D. V. Vasilyev, N. Sangouard, W. Dür, C. A. Muschik

    The vision to develop quantum networks entails multi-user applications, which require the generation of long-distance multi-party entangled states. The current rapid experimental progress in building prototype-networks calls for new design concepts to guide future developments. Here we describe an experimentally feasible scheme implementing a two-dimensional repeater network for robust distribution of three-party entangled states of GHZ type in the presence of excitation losses and detector dark counts — the main sources of errors in real-world hardware. Our approach is based on atomic or solid state ensembles and employs built-in error filtering mechanisms peculiar to intrinsically two-dimensional networks. This allows us to overcome the performance limitation of conventional one-dimensional ensemble-based networks distributing multi-party entangled states and provides an efficient design for future experiments with a clear perspective in terms of scalability.