arXiv subjects

Tristan Kraft

Publications and source records attributed to Tristan Kraft.

At least 19 recordsLinked to original sources

arXiv2026

Testing and Diagnosing Parameter Miscalibration in Probabilistic Error Cancellation via Direct Fidelity Estimation

Probabilistic Error Cancellation (PEC) is a standard technique for mitigating noise in quantum computations, but its unbiasedness relies on accurate knowledge of the underlying noise parameters. In practice, these parameters are inferred from experimental data and may be inaccurate. We introduce a protocol that tests PEC parameter consistency on hardware by applying Direct Fidelity Estimation (DFE) to the effective mitigated state. The resulting DFE overlap serves not only as a witness of parameter miscalibration but, under appropriate conditions, also reveals whether the PEC parameters have been overestimated or underestimated. We establish this behavior for arbitrary circuits under global depolarizing noise and for Clifford circuits under general Pauli-stochastic noise. For arbitrary circuits subject to Pauli-stochastic noise, the underestimation result holds generally, while the corresponding overestimation result is established perturbatively for sufficiently small consistent miscalibrations under an additional nondegeneracy condition. We further show that the purity of the effective mitigated operator provides a more general diagnostic, allowing the miscalibration direction to be identified for arbitrary circuits and arbitrary parameter deviations. Finally, we describe a two-copy PEC procedure for measuring this quantity and show that, together with the DFE overlap, it determines the Hilbert-Schmidt distance from the ideal state. The sampling overhead incurred by our protocol is the same as that of PEC, and we discuss strategies to improve it.

quant-ph↗

arXiv2026

Bounded-Error Quantum Simulation via Hamiltonian and Lindbladian Learning

Analog Quantum Simulators offer a route to exploring strongly correlated many-body dynamics beyond classical computation, but their predictive power remains limited by the absence of quantitative error estimation. Establishing rigorous uncertainty bounds is essential for elevating such devices from qualitative demonstrations to quantitative scientific tools. Here we introduce a general framework for bounded-error quantum simulation, which provides predictions for many-body observables with experimentally quantifiable uncertainties. The approach combines Hamiltonian and Lindbladian Learning--a statistically rigorous inference of the coherent and dissipative generators governing the dynamics--with the propagation of their uncertainties into the simulated observables, yielding confidence bounds directly derived from experimental data. We demonstrate this framework on trapped-ion quantum simulators implementing long-range Ising interactions with up to 51 ions, and validate it where classical comparison is possible. We analyze error bounds on two levels. First, we learn an open-system model from experimental data collected in an initial time window of quench dynamics, simulate the corresponding master equation, and quantitatively verify consistency between theoretical predictions and measured dynamics at long times. Second, we establish error bounds directly from experimental measurements alone, without relying on classical simulation--crucial for entering regimes of quantum advantage. The learned models reproduce the experimental evolution within the predicted bounds, demonstrating quantitative reliability and internal consistency. Bounded-error quantum simulation provides a scalable foundation for trusted analog quantum computation, bridging the gap between experimental platforms and predictive many-body physics. The techniques presented here directly extend to digital quantum simulation.

quant-ph↗

arXiv2026

Phases of matrix-product states with symmetries and measurements: Finite nilpotent groups

We study phases of one-dimensional matrix-product states (MPS) when transformations are restricted to symmetric local circuits supplemented with symmetric measurements and feedforward (G-CMF). Building on the framework introduced in Gunn et al., Phys. Rev. B 111, 115110 (2025), we extend the analysis to all finite nilpotent groups for which we obtain a complete classification of G-CMF phases. We construct explicit symmetry-respecting protocols that map any symmetry-protected topological (SPT) or non-normal (GHZ-type) MPS to the trivial phase-and vice versa-with success probability approaching one in the thermodynamic limit. The key technical ingredient is a finite hierarchical structure of irreducible representations of nilpotent groups, which enables successive rounds of symmetric measurements to systematically reduce non-abelian components to abelian ones. Our results demonstrate that allowing symmetric measurements and feedforward fundamentally simplifies the phase structure of 1D systems with nilpotent symmetries: all SPT and non-normal MPS phases collapse into a single asymptotically equivalent phase under G-CMF transformations.

quant-ph↗

arXiv2024

