Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2308.03875 · Physica Scripta

Stability verification of quantum non-i.i.d. sources

Esteban Martínez-Vargas

Published Apr 22, 2024• 0 citations
arXivHTMLPDF

Abstract

Abstract We introduce the problem of stability verification of quantum sources which are non-i.i.d.. The problem consists in ascertaining whether a given quantum source is stable or not, in the sense that it produces always a desired quantum state or if it suffers deviations. Stability is a statistical notion related to the sparsity of errors. This problem is closely related to the problem of quantum verification first proposed by Pallister et al (2018 Phys. Rev. Lett. 120), however, it extends the notion of the original problem. We introduce a family of states that come from these non-i.i.d. sources which we call a Markov state. These sources are more versatile than the i.i.d. ones as they allow statistical deviations from the norm instead of the more coarse previous approach. We prove in theorem 1 that the Markov states are not well described with tensor products over a changing source. In theorem 2 we further provide a lower bound on the trace distance between two Markov states, or conversely, an upper bound on the fidelity between these states. This is a bound on the capacity of determining the stability property of the source, which shows that it is exponentially easier to ascertain this with respect to n, the number of outcomes from the source.

DOI
10.1088/1402-4896/ad41a1

Related papers

Limitations of local update recovery in stabilizer-GKP codes: a quantum optimal transport approach

Robert König, Cambyse Rouzé

Local update recovery seeks to maintain quantum information by applying local correction maps alternating with and compensating for the action of noise. Motivated by recent constructions based on quantum LDPC codes in the finite-dimensional setting, we establish an analytic upper bound on the fault-tolerance threshold for concatenated GKP-stabilizer codes with local update recovery. Our bound applies to noise channels that are tensor products of one-mode beamsplitters with arbitrary environment states, capturing, in particular, photon loss occurring independently in each mode. It shows that for loss rates above a threshold given explicitly as a function of the locality of the recovery maps, encoded information is lost at an exponential rate. This extends an early result by Razborov from discrete to continuous variable (CV) quantum systems. To prove our result, we study a metric on bosonic states akin to the Wasserstein distance between two CV density functions, which we call the bosonic Wasserstein distance. It can be thought of as a CV extension of a quantum Wasserstein distance of order 1 recently introduced by De Palma et al. in the context of qudit systems, in the sense that it captures the notion of locality in a CV setting. We establish several basic properties, including a relation to the trace distance and diameter bounds for states with finite average photon number. We then study its contraction properties under quantum channels, including tensorization, locality and strict contraction under beamsplitter-type noise channels. Due to the simplicity of its formulation, and the established wide applicability of its finite-dimensional counterpart, we believe that the bosonic Wasserstein distance will become a versatile tool in the study of CV quantum systems.

arXiv:2309.16241•Sep 28, 2023•2 citations

Polynomial-time certification of fidelity for many-body mixed states and mixed-state universality classes

Yuhan Liu, Yijian Zou

Computation of Uhlmann fidelity between many-body mixed states generally involves full diagonalization of exponentially large matrices. In this work, we introduce a polynomial-time algorithm to compute certified lower and upper bounds for the fidelity between matrix product density operators (MPDOs). Our method maps the fidelity estimation problem to a variational optimization of sequential quantum circuits, allowing for systematic improvement of the lower bounds by increasing the circuit depth. Complementarily, we obtain certified upper bounds on fidelity by variational lower bounds on the trace distance through the same framework. We demonstrate the power of this approach with two examples: fidelity correlators in critical mixed states, and codeword distinguishability in an approximate quantum error-correcting code. Remarkably, the variational lower bound accurately track the universal scaling behavior of the fidelity with a size-consistent relative error, allowing for the extraction of previously unknown critical exponents. Our results offer an exponential improvement in precision over known moment-based bounds and establish a scalable framework for the verification of many-body quantum systems.

quant-pharXiv:2601.13333•Jan 21, 2026•4 citations

Cross-verification of independent quantum devices

Chiara Greganti, Tommaso F. Demarie, Martin Ringbauer +13 more

Today’s intermediate-scale quantum devices are on the brink of outperforming their classical counterparts. Yet these devices remain noisy, and with no trusted classical computers to check their results, we are left with a dire need to verify that they indeed perform as intended. The standard approach to this problem is to benchmark the performance of the individual building blocks using techniques such as quantum process tomography or randomized benchmarking and then extrapolate to the full system. In practice, however, such an extrapolation can be unreliable due to non-Markovian effects, unmodelled stray noise or temporally and spatially correlated noise. Hence, there is a need for full-system verification techniques able to capture every source of noise and imperfection.

Conference on Lasers and Electro-Optics Europe & European Quantum Electronics Conference (CLEO/Europe-EQEC)•Jun 21, 2021•2 citations

Genuine and Non-Genuine Quantum Non-Markovianity: A Unified Information-Theoretic Review

Rajeev Gangwar, Ujjwal Sen

