arXiv subjects

Sergey N. Filippov

Publications and source records attributed to Sergey N. Filippov.

At least 19 recordsLinked to original sources

arXiv2026

Experimental implementation of a discrete-time quantum walk on biological networks

Quantum walks provide a versatile framework for probing the structural and dynamical properties of complex systems ranging from biological networks to synthetic materials. However, their realization on current noisy pre-fault-tolerant quantum computers is fundamentally limited by decoherence. Conventional dense encodings of graph structures require prohibitively deep circuits, making them incompatible with existing hardware. Here we introduce an algorithm that leverages symmetry-sector encoding and trades circuit depth for the number of qubits, while integrating symmetry-respecting postselection as an effective noise-mitigation strategy. This combination enables us to execute practical quantum-walk circuits for biological network motifs on actual quantum hardware. We benchmark the proposed methodology against known state-of-the-art circuit architectures, highlighting significant reduction of circuit depth in our approach at the cost of moderate qubit overhead. Utilizing 40 qubits, we implement quantum walks on complex graphs containing up to 17 nodes and 20 edges -- the largest experiment on superconducting hardware to date, with the Hellinger fidelity exceeding 87% throughout 7 steps. We present a proof-of-principle case study that illustrates how experimentally obtained quantum-walk dynamics on a protein-protein-interaction network can be applied to prioritizing disease-associated genes. We discuss the framework scalability in the pre-fault-tolerant era and its potential for studying larger biological networks.

quant-ph↗

arXiv2026

Characterization of Unlearnable Noise with Mid-Circuit-Measurement-Based Cycle Benchmarking

Noise characterization of multi-qubit entangling Clifford operations is a key practical bottleneck for quantum error mitigation and for the calibration, validation, and optimization of quantum error-correction protocols, especially in the presence of state preparation and measurement (SPAM) errors. Although cycle benchmarking can isolate some Pauli error components, it cannot resolve the problem of coupled error parameters, which leads to unlearnable degrees of freedom even in simple noisy gates, not to mention general $n$-qubit Clifford gates. Here we introduce mid-circuit-measurement-based generalized cycle benchmarking, a framework that makes otherwise unidentifiable Pauli fidelities and non-Markovian noise learnable via repeated measurements and classical post-processing. Applying the deferred feed-forward principle to generalized cycle benchmarking, we show that an insertion of mid-circuit measurements can reverse Pauli cycles induced by a general Clifford gate. This fact enables us to reveal a Pauli-noise learnability condition for Clifford gates. Assuming sufficient state preparation quality, we numerically demonstrate the feasibility of characterizing the previously unlearnable noise components. We implement the protocol on superconducting quantum processing units and validate its effectiveness in disambiguating the coupled noise components, benchmarked against conventional tomography. Finally, we observe consistent measurement-induced bit-flip bias and non-Markovian correlations, which define a range of applicability for the Pauli noise model and the proposed noise-characterization protocol.

quant-ph↗

arXiv2026

Repetition-code-based readout error detection and correction across hardware platforms and generations

Readout errors are one of the dominant sources of noise in current quantum processors, limiting both expectation-value estimation and sampling-based applications. Since they affect only the classical measurement outcomes, they can be addressed using classical coding techniques: immediately before measurement, each data qubit is redundantly encoded with ancilla qubits, and the resulting bit string is decoded either by post-selection or by majority voting. Unlike conventional readout error mitigation, which corrects only aggregate quantities such as expectation values, this approach operates on individual measurement shots and can therefore produce approximately corrected samples. We present a systematic cross-platform and cross-generation experimental evaluation of repetition-code readout error detection and correction. We benchmark the same protocol on IBM Heron r1-r3 superconducting processors and Quantinuum H1 and H2 trapped-ion processors while independently varying the code distance, hardware generation, and encoding layout. We find that both error detection and correction improve readout fidelity on every device and generation tested, even as the unencoded baseline improves substantially across successive hardware releases. At the same time, the value of additional redundancy depends strongly on the underlying hardware. On superconducting processors, the extra gate errors introduced by the encoding rapidly offset its benefits, whereas on trapped-ion processors the much lower gate error rates allow larger code distances to remain advantageous.

quant-ph↗

arXiv2025

Myths around quantum computation before full fault tolerance: What no-go theorems rule out and what they don't