Hamiltonian and Liouvillian learning in weakly-dissipative quantum many-body systems

We discuss Hamiltonian and Liouvillian learning for analog quantum simulation from non-equilibrium quench dynamics in the limit of weakly dissipative many-body systems. We present and compare various methods and strategies to learn the operator content of the Hamiltonian and the Lindblad operators of the Liouvillian. We compare different ansätze based on an experimentally accessible "learning error" which we consider as a function of the number of runs of the experiment. Initially, the learning error decreases with the inverse square root of the number of runs, as the error in the reconstructed parameters is dominated by shot noise. Eventually the learning error remains constant, allowing us to recognize missing ansatz terms. A central aspect of our approaches is to (re-)parametrize ansätze by introducing and varying the dependencies between parameters. This allows us to identify the relevant parameters of the system, thereby reducing the complexity of the learning task. Importantly, this (re-)parametrization relies solely on classical post-processing, which is compelling given the finite amount of data available from experiments. We illustrate and compare our methods with two experimentally relevant spin models.

quant-ph↗

arXiv2024

Transformations in quantum networks via local operations assisted by finitely many rounds of classical communication

Recent advances have led towards first prototypes of quantum networks in which entanglement is distributed by sources producing bipartite entangled states. This raises the question of which states can be generated in quantum networks based on bipartite sources using local operations and classical communication. In this work, we study state transformations under finite rounds of local operations and classical communication (LOCC) in networks based on maximally entangled two-qubit states. We first derive the symmetries for arbitrary network structures, as these determine which transformations are possible. Then, we show that contrary to tree graphs, for which it has already been shown that any state within the same entanglement class can be reached, there exist states which can be reached probabilistically but not deterministically if the network contains a cycle. Furthermore, we provide a systematic way to determine states which are not reachable in networks consisting of a cycle. Moreover, we provide a complete characterization of the states which can be reached in a cycle network with a protocol where each party measures only once, and each step of the protocol results in a deterministic transformation. Finally, we present an example which cannot be reached with such a simple protocol, and constitutes, up to our knowledge, the first example of a LOCC transformation among fully entangled states requiring three rounds of classical communication.

quant-ph↗

arXiv2023

Phases of Matrix Product States with Symmetric Quantum Circuits and Symmetric Measurements with Feedforward

Two matrix product states (MPS) are in the same phase in the presence of symmetries if they can be transformed into one another via symmetric short-depth circuits. We consider how symmetry-preserving measurements with feedforward alter the phase classification of MPS in the presence of global on-site symmetries. We demonstrate that, for all finite abelian symmetries, any two symmetric MPS belong to the same phase. We give an explicit protocol that achieves a transformation between any two phases and that uses only a depth-two symmetric circuit, two rounds of symmetric measurements, and a constant number of auxiliary systems per site. In the case of non-abelian symmetries, symmetry protection prevents one from deterministically transforming symmetry-protected topological (SPT) states to product states directly via measurements, thereby complicating the analysis. Nonetheless, we provide protocols that allow for asymptotically deterministic transformations between the trivial phase and certain SPT phases.

quant-ph↗

arXiv2023

Indistinguishability of identical bosons from a quantum information theory perspective

Using tools from quantum information theory, we present a general theory of indistinguishability of identical bosons in experiments consisting of passive linear optics followed by particle number detection. Our results do neither rely on additional assumptions on the input state of the interferometer, such as, for instance, a fixed mode occupation, nor on any assumption on the degrees of freedom that potentially make the particles distinguishable. We identify the expectation value of the projector onto the $N$-particle symmetric subspace as an operationally meaningful measure of indistinguishability, and derive tight lower bounds on it that can be efficiently measured in experiments. Moreover, we present a consistent definition of perfect distinguishability and characterize the corresponding set of states. In particular, we show that these states are diagonal in the computational basis up to a permutationally invariant unitary. Moreover, we find that convex combinations of states that describe partially distinguishable and perfectly indistinguishable particles can lead to perfect distinguishability, which itself is not preserved under convex combinations.

quant-ph↗

arXiv2023

Incompatible measurements in quantum information science