Understanding whether the features of open quantum dynamics are genuinely quantum remains a central challenge in quantum dynamics. Even though the non-Markovian behavior of quantum dynamics has been widely investigated across different settings, there is still no consensus on which properties of a dynamics reflect genuine quantum features and which arise from classical or non-genuine quantum sources. In this review, we provide detailed information on recent developments in characterizing quantum non-Markovianity based on information backflow and the nature of its origin. We also present a survey on how various approaches separate classical and quantum contributions, as well as how they define operational tasks that reveal genuine quantum non-Markovianity. We analyze several frameworks, including state-distinguishability -based, channel-based (``CP-divisibility''), and process-tensor methods. For each framework, we outline the underlying physical motivation, the criteria proposed to distinguish genuine quantum non-Markovianity from practical or apparent memory effects. We further compare different approaches and their strengths and limitations. The review aims to clarify the conceptual and operational aspects of quantum non-Markovian processes based on their nature and to provide a foundation for future research on quantum non-Markovianity and its role in advancing quantum information science and technology.

quant-pharXiv:2603.28277•Mar 31, 2026•2 citations

Quantifying Non-Markovianity in Open Quantum Dynamics

Chu Guo

Characterization of non-Markovian open quantum dynamics is both of theoretical and practical relevance. In a seminal work [Phys. Rev. Lett. 120, 040405 (2018)], a necessary and sufficient quantum Markov condition is proposed, with a clear operational interpretation and correspondence with the classical limit. Here we propose two non-Markovianity measures for general open quantum dynamics, which are fully reconciled with the Markovian limit and can be efficiently calculated based on the multi-time quantum measurements of the system. A heuristic algorithm for reconstructing the underlying open quantum dynamics is proposed, whose complexity is directly related to the proposed non-Markovianity measures. The non-Markovianity measures and the reconstruction algorithm are demonstrated with numerical examples, together with a careful reexamination of the non-Markovianity in quantum dephasing dynamics.

arXiv:2205.05970•SciPost Physics•Aug 19, 2022•15 citations

Stabilizer Ranks, Barnes Wall Lattices and Magic Monotones

Amolak Ratan Kalra, Pulkit Sinha

In 2024, Kliuchnikov and Schönnenbeck showed a connection between the Barnes Wall lattices, stabilizer states and Clifford operations. In this work, we study their results and relate them to the problem of lower bounding stabilizer ranks. We show the first quantitative lower bound on stabilizer fidelity as a function of stabilizer ranks, which reproduces the linear-by-log lower bound for χ δ ( | H ⟩ ⊗ n ) , i.e, on the approximate stabilizer rank of | H ⟩ ⊗ n . In fact, we show that the lower bound holds even when the fidelity between the approximation and | H ⟩ ⊗ n is exponentially small, which is currently the best lower bound in this regime.Next, we define a new magic monotone for pure states, the Barnes Wall norm, and its corresponding approximate variant. We upper bound these monotones by the C S -count of state preparation, and also by the stabilizer ranks. In particular, the upper bound given by the C S -count is tight, in the sense that we exhibit states that achieve the bound.Apart from these results, we give a Fidelity Amplification algorithm, which provides a trade-off between approximation error and the stabilizer rank. As a corollary, it gives us a way to compose approximate stabilizer decompositions into approximate decompositions of their tensor products.Finally, we provide an alternate, elementary proof of the existence and density of product states with maximal stabilizer ranks, which was first proven by Lovitz and Steffan (2022), where they used results from algebraic geometry.