In this perspective article, we revisit and critically evaluate prevailing viewpoints on the capabilities and limitations of near-term quantum computing and its potential transition toward fully fault-tolerant quantum computing. We examine theoretical no-go results and their implications, addressing misconceptions about the practicality of quantum error mitigation techniques and variational quantum algorithms. By emphasizing the nuances of error scaling, circuit depth, and algorithmic feasibility, we highlight viable near-term applications and synergies between error mitigation and early fault-tolerant architectures. Our discussion explores strategies for addressing current challenges, such as barren plateaus in variational circuits and the integration of quantum error mitigation and quantum error correction techniques. We aim to underscore the importance of continued innovation in hardware and algorithmic design to bridge the gap between theoretical potential and practical utility, paving the way for meaningful quantum advantage in the era of late noisy intermediate scale and early fault-tolerant quantum devices.

quant-ph↗

arXiv2024

Dynamical simulations of many-body quantum chaos on a quantum computer

Quantum circuits with local unitaries have emerged as a rich playground for the exploration of many-body quantum dynamics of discrete-time systems. While the intrinsic locality makes them particularly suited to run on current quantum processors, the task of verification at non-trivial scales is complicated for non-integrable systems. Here, we study a special class of maximally chaotic circuits known as dual unitary circuits -- exhibiting unitarity in both space and time -- that are known to have exact analytical solutions for certain correlation functions. With advances in noise learning and the implementation of novel error mitigation methods, we show that a superconducting quantum processor with 91 qubits is able to accurately simulate these correlators. We then probe dynamics beyond exact verification, by perturbing the circuits away from the dual unitary point, and compare our results to classical approximations with tensor networks. These results cement error-mitigated digital quantum simulation on pre-fault-tolerant quantum processors as a trustworthy platform for the exploration and discovery of novel emergent quantum many-body phases.

quant-ph↗

arXiv2024

Scalability of quantum error mitigation techniques: from utility to advantage

Error mitigation has elevated quantum computing to the scale of hundreds of qubits and tens of layers; however, yet larger scales (deeper circuits) are needed to fully exploit the potential of quantum computing to solve practical problems otherwise intractable. Here we demonstrate three key results that pave the way for the leap from quantum utility to quantum advantage: (1) we present a thorough derivation of random and systematic errors associated to the most advanced error mitigation strategies, including probabilistic error cancellation (PEC), zero noise extrapolation (ZNE) with probabilistic error amplification, and tensor-network error mitigation (TEM); (2) we prove that TEM (i) has the lowest sampling overhead among all three techniques under realistic noise, (ii) is optimal, in the sense that it saturates the universal lower cost bound for error mitigation, and (iii) is therefore the most promising approach to quantum advantage; (3) we propose a concrete notion of practical quantum advantage in terms of the universality of algorithms, stemming from the commercial need for a problem-independent quantum simulation device. We also establish a connection between error mitigation, relying on additional measurements, and error correction, relying on additional qubits, by demonstrating that TEM with a sufficient bond dimension works similarly to an error correcting code of distance 3. We foresee that the interplay and trade-off between the two resources will be the key to a smooth transition between error mitigation and error correction, and hence between near-term and fault-tolerant quantum computers. Meanwhile, we argue that quantum computing with optimal error mitigation, relying on modest classical computer power for tensor network contraction, has the potential to reach larger scales in accurate simulation than classical methods alone.

quant-ph↗

arXiv2022

Multipartite entanglement to boost superadditivity of coherent information in quantum communication lines with polarization dependent losses

Coherent information quantifies the achievable rate of the reliable quantum information transmission through a communication channel. Use of the correlated quantum states instead of the factorized ones may result in an increase in the coherent information, a phenomenon known as superadditivity. However, even for simple physical models of channels it is rather difficult to detect the superadditivity and find the advantageous multipartite states. Here we consider the case of polarization dependent losses and propose some physically motivated multipartite entangled states which outperform all factorized states in a wide range of the channel parameters. We show that in the asymptotic limit of the infinite number of channel uses the superadditivity phenomenon takes place whenever the channel is neither degradable nor antidegradable. Besides the superadditivity identification, we also provide a method how to modify the proposed states and get a higher quantum communication rate by doubling the number of channel uses. The obtained results give a deeper understanding of coherent information in the multishot scenario and may serve as a benchmark for quantum capacity estimations and future approaches toward an optimal strategy to transfer quantum information.

quant-ph↗

arXiv2022

Collisional open quantum dynamics with a generally correlated environment: Exact solvability in tensor networks