Some measurements in quantum mechanics disturb each other. This has puzzled physicists since the formulation of the theory, but only in recent decades has the incompatibility of measurements been analyzed in depth and detail, using the notion of joint measurability of generalized measurements. In this Colloquium joint measurability and incompatibility are reviewed from the perspective of quantum information science. The Colloquium starts by discussing the basic definitions and concepts. An overview on applications of incompatibility, such as in measurement uncertainty relations, the characterization of quantum correlations, or information processing tasks like quantum state discrimination, is then presented. Finally, emerging directions of research, such as a resource theory of incompatibility as well as other concepts to grasp the nature of measurements in quantum mechanics, are discussed.

quant-ph↗

arXiv2022

Transformations of Stabilizer States in Quantum Networks

Stabilizer states and graph states find application in quantum error correction, measurement-based quantum computation and various other concepts in quantum information theory. In this work, we study party-local Clifford (PLC) transformations among stabilizer states. These transformations arise as a physically motivated extension of local operations in quantum networks with access to bipartite entanglement between some of the nodes of the network. First, we show that PLC transformations among graph states are equivalent to a generalization of the well-known local complementation, which describes local Clifford transformations among graph states. Then, we introduce a mathematical framework to study PLC equivalence of stabilizer states, relating it to the classification of tuples of bilinear forms. This framework allows us to study decompositions of stabilizer states into tensor products of indecomposable ones, that is, decompositions into states from the entanglement generating set (EGS). While the EGS is finite up to $3$ parties [Bravyi et al., J. Math. Phys. {\bf 47}, 062106~(2006)], we show that for $4$ and more parties it is an infinite set, even when considering party-local unitary transformations. Moreover, we explicitly compute the EGS for $4$ parties up to $10$ qubits. Finally, we generalize the framework to qudit stabilizer states in prime dimensions not equal to $2$, which allows us to show that the decomposition of qudit stabilizer states into states from the EGS is unique.

quant-ph↗

arXiv2022

Symmetries in quantum networks lead to no-go theorems for entanglement distribution and to verification techniques

Quantum networks are promising tools for the implementation of long-range quantum communication. The characterization of quantum correlations in networks and their usefulness for information processing is therefore central for the progress of the field, but so far only results for small basic network structures or pure quantum states are known. Here we show that symmetries provide a versatile tool for the analysis of correlations in quantum networks. We provide an analytical approach to characterize correlations in large network structures with arbitrary topologies. As examples, we show that entangled quantum states with a bosonic or fermionic symmetry can not be generated in networks; moreover, cluster and graph states are not accessible. Our methods can be used to design certification methods for the functionality of specific links in a network and have implications for the design of future network structures.

quant-ph↗

arXiv2021

Quantum marginal problem and incompatibility

One of the basic distinctions between classical and quantum mechanics is the existence of fundamentally incompatible quantities. Such quantities are present on all levels of quantum objects: states, measurements, quantum channels, and even higher order dynamics. In this manuscript, we show that two seemingly different aspects of quantum incompatibility: the quantum marginal problem of states and the incompatibility on the level of quantum channels are in many-to-one correspondence. Importantly, as incompatibility of measurements is a special case of the latter, it also forms an instance of the quantum marginal problem. The generality of the connection is harnessed by solving the marginal problem for Gaussian and Bell diagonal states, as well as for pure states under depolarizing noise. Furthermore, we derive entropic criteria for channel compatibility, and develop a converging hierarchy of semi-definite programs for quantifying the strength of quantum memories.

quant-ph↗

arXiv2021

Quantum measurement incompatibility in subspaces

We consider the question of characterising the incompatibility of sets of high-dimensional quantum measurements. We introduce the concept of measurement incompatibility in subspaces. That is, starting from a set of measurements that is incompatible, one considers the set of measurements obtained by projection onto any strict subspace of fixed dimension. We identify three possible forms of incompatibility in subspaces: (i) incompressible incompatibility: measurements that become compatible in every subspace, (ii) fully compressible incompatibility: measurements that remain incompatible in every subspace, and (iii) partly compressible incompatibility: measurements that are compatible in some subspace and incompatible in another. For each class we discuss explicit examples. Finally, we present some applications of these ideas. First we show that joint measurability and coexistence are two inequivalent notions of incompatibility in the simplest case of qubit systems. Second we highlight the implications of our results for tests of quantum steering.

quant-ph↗

arXiv2021

