SearcharxivSearch

arXiv subjects

Michael M. Wolf

Publications and source records attributed to Michael M. Wolf.

At least 19 recordsLinked to original sources

Topology of the Set of Entangled State

We investigate the topology of the set $\mathsf E$ of entangled bipartite density operators acting on $\mathbb{C}^{n_1}\otimes\mathbb{C}^{n_2}$. We start by showing that $\mathsf E$ is path-connected, and even simply connected except in the two-qubit case. In this exceptional case $\mathsf E$ turns out to be homotopy equivalent to the set of maximally entangled states, which itself is homeomorphic to $\mathbb{RP}^3$. Here we also compute the complete homology of the closure and interior of $\mathsf E$. In all larger dimensions, we show that the homology and homotopy groups of $\mathsf E$ vanish in degrees $1\leq k\leq 2(n_1-1)(n_2-1)-2$, and all homology groups of degree $k\geq (n_1n_2)^2-3$ also vanish. This range is controlled by the space $\mathsf W$ of entanglement witnesses, which we show is highly connected beyond two qubits and homotopy equivalent to $\mathsf E$. By computing the Euler characteristic, using a torus-action fixed point argument together with Alexander duality, we show that $\mathsf E$ nevertheless has non-trivial reduced homology over every field for all $n_1, n_2 \geq 2$.

quant-ph

Poset-refined majorization relations

Several classical majorization relations for sums or products of matrices involve a majorizing vector of perfectly aligned eigenvalues or singular values. By relaxing the order of alignment to a partial order, we show that the majorization can be strengthened, provided the change-of-basis matrices admit an LU-approximation with respect to this partial order. In this way, we obtain refined versions of Ky Fan's majorization relations, Horn's log-majorization relation, and von Neumann's trace inequality. As an application, we give a short proof of the separable Ky Fan majorization relation for an arbitrary number of tensor factors and extend it to a sum of tensor products of arbitrary matrices. Further applications concern majorization relations for sums of (anti-)symmetric powers and for products of Kronecker sums.

math.FA

Ky Fan majorization for binary tensor products

We provide a short proof of a Ky Fan-type majorization relation for the singular values of a sum of binary tensor products of matrices. This generalizes Alhejji's result (arXiv:2410.18254) from two summands to arbitrary sums and from positive matrices to arbitrary matrices. As an application, we show a majorization relation between the singular values of a completely positive map and those of its Kraus operators.

quant-ph

The Ruskai-Audenaert conjecture & equipartitions of positive operators

Several open problems in quantum information theory can be formulated as equipartition problems for positive operators, asking for a decomposition into bounded-rank positive parts under uniform constraints. The existence problems for SIC-POVMs and MUBs are of this type, as is the Ruskai-Audenaert conjecture. We first show that certain problems of this form can be attacked using equivariant cohomology, and then present new results on the Ruskai-Audenaert conjecture. In its weak form, this conjecture asserts that every quantum channel admits a convex decomposition into a minimal number of generalized extreme points; in its strong form, one with equal weights. We prove the strong conjecture in all dimensions for a set of channels of nonzero measure, including all cq- and qc-channels, as well as for all channels with qubit inputs. We also prove the weak conjecture for all qutrit channels, along with further results on convex decompositions of quantum channels.

quant-ph

Trilinos: Enabling Scientific Computing Across Diverse Hardware Architectures at Scale

Trilinos is a community-developed, open-source software framework that facilitates building large-scale, complex, multiscale, multiphysics simulation code bases for scientific and engineering problems. Since the Trilinos framework has undergone substantial changes to support new applications and new hardware architectures, this document is an update to ``An Overview of the Trilinos project'' by Heroux et al. (ACM Transactions on Mathematical Software, 31(3):397-423, 2005). It describes the design of Trilinos, introduces its new organization in product areas, and highlights established and new features available in Trilinos. Particular focus is put on the modernized software stack based on the Kokkos ecosystem to deliver performance portability across heterogeneous hardware architectures. This paper also outlines the organization of the Trilinos community and the contribution model to help onboard interested users and contributors.

cs.MS

Gibbs state postulate from dynamical stability -- Redundancy of the zeroth law