Quantum collision models are receiving increasing attention as they describe many nontrivial phenomena in dynamics of open quantum systems. In a general scenario of both fundamental and practical interest, a quantum system repeatedly interacts with individual particles or modes forming a correlated and structured reservoir; however, classical and quantum environment correlations greatly complicate the calculation and interpretation of the system dynamics. Here we propose an exact solution to this problem based on the tensor network formalism. We find a natural Markovian embedding for the system dynamics, where the role of an auxiliary system is played by virtual indices of the network. The constructed embedding is amenable to analytical treatment for a number of timely problems like the system interaction with two-photon wavepackets, structured photonic states, and one-dimensional spin chains. We also derive a time-convolution master equation and relate its memory kernel with the environment correlation function, thus revealing a clear physical picture of memory effects in the dynamics. The results advance tensor-network methods in the fields of quantum optics and quantum transport.

quant-ph↗

arXiv2022

Multipartite correlations in quantum collision models

Quantum collision models have proved to be useful for a clear and concise description of many physical phenomena in the field of open quantum systems: thermalization, decoherence, homogenization, nonequilibrium steady state, entanglement generation, simulation of many-body dynamics, quantum thermometry. A challenge in the standard collision model, where the system and many ancillas are all initially uncorrelated, is how to describe quantum correlations among ancillas induced by successive system-ancilla interactions. Another challenge is how to deal with initially correlated ancillas. Here we develop a tensor network formalism to address both challenges. We show that the induced correlations in the standard collision model are well captured by a matrix product state (a matrix product density operator) if the colliding particles are in pure (mixed) states. In the case of the initially correlated ancillas, we construct a general tensor diagram for the system dynamics and derive a memory-kernel master equation. Analyzing the perturbation series for the memory kernel, we go beyond the recent results concerning the leading role of two-point correlations and consider multipoint correlations (Waldenfelds cumulants) that become relevant in the higher order stroboscopic limits. These results open an avenue for a further analysis of memory effects in the collisional quantum dynamics.

quant-ph↗

arXiv2021

Riemannian geometry and automatic differentiation for optimization problems of quantum physics and quantum technologies

Optimization with constraints is a typical problem in quantum physics and quantum information science that becomes especially challenging for high-dimensional systems and complex architectures like tensor networks. Here we use ideas of Riemannian geometry to perform optimization on manifolds of unitary and isometric matrices as well as the cone of positive-definite matrices. Combining this approach with the up-to-date computational methods of automatic differentiation, we demonstrate the efficacy of the Riemannian optimization in the study of the low-energy spectrum and eigenstates of multipartite Hamiltonians, variational search of a tensor network in the form of the multiscale entanglement-renormalization ansatz, preparation of arbitrary states (including highly entangled ones) in the circuit implementation of quantum computation, decomposition of quantum gates, and tomography of quantum states. Universality of the developed approach together with the provided open source software enable one to apply the Riemannian optimization to complex quantum architectures well beyond the listed problems, for instance, to the optimal control of noisy quantum systems.

quant-ph↗

arXiv2021

Entanglement robustness in trace decreasing quantum dynamics caused by depolarization and polarization dependent losses

Trace decreasing dynamical maps are as physical as trace preserving ones; however, they are much less studied. Here we overview how the quantum Sinkhorn theorem can be successfully applied to find a two-qubit entangled state which has the strongest robustness against local noises and losses of quantum information carriers. We solve a practically relevant problem of finding an optimal initial encoding to distribute entangled polarized qubits though communication lines with polarization dependent losses and extra depolarizing noise. The longest entanglement lifetime is shown to be attainable with a state that is not maximally entangled.

quant-ph↗

arXiv2021

Trace decreasing quantum dynamical maps: Divisibility and entanglement dynamics

Trace decreasing quantum operations naturally emerge in experiments involving postselection. However, the experiments usually focus on dynamics of the conditional output states as if the dynamics were trace preserving. Here we show that this approach leads to incorrect conclusions about the dynamics divisibility, namely, one can observe an increase in the trace distance or the system-ancilla entanglement although the trace decreasing dynamics is completely positive divisible. We propose solutions to that problem and introduce proper indicators of the information backflow and the indivisibility. We also review a recently introduced concept of the generalized erasure dynamics that includes more experimental data in the dynamics description. The ideas are illustrated by explicit physical examples of polarization dependent losses.

quant-ph↗

arXiv2021

Capacity of trace decreasing quantum operations and superadditivity of coherent information for a generalized erasure channel

