arXiv subjects

Michael J. Kastoryano

Publications and source records attributed to Michael J. Kastoryano.

31 records · Page 2Linked to original sources

arXiv2018

Divide and conquer method for proving gaps of frustration free Hamiltonians

Providing system-size independent lower bounds on the spectral gap of local Hamiltonian is in general a hard problem. For the case of finite-range, frustration free Hamiltonians on a spin lattice of arbitrary dimension, we show that a property of the ground state space is sufficient to obtain such a bound. We furthermore show that such a condition is necessary and equivalent to a constant spectral gap. Thanks to this equivalence, we can prove that for gapless models in any dimension, the spectral gap on regions of diameter $n$ is at most $o\left(\frac{\log(n)^{2+ε}}{n}\right)$ for any positive $ε$.

math-ph↗

arXiv2017

Driven quantum dynamics: will it blend?

Randomness is an essential tool in many disciplines of modern sciences, such as cryptography, black hole physics, random matrix theory and Monte Carlo sampling. In quantum systems, random operations can be obtained via random circuits thanks to so-called q-designs, and play a central role in the fast scrambling conjecture for black holes. Here we consider a more physically motivated way of generating random evolutions by exploiting the many-body dynamics of a quantum system driven with stochastic external pulses. We combine techniques from quantum control, open quantum systems and exactly solvable models (via the Bethe-Ansatz) to generate Haar-uniform random operations in driven many-body systems. We show that any fully controllable system converges to a unitary q-design in the long-time limit. Moreover, we study the convergence time of a driven spin chain by mapping its random evolution into a semigroup with an integrable Liouvillean and finding its gap. Remarkably, we find via Bethe-Ansatz techniques that the gap is independent of q. We use mean-field techniques to argue that this property may be typical for other controllable systems, although we explicitly construct counter-examples via symmetry breaking arguments to show that this is not always the case. Our findings open up new physical methods to transform classical randomness into quantum randomness, via a combination of quantum many-body dynamics and random driving.

quant-ph↗

arXiv2017

Entanglement renormalization, quantum error correction, and bulk causality

Entanglement renormalization can be viewed as an encoding circuit for a family of approximate quantum error correcting codes. The logical information becomes progressively more well-protected against erasure errors at larger length scales. In particular, an approximate variant of holographic quantum error correcting code emerges at low energy for critical systems. This implies that two operators that are largely separated in scales behave as if they are spatially separated operators, in the sense that they obey a Lieb-Robinson type locality bound under a time evolution generated bya local Hamiltonian.

quant-ph↗

arXiv2016

Quantum Gibbs Samplers: the commuting case

We analyze the problem of preparing quantum Gibbs states of lattice spin Hamiltonians with local and commuting terms on a quantum computer and in nature. Our central result is an equivalence between the behavior of correlations in the Gibbs state and the mixing time of the semigroup which drives the system to thermal equilibrium (the Gibbs sampler). We introduce a framework for analyzing the correlation and mixing characteristics of quantum Gibbs states and quantum Gibbs samplers, which is rooted in the theory of non-commutative Lp spaces. We consider two distinct classes of Gibbs samplers, one of which being the well-studied Davies generators modelling the dynamics on the system due to weak-coupling with a large Markovian environment. We show that their gap is independent of system size if, and only if, a certain strong form of clustering of correlations holds in the Gibbs state. As concrete applications of our formalism, we show that for every one-dimensional lattice system, or for systems in lattices of any dimension at high enough temperatures, the Gibbs samplers of commuting Hamiltonians are always gapped, giving an efficient way of preparing these states on a quantum computer.

quant-ph↗

arXiv2015

Cellular-automaton decoders for topological quantum memories

We introduce a new framework for constructing topological quantum memories, by recasting error recovery as a dynamical process on a field generating cellular automaton. We envisage quantum systems controlled by a classical hardware composed of small local memories, communicating with neighbours, and repeatedly performing identical simple update rules. This approach does not require any global operations or complex decoding algorithms. Our cellular automata draw inspiration from classical field theories, with a Coulomb-like potential naturally emerging from the local dynamics. For a 3D automaton coupled to a 2D toric code, we present evidence of an error correction threshold above 6.1% for uncorrelated noise. A 2D automaton equipped with a more complex update rule yields a threshold above 8.2%. Our framework provides decisive new tools in the quest for realising a passive dissipative quantum memory.

quant-ph↗

arXiv2015

Non-commutative Nash inequalities

A set of functional inequalities - called Nash inequalities - are introduced and analyzed in the context of quantum Markov process mixing. The basic theory of Nash inequalities is extended to the setting of non-commutative Lp spaces, where their relationship to Poincare and log-Sobolev inequalities are fleshed out. We prove Nash inequalities for a number of unital reversible semigroups.

math-ph↗

arXiv2015

How fast do stabilizer Hamiltonians thermalize?

We present rigorous bounds on the thermalization time of the family of quantum mechanical spin systems known as stabilizer Hamiltonians. The thermalizing dynamics are modeled by a Davies master equation that arises from a weak local coupling of the system to a large thermal bath. Two temperature regimes are considered. First we clarify how in the low temperature regime, the thermalization time is governed by a generalization of the energy barrier between orthogonal ground states. When no energy barrier is present the Hamiltonian thermalizes in a time that is at most quadratic in the system size. Secondly, we show that above a universal critical temperature, every stabilizer Hamiltonian relaxes to its unique thermal state in a time which scales at most linearly in the size of the system. We provide an explicit lower bound on the critical temperature. Finally, we discuss the implications of these result for the problem of self-correcting quantum memories with stabilizer Hamiltonians.