arXiv:2503.04101•Quantum•Jul 29, 2026•4 citations
Abstract We introduce the problem of stability verification of quantum sources which are non-i.i.d.. The problem consists in ascertaining whether a given quantum source is stable or not, in the sense that it produces always a desired quantum state or if it suffers deviations. Stability is a statistical notion related to the sparsity of errors. This problem is closely related to the problem of quantum verification first proposed by Pallister et al (2018 Phys. Rev. Lett. 120), however, it extends the notion of the original problem. We introduce a family of states that come from these non-i.i.d. sources which we call a Markov state. These sources are more versatile than the i.i.d. ones as they allow statistical deviations from the norm instead of the more coarse previous approach. We prove in theorem 1 that the Markov states are not well described with tensor products over a changing source. In theorem 2 we further provide a lower bound on the trace distance between two Markov states, or conversely, an upper bound on the fidelity between these states. This is a bound on the capacity of determining the stability property of the source, which shows that it is exponentially easier to ascertain this with respect to n, the number of outcomes from the source.
Local update recovery seeks to maintain quantum information by applying local correction maps alternating with and compensating for the action of noise. Motivated by recent constructions based on quantum LDPC codes in the finite-dimensional setting, we establish an analytic upper bound on the fault-tolerance threshold for concatenated GKP-stabilizer codes with local update recovery. Our bound applies to noise channels that are tensor products of one-mode beamsplitters with arbitrary environment states, capturing, in particular, photon loss occurring independently in each mode. It shows that for loss rates above a threshold given explicitly as a function of the locality of the recovery maps, encoded information is lost at an exponential rate. This extends an early result by Razborov from discrete to continuous variable (CV) quantum systems. To prove our result, we study a metric on bosonic states akin to the Wasserstein distance between two CV density functions, which we call the bosonic Wasserstein distance. It can be thought of as a CV extension of a quantum Wasserstein distance of order 1 recently introduced by De Palma et al. in the context of qudit systems, in the sense that it captures the notion of locality in a CV setting. We establish several basic properties, including a relation to the trace distance and diameter bounds for states with finite average photon number. We then study its contraction properties under quantum channels, including tensorization, locality and strict contraction under beamsplitter-type noise channels. Due to the simplicity of its formulation, and the established wide applicability of its finite-dimensional counterpart, we believe that the bosonic Wasserstein distance will become a versatile tool in the study of CV quantum systems.
Computation of Uhlmann fidelity between many-body mixed states generally involves full diagonalization of exponentially large matrices. In this work, we introduce a polynomial-time algorithm to compute certified lower and upper bounds for the fidelity between matrix product density operators (MPDOs). Our method maps the fidelity estimation problem to a variational optimization of sequential quantum circuits, allowing for systematic improvement of the lower bounds by increasing the circuit depth. Complementarily, we obtain certified upper bounds on fidelity by variational lower bounds on the trace distance through the same framework. We demonstrate the power of this approach with two examples: fidelity correlators in critical mixed states, and codeword distinguishability in an approximate quantum error-correcting code. Remarkably, the variational lower bound accurately track the universal scaling behavior of the fidelity with a size-consistent relative error, allowing for the extraction of previously unknown critical exponents. Our results offer an exponential improvement in precision over known moment-based bounds and establish a scalable framework for the verification of many-body quantum systems.
Today’s intermediate-scale quantum devices are on the brink of outperforming their classical counterparts. Yet these devices remain noisy, and with no trusted classical computers to check their results, we are left with a dire need to verify that they indeed perform as intended. The standard approach to this problem is to benchmark the performance of the individual building blocks using techniques such as quantum process tomography or randomized benchmarking and then extrapolate to the full system. In practice, however, such an extrapolation can be unreliable due to non-Markovian effects, unmodelled stray noise or temporally and spatially correlated noise. Hence, there is a need for full-system verification techniques able to capture every source of noise and imperfection.
Understanding whether the features of open quantum dynamics are genuinely quantum remains a central challenge in quantum dynamics. Even though the non-Markovian behavior of quantum dynamics has been widely investigated across different settings, there is still no consensus on which properties of a dynamics reflect genuine quantum features and which arise from classical or non-genuine quantum sources. In this review, we provide detailed information on recent developments in characterizing quantum non-Markovianity based on information backflow and the nature of its origin. We also present a survey on how various approaches separate classical and quantum contributions, as well as how they define operational tasks that reveal genuine quantum non-Markovianity. We analyze several frameworks, including state-distinguishability -based, channel-based (``CP-divisibility''), and process-tensor methods. For each framework, we outline the underlying physical motivation, the criteria proposed to distinguish genuine quantum non-Markovianity from practical or apparent memory effects. We further compare different approaches and their strengths and limitations. The review aims to clarify the conceptual and operational aspects of quantum non-Markovian processes based on their nature and to provide a foundation for future research on quantum non-Markovianity and its role in advancing quantum information science and technology.
Characterization of non-Markovian open quantum dynamics is both of theoretical and practical relevance. In a seminal work [Phys. Rev. Lett. 120, 040405 (2018)], a necessary and sufficient quantum Markov condition is proposed, with a clear operational interpretation and correspondence with the classical limit. Here we propose two non-Markovianity measures for general open quantum dynamics, which are fully reconciled with the Markovian limit and can be efficiently calculated based on the multi-time quantum measurements of the system. A heuristic algorithm for reconstructing the underlying open quantum dynamics is proposed, whose complexity is directly related to the proposed non-Markovianity measures. The non-Markovianity measures and the reconstruction algorithm are demonstrated with numerical examples, together with a careful reexamination of the non-Markovianity in quantum dephasing dynamics.
In 2024, Kliuchnikov and Schönnenbeck showed a connection between the Barnes Wall lattices, stabilizer states and Clifford operations. In this work, we study their results and relate them to the problem of lower bounding stabilizer ranks. We show the first quantitative lower bound on stabilizer fidelity as a function of stabilizer ranks, which reproduces the linear-by-log lower bound for χ δ ( | H ⟩ ⊗ n ) , i.e, on the approximate stabilizer rank of | H ⟩ ⊗ n . In fact, we show that the lower bound holds even when the fidelity between the approximation and | H ⟩ ⊗ n is exponentially small, which is currently the best lower bound in this regime.Next, we define a new magic monotone for pure states, the Barnes Wall norm, and its corresponding approximate variant. We upper bound these monotones by the C S -count of state preparation, and also by the stabilizer ranks. In particular, the upper bound given by the C S -count is tight, in the sense that we exhibit states that achieve the bound.Apart from these results, we give a Fidelity Amplification algorithm, which provides a trade-off between approximation error and the stabilizer rank. As a corollary, it gives us a way to compose approximate stabilizer decompositions into approximate decompositions of their tensor products.Finally, we provide an alternate, elementary proof of the existence and density of product states with maximal stabilizer ranks, which was first proven by Lovitz and Steffan (2022), where they used results from algebraic geometry.