Gibbs states play a central role in quantum statistical mechanics as the standard description of thermal equilibrium. Traditionally, their use is justified either by a heuristic, a posteriori reasoning, or by derivations based on notions of typicality or passivity. In this work, we show that Gibbs states are completely characterized by assuming dynamical stability of the system itself and of the system in weak contact with an arbitrary environment. This builds on and strengthens a result by Frigerio, Gorini, and Verri (1986), who derived Gibbs states from dynamical stability using an additional assumption that they referred to as the "zeroth law of thermodynamics", as it concerns a nested dynamical stability of a triple of systems. We prove that this zeroth law is redundant and that an environment consisting solely of harmonic oscillators is sufficient to single out Gibbs states as the only dynamically stable states.

math-ph

Partial trace relations beyond normal matrices

We investigate the relationship between partial traces and their dilations for general complex matrices, focusing on two main aspects: the existence of (joint) dilations and norm inequalities relating partial traces and their dilations. Throughout our analysis, we pay particular attention to rank constraints. We find that every pair of matrices of equal size and trace admits dilations of any rank larger than one. We generalize Audenaert's subadditivity inequality to encompass general matrices, multiple tensor factors, and different norms. A central ingredient for this is a novel majorization relation for Kronecker sums. As an application, we extend the interval of Werner states in which they are provably 2-undistillable in any dimension $d\geq4$. We also prove new Schmidt-number witnesses and $k$-positive maps.

quant-ph

Undecidability in Physics: a Review

The study of undecidability in problems arising from physics has experienced a renewed interest, mainly in connection with quantum information problems. The goal of this review is to survey this recent development. After a historical introduction, we first explain the necessary results about undecidability in mathematics and computer science. Then we briefly review the first results about undecidability in physics which emerged mostly in the 80s and early 90s. Finally we focus on the most recent contributions, which we divide in two main categories: many body systems and quantum information problems.

math-ph

Quantum tomography from the evolution of a single expectation

We investigate the possibility of performing full quantum tomography based on the homogeneous time evolution of a single expectation value. Remarkably, every non-trivial binary measurement evolved by any quantum channel, except for a null set, in principle enables full quantum state tomography. We show that this remains true when restricted to Lindblad semigroups, although unitary evolution -- even with added simply depolarizing noise -- is insufficient beyond the qubit case, highlighting the necessity of non-trivial noise. We establish an analog of Takens' embedding theorem for quantum channels, which incorporates prior information into the framework. We also provide estimation bounds for finite statistics and analyze the feasibility of recovering an infinite time series of expectation values from a finite one using only spectral properties of the evolution.

math-ph

On the set of reduced states of translation invariant, infinite quantum systems

The set of two-body reduced states of translation invariant, infinite quantum spin chains can be approximated from inside and outside using matrix product states and marginals of finite systems, respectively. These lead to hierarchies of algebraic approximations that become tight only in the limit of infinitely many auxiliary variables. We show that this is necessarily so for any algebraic ansatz by proving that the set of reduced states is not semialgebraic. We also provide evidence that additional elementary transcendental functions cannot lead to a finitary description.

quant-ph

Hay from the haystack: explicit examples of exponential quantum circuit complexity

The vast majority of quantum states and unitaries have circuit complexity exponential in the number of qubits. In a similar vein, most of them also have exponential minimum description length, which makes it difficult to pinpoint examples of exponential complexity. In this work, we construct examples of constant description length but exponential circuit complexity. We provide infinite families such that each element requires an exponential number of two-qubit gates to be generated exactly from a product and where the same is true for the approximate generation of the vast majority of elements in the family. The results are based on sets of large transcendence degree and discussed for tensor networks, diagonal unitaries, and maximally coherent states.

quant-ph

Undecidability of the Spectral Gap (full version)

We show that the spectral gap problem is undecidable. Specifically, we construct families of translationally-invariant, nearest-neighbour Hamiltonians on a 2D square lattice of d-level quantum systems (d constant), for which determining whether the system is gapped or gapless is an undecidable problem. This is true even with the promise that each Hamiltonian is either gapped or gapless in the strongest sense: it is promised to either have continuous spectrum above the ground state in the thermodynamic limit, or its spectral gap is lower-bounded by a constant in the thermodynamic limit. Moreover, this constant can be taken equal to the local interaction strength of the Hamiltonian.

quant-ph

Transcendental properties of entropy-constrained sets