Losses in quantum communication lines severely affect the rates of reliable information transmission and are usually considered to be state-independent. However, the loss probability does depend on the system state in general, with the polarization dependent losses being a prominent example. Here we analyze biased trace decreasing quantum operations that assign different loss probabilities to states and introduce the concept of a generalized erasure channel. We find lower and upper bounds for the classical and quantum capacities of the generalized erasure channel as well as characterize its degradability and antidegradability. We reveal superadditivity of coherent information in the case of the polarization dependent losses, with the difference between the two-letter quantum capacity and the single-letter quantum capacity exceeding $7.197 \cdot 10^{-3}$ bit per qubit sent, the greatest value among qubit-input channels reported so far.

quant-ph↗

arXiv2019

Operational restrictions in general probabilistic theories

The formalism of general probabilistic theories provides a universal paradigm that is suitable for describing various physical systems including classical and quantum ones as particular cases. Contrary to the usual no-restriction hypothesis, the set of accessible meters within a given theory can be limited for different reasons, and this raises a question of what restrictions on meters are operationally relevant. We argue that all operational restrictions must be closed under simulation, where the simulation scheme involves mixing and classical post-processing of meters. We distinguish three classes of such operational restrictions: restrictions on meters originating from restrictions on effects; restrictions on meters that do not restrict the set of effects in any way; and all other restrictions. We fully characterize the first class of restrictions and discuss its connection to convex effect subalgebras. We show that the restrictions belonging to the second class can impose severe physical limitations despite the fact that all effects are accessible, which takes place, e.g., in the unambiguous discrimination of pure quantum states via effectively dichotomic meters. We further demonstrate that there are physically meaningful restrictions that fall into the third class. The presented study of operational restrictions provides a better understanding on how accessible measurements modify general probabilistic theories and quantum theory in particular.

quant-ph↗

arXiv2019

Spin polarization-scaling quantum maps and channels

We introduce a spin polarization-scaling map for spin-$j$ particles, whose physical meaning is the decrease of spin polarization along three mutually orthogonal axes. We find conditions on three scaling parameters under which the map is positive, completely positive, entanglement breaking, 2-tensor-stable positive, and 2-locally entanglement annihilating. The results are specified for maps on spin-$1$ particles. The difference from the case of spin-$\frac{1}{2}$ particles is emphasized.

quant-ph↗

arXiv2019

Lower and upper bounds on nonunital qubit channel capacities

Classical capacity of unital qubit channels is well known, whereas that of nonunital qubit channels is not. We find lower and upper bounds on classical capacity of nonunital qubit channels by using a recently developed decomposition technique relating nonunital and unital positive qubit maps.

quant-ph↗

arXiv2019

Quantum informational properties of the Landau-Streater channel

We study the Landau--Streater quantum channel $Φ: \mathcal{B}(\mathcal{H}_d) \mapsto \mathcal{B}(\mathcal{H}_d)$, whose Kraus operators are proportional to the irreducible unitary representation of $SU(2)$ generators of dimension $d$. We establish $SU(2)$ covariance for all $d$ and $U(3)$ covariance for $d=3$. Using the theory of angular momentum, we explicitly find the spectrum and the minimal output entropy of $Φ$. Negative eigenvalues in the spectrum of $Φ$ indicate that the channel cannot be obtained as a result of Hermitian Markovian quantum dynamics. Degradability and antidegradability of the Landau--Streater channel is fully analyzed. We calculate classical and entanglement-assisted capacities of $Φ$. Quantum capacity of $Φ$ vanishes if $d=2,3$ and is strictly positive if $d \geqslant 4$. We show that the channel $Φ\otimes Φ$ does not annihilate entanglement and preserves entanglement of some states with Schmidt rank $2$ if $d \geqslant 3$.

quant-ph↗

arXiv2019

Time deformations of master equations

Convolutionless and convolution master equations are the two mostly used physical descriptions of open quantum systems dynamics. We subject these equations to time deformations: local dilations and contractions of time scale. We prove that the convolutionless equation remains legitimate under any time deformation (results in a completely positive dynamical map) if and only if the original dynamics is completely positive divisible. Similarly, for a specific class of convolution master equations we show that uniform time dilations preserve positivity of the deformed map if the original map is positive divisible. These results allow witnessing different types of non-Markovian behavior: the absence of complete positivity for a deformed convolutionless master equation clearly indicates that the original dynamics is at least weakly non-Markovian; the absence of positivity for a class of time-dilated convolution master equations is a witness of essentially non-Markovian original dynamics.

quant-ph↗