Daniil Rabinovich

Dr. Daniil Rabinovich


Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
7 July 2021 in Physical Review A
Verified
Journal Article
Closed access
PDF file
VAV. Akshay
V. Akshay
DRDaniil Rabinovich
Daniil Rabinovich
ECE. Campos
E. Campos
Jacob D. BiamonteJacob D. Biamonte
Jacob D. Biamonte
The quantum approximate optimization algorithm (QAOA) has become a cornerstone of contemporary quantum applications development. In QAOA, a quantum circuit is trained—by repeatedly adjusting circuit parameters—to solve a problem instance. Several recent findings have reported parameter concentration effects in QAOA and their presence has become one of folklore: while empirically observed, the concentrations have not been defined and analytical approaches remain scarce, focusing on limiting system sizes while neglecting parameter scaling as system size increases. We found that optimal QAOA circuit parameters concentrate as an inverse polynomial in the problem size, providing an optimistic result for improving circuit training. Our results are analytically demonstrated for QAOA at p=1,2 (corresponding to 2 and 4 tunable parameters, respectively). The technique is also applicable for higher depths wherein the concentration effect is cross verified numerically. Parameter concentrations allow for training on a fraction w<n of qubits to assert that these parameters are nearly optimal on n qubits, thereby reducing training time.

15 September 2021 in Physical Review A
Verified
Journal Article
Closed access
PDF file
ECE. Campos
E. Campos
DRDaniil Rabinovich
Daniil Rabinovich
VAV. Akshay
V. Akshay
Jacob D. BiamonteJacob D. Biamonte
Jacob D. Biamonte
The quantum approximate optimization algorithm (QAOA) is the most studied gate-based variational quantum algorithm today. We train QAOA one layer at a time to maximize overlap with an n qubit target state. Doing so we discovered that such training always saturates—called training saturation—at some depth p*, meaning that past a certain depth, overlap cannot be improved by adding subsequent layers. We formulate necessary conditions for saturation. Numerically, we find layerwise QAOA reaches its maximum overlap at depth p*=n for the problem of state preparation. The addition of coherent dephasing errors to training removes saturation, recovering robustness to layerwise training. This study sheds new light on the performance limitations and prospects of QAOA.

26 July 2022 in Mathematics
Verified
Journal Article
Open access
PDF file
DRDaniil Rabinovich
Daniil Rabinovich
RSRichik Sengupta
Richik Sengupta
ECErnesto Campos
Ernesto Campos
VAVishwanathan Akshay
Vishwanathan Akshay
Jacob D. BiamonteJacob D. Biamonte
Jacob D. Biamonte
The quantum approximate optimisation algorithm is a p layer, time variable split operator method executed on a quantum processor and driven to convergence by classical outer-loop optimisation. The classical co-processor varies individual application times of a problem/driver propagator sequence to prepare a state which approximately minimises the problem’s generator. Analytical solutions to choose optimal application times (called parameters or angles) have proven difficult to find, whereas outer-loop optimisation is resource intensive. Here we prove that the optimal quantum approximate optimisation algorithm parameters for p=1 layer reduce to one free variable and in the thermodynamic limit, we recover optimal angles. We moreover demonstrate that conditions for vanishing gradients of the overlap function share a similar form which leads to a linear relation between circuit parameters, independent of the number of qubits. Finally, we present a list of numerical effects, observed for particular system size and circuit depth, which are yet to be explained analytically.

29 April 2024 in Physical Review A
Verified
Journal Article
Closed access
PDF file
DRDaniil Rabinovich
Daniil Rabinovich
ECErnesto Campos
Ernesto Campos
SASoumik Adhikary
Soumik Adhikary
EPEkaterina Pankovets
Ekaterina Pankovets
DVDmitry Vinichenko
Dmitry Vinichenko
Jacob D. BiamonteJacob D. Biamonte
Jacob D. Biamonte
Variational quantum algorithms are tailored to perform within the constraints of current quantum devices, yet they are limited by performance-degrading errors. In this study we consider a noise model that reflects realistic gate errors inherent to variational quantum algorithms. We investigate the decoherence of a variationally prepared quantum state due to this noise model, which causes a deviation from the energy estimation in the variational approach. By performing a perturbative analysis of optimized circuits, we determine the noise threshold at which the criterion set by the stability lemma is met. We assess our findings against the variational quantum eigensolver and quantum approximate optimization algorithm for various problems with up to 14 qubits. Moreover, we show that certain gate errors have a significantly smaller impact on the coherence of the state, allowing us to reduce the execution time without compromising performance.

1 July 2024 in Physical Review A
Verified
Journal Article
Closed access
PDF file
AUAlexey Uvarov
Alexey Uvarov
DRDaniil Rabinovich
Daniil Rabinovich
OLOlga Lakhmanskaya
Olga Lakhmanskaya
KLKirill Lakhmanskiy
Kirill Lakhmanskiy
JBJacob Biamonte
Jacob Biamonte
SASoumik Adhikary
Soumik Adhikary
Variational quantum algorithms have emerged as a cornerstone of contemporary quantum algorithms research. Practical implementations of these algorithms, despite offering certain levels of robustness against systematic errors, show a decline in performance due to the presence of stochastic errors and limited coherence time. In this work, we develop a recipe for mitigating quantum gate errors using zero-noise extrapolation. We introduce an experimentally amenable method to control error strength in the circuit. We utilize the fact that gate errors in a physical quantum device are distributed inhomogeneously over different qubits and qubit pairs. As a result, one can achieve different circuit error sums based on the manner in which abstract qubits in the circuit are mapped to a physical device. We apply the proposed protocol to variational quantum algorithms and find that the estimated energy is approximately linear with respect to the circuit error sum (CES). Consequently, a linear fit through the energy-CES data, when extrapolated to zero CES, can approximate the energy estimated by a noiseless variational algorithm. We demonstrate this numerically and investigate the applicability range of the technique.

8 January 2025 in Physical Review B
Verified
Journal Article
Closed access
GBG. A. Bobkov
G. A. Bobkov
DRDaniil Rabinovich
Daniil Rabinovich
ABA. M. Bobkov
A. M. Bobkov
IBI. V. Bobkova
I. V. Bobkova