For information-theoretic quantities with an asymptotic operational characterization, the question arises whether an alternative single-shot characterization exists, possibly including an optimization over an ancilla system. If the expressions are algebraic and the ancilla is finite, this leads to semialgebraic level sets. In this work, we provide a criterion for disproving that a set is semialgebraic based on an analytic continuation of the Gauss map. Applied to the von Neumann entropy, this shows that its level sets are nowhere semialgebraic in dimension d>2, ruling out algebraic single-shot characterizations with finite ancilla (e.g., via catalytic transformations). We show similar results for related quantities, including the relative entropy, and discuss under which conditions entropy values are transcendental, algebraic, or rational.

math-ph

Quantum Zeno effect generalized

The quantum Zeno effect, in its original form, uses frequent projective measurements to freeze the evolution of a quantum system that is initially governed by a fixed Hamiltonian. We generalize this effect simultaneously in three directions by allowing open system dynamics, time-dependent evolution equations and general quantum operations in place of projective measurements. More precisely, we study Markovian master equations with bounded generators whose time dependence is Lipschitz continuous. Under a spectral gap condition on the quantum operation, we show how frequent measurements again freeze the evolution outside an invariant subspace. Inside this space the evolution is described by a modified master equation.

math-ph

'Interaction-Free' Channel Discrimination

In this work, we investigate the question, which objects one can discriminate perfectly by 'interaction-free' measurements. To this end, we interpret the Elitzur-Vaidman bomb-tester experiment as a quantum channel discrimination problem and generalize the notion of 'interaction-free' measurement to arbitrary quantum channels. Our main result is a necessary and sufficient criterion for when it is possible or impossible to discriminate quantum channels in an 'interaction-free' manner (i.e., such that the discrimination error probability and the 'interaction' probability can be made arbitrarily small). For the case where our condition holds, we devise an explicit protocol with the property that both probabilities approach zero with an increasing number of channel uses, $N$. More specifically, the 'interaction' probability in our protocol decays as $\frac{1}{N}$ and we show that this rate is the optimal achievable one. Furthermore, our protocol only needs at most one ancillary qubit and might thus be implementable in near-term experiments. For the case where our condition does not hold, we prove an inequality that quantifies the trade-off between the error probability and the 'interaction' probability.

quant-ph

When Do Composed Maps Become Entanglement Breaking?

For many completely positive maps repeated compositions will eventually become entanglement breaking. To quantify this behaviour we develop a technique based on the Schmidt number: If a completely positive map breaks the entanglement with respect to any qubit ancilla, then applying it to part of a bipartite quantum state will result in a Schmidt number bounded away from the maximum possible value. Iterating this result puts a successively decreasing upper bound on the Schmidt number arising in this way from compositions of such a map. By applying this technique to completely positive maps in dimension three that are also completely copositive we prove the so called PPT squared conjecture in this dimension. We then give more examples of completely positive maps where our technique can be applied, e.g.~maps close to the completely depolarizing map, and maps of low rank. Finally, we study the PPT squared conjecture in more detail, establishing equivalent conjectures related to other parts of quantum information theory, and we prove the conjecture for Gaussian quantum channels.

quant-ph

Are almost-symmetries almost linear?

It $d-$pends. Wigner's symmetry theorem implies that transformations that preserve transition probabilities of pure quantum states are linear maps on the level of density operators. We investigate the stability of this implication. On the one hand, we show that any transformation that preserves transition probabilities up to an additive $\varepsilon$ in a separable Hilbert space admits a weak linear approximation, i.e. one relative to any fixed observable. This implies the existence of a linear approximation that is $4\sqrt{\varepsilon} d$-close in Hilbert-Schmidt norm, with $d$ the Hilbert space dimension. On the other hand, we prove that a linear approximation that is close in norm and independent of $d$ does not exist in general. To this end, we provide a lower bound that depends logarithmically on $d$.

math-ph

Universality and Optimality in the Information-Disturbance Tradeoff

We investigate the tradeoff between the quality of an approximate version of a given measurement and the disturbance it induces in the measured quantum system. We prove that if the target measurement is a non-degenerate von Neumann measurement, then the optimal tradeoff can always be achieved within a two-parameter family of quantum devices that is independent of the chosen distance measures. This form of almost universal optimality holds under mild assumptions on the distance measures such as convexity and basis-independence, which are satisfied for all the usual cases that are based on norms, transport cost functions, relative entropies, fidelities, etc. for both worst-case and average-case analysis. We analyze the case of the cb-norm (or diamond norm) more generally for which we show dimension-independence of the derived optimal tradeoff for general von Neumann measurements. A SDP solution is provided for general POVMs and shown to exist for arbitrary convex semialgebraic distance measures.

quant-ph