Quantum entanglement in the triangle network

Beyond future applications, quantum networks open interesting fundamental perspectives, notably novel forms of quantum correlations. In this work we discuss quantum correlations in networks from the perspective of the underlying quantum states and their entanglement. We address the questions of which states can be prepared in the so-called triangle network, consisting of three nodes connected pairwise by three sources. We derive necessary criteria for a state to be preparable in such a network, considering both the cases where the sources are statistically independent and classically correlated. This shows that the network structure imposes strong and non-trivial constraints on the set of preparable states, fundamentally different from the standard characterization of multipartite quantum entanglement.

quant-ph↗

arXiv2020

An operational characterization of infinite-dimensional quantum resources

Recently, various non-classical properties of quantum states and channels have been characterized through an advantage they provide in specific quantum information tasks over their classical counterparts. Such advantage can be typically proven to be quantitative, in that larger amounts of quantum resources lead to better performance in the corresponding tasks. So far, these characterizations have been established only in the finite-dimensional setting. In this manuscript, we present a technique for extending the known results to the infinite-dimensional regime. The technique relies on approximating infinite-dimensional resource measures by their finite-dimensional counterparts. We give a sufficient condition for the approximation procedure to be tight, i.e. to match with established infinite-dimensional resource quantifiers, and another sufficient condition for the procedure to match with relevant extensions of these quantifiers. We show that various continuous variable quantum resources fall under these conditions, hence, giving them an operational interpretation through the advantage they can provide in so-called quantum games. Finally, we extend the interpretation to the max relative entropy in the infinite-dimensional setting.

quant-ph↗

arXiv2020

Characterizing Quantum Networks: Insights from Coherence Theory

Networks based on entangled quantum systems enable interesting applications in quantum information processing and the understanding of the resulting quantum correlations is essential for advancing the technology. We show that the theory of quantum coherence provides powerful tools for analyzing this problem. For that, we demonstrate that a recently proposed approach to network correlations based on covariance matrices can be improved and analytically evaluated for the most important cases.

quant-ph↗

arXiv2020

Quantification of quantum dynamics with input-output games

Recent developments surrounding resource theories have shown that any quantum state or measurement resource, with respect to a convex (and compact) set of resourceless objects, provides an advantage in a tailored subchannel or state discrimination task, respectively. Here we show that an analogous, more general result is also true in the case of dynamical quantum resources, i.e., channels and instruments. In the scenario we consider, the tasks associated to a resource are input-output games. The advantage a resource provides in these games is naturally quantified by a generalized robustness measure. We illustrate our approach by applying it to a broad collection of examples, including classical and measure-and-prepare channels, measurement and channel incompatibility, LOCC operations, and steering, as well as discussing its applicability to other resources in, e.g., quantum thermodynamics. We finish by showing that our approach generalizes to higher-order dynamics where it can be used, for example, to witness causal properties of supermaps.

quant-ph↗

arXiv2019

Monogamy relations of quantum coherence between multiple subspaces

Quantum coherence plays an important role in quantum information protocols that provide an advantage over classical information processing. The amount of coherence that can exist between two orthogonal subspaces is limited by the positivity constraint on the density matrix. On the level of multipartite systems, this gives rise to what is known as monogamy of entanglement. On the level of single systems this leads to a bound, and hence, a trade-off in coherence that can exist between different orthogonal subspaces. In this work we derive trade-off relations for the amount of coherence that can be shared between a given subspace and all other subspaces based on trace norm, Hilbert-Schmidt norm and von Neumann relative entropy. From this we derive criteria detecting genuine multisubspace coherence.

quant-ph↗

arXiv2019

All quantum resources provide an advantage in exclusion tasks

A key ingredient in quantum resource theories is a notion of measure. Such as a measure should have a number of fundamental properties, and desirably also a clear operational meaning. Here we show that a natural measure known as the convex weight, which quantifies the resource cost of a quantum device, has all the desired properties. In particular, the convex weight of any quantum resource corresponds exactly to the relative advantage it offers in an exclusion task. After presenting the general result, we show how the construction works for state assemblages, sets of measurements and sets of transformations. Moreover, in order to bound the convex weight analytically, we give a complete characterisation of the convex components and corresponding weights of such devices.

quant-ph↗