quant-ph↗

arXiv2014

Hypercontractivity of quasi-free quantum semigroups

Hypercontractivity of a quantum dynamical semigroup has strong implications for its convergence behavior and entropy decay rate. A logarithmic Sobolev inequality and the corresponding logarithmic Sobolev constant can be inferred from the semigroup's hypercontractive norm bound. We consider completely-positive quantum mechanical semigroups described by a Lindblad master equation. To prove the norm bound, we follow an approach which has its roots in the study of classical rate equations. We use interpolation theorems for non-commutative $L_p$ spaces to obtain a general hypercontractive inequality from a particular $p \rightarrow q$-norm bound. Then, we derive a bound on the $2 \rightarrow 4$-norm from an analysis of the block diagonal structure of the semigroup's spectrum. We show that the dynamics of an $N$-qubit graph state Hamiltonian weakly coupled to a thermal environment is hypercontractive. As a consequence this allows for the efficient preparation of graph states in time ${\rm poly}(\log(N))$ by coupling at sufficiently low temperature. Furthermore, we extend our results to gapped Liouvillians arising from a weak linear coupling of a free-fermion systems.

quant-ph↗

arXiv2014

Rapid mixing implies exponential decay of correlations

We provide an analysis of the correlation properties of spin and fermionic systems on a lattice evolving according to open system dynamics generated by a local primitive Liouvillian. We show that if the Liouvillian has a spectral gap which is independent of the system size, then the correlations between local observables decay exponentially as a function of the distance between their supports. We prove, furthermore, that if the Log-Sobolev constant is independent of the system size, then the system satisfies clustering of correlations in the mutual information - a much more stringent form of correlation decay. As a consequence, in the latter case we get an area law (with logarithmic corrections) for the mutual information. As a further corollary, we obtain a stability theorem for local distant perturbations. We also demonstrate that gapped free-fermionic systems exhibit clustering of correlations in the covariance and in the mutual information. We conclude with a discussion of the implications of these results for the classical simulation of open quantum systems with matrix-product operators and the robust dissipative preparation of topologically ordered states of lattice spin systems.

quant-ph↗

arXiv2013

Quantum logarithmic Sobolev inequalities and rapid mixing

A family of logarithmic Sobolev inequalities on finite dimensional quantum state spaces is introduced. The framework of non-commutative $\bL_p$-spaces is reviewed and the relationship between quantum logarithmic Sobolev inequalities and the hypercontractivity of quantum semigroups is discussed. This relationship is central for the derivation of lower bounds for the logarithmic Sobolev (LS) constants. Essential results for the family of inequalities are proved, and we show an upper bound to the generalized LS constant in terms of the spectral gap of the generator of the semigroup. These inequalities provide a framework for the derivation of improved bounds on the convergence time of quantum dynamical semigroups, when the LS constant and the spectral gap are of the same order. Convergence bounds on finite dimensional state spaces are particularly relevant for the field of quantum information theory. We provide a number of examples, where improved bounds on the mixing time of several semigroups are obtained; including the depolarizing semigroup and quantum expanders.

quant-ph↗

arXiv2012

Driving two atoms in an optical cavity into an entangled steady state using engineered decay

We propose various schemes for the dissipative preparation of a maximally entangled steady state of two atoms in an optical cavity. Harnessing the natural decay processes of cavity photon loss and spontaneous emission, we use an effective operator formalism to identify and engineer effective decay processes, which reach an entangled steady state of two atoms as the unique fixed point of the dissipative time evolution. We investigate various aspects that are crucial for the experimental implementation of our schemes in present-day and future cavity quantum electrodynamics systems and analytically derive the optimal parameters, the error scaling and the speed of convergence of our protocols. Our study shows promising performance of our schemes for existing cavity experiments and favorable scaling of fidelity and speed with respect to the cavity parameters.

quant-ph↗

arXiv2011

A Cutoff Phenomenon for Quantum Markov Chains

We derive upper and lower bounds on the convergence behavior of certain classes of one-parameter quantum dynamical semigroups. The classes we consider consist of tensor product channels and of channels with commuting Liouvillians. We introduce the notion of Cutoff Phenomenon in the setting of quantum information theory, and show how it exemplifies the fact that the convergence of (quantum) stochastic processes is not solely governed by the spectral gap of the transition map. We apply the new methods to show that graph states can be prepared efficiently, albeit not in constant time, by dissipation, and give the exact scaling behavior of the time to stationarity.

quant-ph↗

arXiv2011

Hilbert's projective metric in quantum information theory

We introduce and apply Hilbert's projective metric in the context of quantum information theory. The metric is induced by convex cones such as the sets of positive, separable or PPT operators. It provides bounds on measures for statistical distinguishability of quantum states and on the decrease of entanglement under LOCC protocols or other cone-preserving operations. The results are formulated in terms of general cones and base norms and lead to contractivity bounds for quantum channels, for instance improving Ruskai's trace-norm contraction inequality. A new duality between distinguishability measures and base norms is provided. For two given pairs of quantum states we show that the contraction of Hilbert's projective metric is necessary and sufficient for the existence of a probabilistic quantum operation that maps one pair onto the other. Inequalities between Hilbert's projective metric and the Chernoff bound, the fidelity and various norms are proven.

math-ph↗