Searcharxiv⌕ Search

arXiv subjects

Daniel Malz

Publications and source records attributed to Daniel Malz.

At least 19 recordsLinked to original sources

Noise-induced suppression of MPO truncation errors in noisy random circuits and Lindbladian dynamics

We study how matrix product operator (MPO) truncation errors evolve when simulating two setups: (1) one-dimensional (1D) Haar-random circuits under either depolarizing noise or amplitude-damping noise, and (2) 1D Lindbladian dynamics of a non-integrable quantum Ising model under either depolarizing or amplitude-damping noise. We first show that the average purity of the system density matrix relaxes to a steady value on a timescale that scales inversely with the noise rate. We find that truncation errors generated at earlier steps are approximately exponentially contracted by the subsequent noisy evolution, both with system size $N$ and with the evolution depth $t$, while the cumulative error results from the competition between this contraction and newly injected compression errors. We complement the local-circuit numerics with a solvable global random-unitary model in which the same channel-dependent factor governs the mean-squared contraction of traceless errors and transient mean purity. Its exact finite-$N$ results capture the weak-noise contraction rates and the non-unital stationary-purity trend. Combining the resulting $L_2$ error characterization with the observed late-time $L_1/L_2$ conversion yields an empirical estimate of the $L_1$ truncation error that can be exponentially tighter in $N$ than the generic rank-based bound, particularly for non-unital noise. Together, these results provide empirical evidence that MPO simulation algorithms may efficiently sample from the output of 1D noisy random circuits [setup (1)] with an arbitrary number of circuit layers, and from the steady state of 1D Lindbladian dynamics [setup (2)].

quant-ph↗

Algorithmic Locality of Quantum Tensor Network Belief Propagation

Belief propagation has recently emerged as a powerful framework for evaluating tensor networks in higher dimensions, combining computational efficiency with provable analytical guarantees. In this work, we develop the first end-to-end theory of tensor network belief propagation for a class of projected entangled pair states satisfying \emph{strong injectivity}. We show that when the injectivity parameter exceeds a constant threshold, BP fixed points can be found efficiently, and a cluster-corrected BP algorithm computes physical quantities to $1/\mathrm{poly}(N)$ error in $\mathrm{poly}(N)$ time for an $N$ qubit system. We further identify a striking phenomenon we term \emph{algorithmic locality}: local perturbations of the tensor network affect the BP fixed point with an influence decaying rapidly with distance. Moreover, through the cluster expansion, this locality extends to observables, implying that local expectation values can be approximated from local data with controlled accuracy. We exhibit three regimes admitting strong injectivity: random Gaussian PEPS with large physical dimension, high-temperature Gibbs states of commuting two-body Hamiltonians, and fixed-depth quantum circuits subject to sufficiently strong depolarizing noise. Our bounds are worst-case sufficient conditions and do not identify sharp algorithmic transitions.

quant-ph↗

Contractivity of time-dependent driven-dissipative systems

Experimentally relevant quantum systems are frequently described by a time-dependent Lindblad master equation in which the dissipation due to interaction with an environment is fixed, but the experimenter has control over the Hamiltonian, which therefore can change with time. A fundamental question that is also of practical relevance is to determine when such systems invariably lose information about their initial state (are exponentially contractive independent of the Hamiltonian) or when the control can be used to prevent this loss of information to some degree. Here, we identify the necessary and sufficient criterion on the dissipator for Hamiltonian-invariant contractivity. If the dissipator does not fulfil this criterion, but by itself is exponentially contractive, we also establish exponential contractivity for sufficiently weak or slow drives and construct examples where strong or fast driving prevents exponential contraction.

quant-ph↗

Gibbs state postulate from dynamical stability

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↗

One-dimensional quantum Gibbs states in constant circuit depth

We prove that the Gibbs state of any spin chain can be exactly decomposed into a mixture of product states over contiguous blocks of qubits with bounded length, at any constant temperature. As a consequence, any such Gibbs state can be prepared by local unitary circuits of constant depth, with efficient classical preprocessing. We place strong limits on the spatial structure of thermal entanglement: both the entanglement depth and entanglement width (measures of multiparticle entanglement) are bounded by constants, while the localizable entanglement (the bipartite entanglement that can be generated with the aid of local measurements and classical communication) vanishes exactly beyond a constant threshold distance. Our result also has implications for quantum thermalization: for any translation-invariant spin-chain Hamiltonian with nondegenerate spectral gaps, typical low-complexity pure states drawn from a maximally entropic ensemble at any constant effective temperature become locally indistinguishable from the Gibbs state upon unitary evolution. Additionally, we obtain an analogous decomposition for fermionic systems: the Gibbs state of any 1D local fermionic Hamiltonian is exactly a mixture of constant-depth local fermionic circuits acting on Gaussian states.

quant-ph↗

Near-optimal quantum simulation of lattice Lindbladian dynamics

We consider the problem of simulating dynamics under geometrically local Lindbladians acting on a lattice of qudits. We present an algorithm to approximate the time evolution under these Lindbladians for evolution time $t$ and on $N$ qudits to diamond norm error $\varepsilon$ using geometrically local circuits of depth $O(t \ \polylog(Nt/\varepsilon))$. Our results thus achieve a performance comparable to that of the Haah-Hastings-Kothari-Low (HHKL) algorithm for lattice Hamiltonian simulation.

quant-ph↗

Measurement-induced entanglement in noisy 2D random circuits

We study measurement-induced entanglement (MIE) generated by column-by-column sampling of noisy 2D random circuits of size $N$ and depth $T$. Focusing primarily on Clifford circuits and using the operator entanglement $S_{\rm op}$ of the sampling-induced boundary state as a proxy for computational complexity, first, we reproduce in the noiseless limit a finite-depth transition from area- to volume-law scaling at a threshold depth $T_c=6$. In contrast, in the presence of single-qubit depolarizing noise at any constant rate $p>0$, we find that the operator entanglement $S_{\rm op}$ obeys an area law, with its maximum value scaling approximately linearly with $T/p$ in the regime $T>T_c$. By analyzing the spatial distribution of stabilizer generators, we observe exponential localization of stabilizer generators; this both accounts for the scaling of the maximal $S_{\rm op}$ and implies an exponential decay of conditional mutual information across buffered tripartitions, which we also confirm numerically. Together, these results indicate that constant local noise destroys long-range MIE in 2D random Clifford circuits, and that a tensor-network based algorithm can efficiently sample from noisy 2D random Clifford circuits (i) at sub-logarithmic depths $T = o(\log N)$ for any constant noise rate $p = Ω(1)$, and (ii) at constant depths $T = O(1)$ for noise rates $p = Ω(\log^{-1}N)$. Finally, we turn to depth $T=4$ Haar-random and measurement-based quantum computing-type circuits, providing evidence that MIE in noisy 2D Haar-random circuits exhibits the same qualitative behavior as in random Clifford circuits, and that noise destroys the volume-law scaling of MIE in non-Clifford circuits.

quant-ph↗

Robust Superradiance and Spontaneous Spin Ordering in Disordered Waveguide Quantum Electrodynamics

We study the collective emission of a disordered array of $N$ excited two-level atoms into a one-dimensional photonic waveguide. In the perfectly ordered case, where atoms are spaced by exact integer multiples of the wavelength, the system exhibits the characteristic superradiant burst with a peak emission rate scaling as $N^2$. Using large-scale semiclassical simulations, we find that this key signature of superradiance remains asymptotically robust under strong spatial and spectral disorder, but also exhibits subtle finite-size scaling toward this limit. To explain our observations, we provide an analytical variational estimate for the maximal decay rate, which tightly bounds the numerical results and reveals how disorder shapes the collective decay. Specifically, we find that even in the presence of strong disorder, the spins tend to self-organize spontaneously according to their locations, which overall optimizes constructive interference effects and explains the emergence of mirror-asymmetric correlations in superradiant decay. These findings resolve important open questions regarding the existence and nature of superradiance in strongly disordered arrays and offer valuable insights for understanding collective quantum optical phenomena in realistic systems.

quant-ph↗

Polaron-Polaritons in Subwavelength Arrays of Trapped Atoms

Subwavelength arrays of atoms trapped in optical lattices or tweezers are inherently susceptible to deformations: Optomechanical forces displace atoms within their trapping potential and produce lattice distortions, which in turn modify the optical response of the array. We show that this optomechanical coupling hybridizes collective atomic excitations (polaritons) with phonons, forming polaron-polaritons -- the fundamental quasiparticles governing light-matter interactions in arrays of trapped atoms. Using analytical polaron theory and numerical simulations, we find that: (1) phonons can strongly enhance the decay of subradiant states, but also enable their efficient excitation; (2) transport of dark excitations remains remarkably robust even at low trap frequencies, except when a polariton can resonantly scatter phonons; and (3) motion reduces the reflectivity of a two-dimensional atomic mirror; by identifying design principles that mitigate this degradation, we recover reflectivity above 99% under realistic conditions. Our findings lay the foundation for analyzing motional effects in key applications and suggest new ways to harness them in state-of-the-art experiments.

quant-ph↗

Collective decay of interacting bosons

We study a bosonic analog of the paradigmatic Dicke model of superradiance, comprising interacting bosonic modes subject to fully symmetric collective decay. Depending on the interaction strength, we uncover qualitatively distinct regimes of emission. For strong interactions, the emission closely resembles Dicke superradiance, with perturbative corrections arising from the presence of additional levels. For weaker interactions, the bosonic statistics qualitatively changes the dynamics, leading to a crossover to subradiant emission. Remarkably, we show that the dynamics in this regime can be described by rate equations analogous to those of the Dicke model despite the large accessible bosonic Hilbert space. Our findings are based on a combination of analytical arguments and large-scale numerics enabled by the permutational symmetry of the problem and may be probed in circuit QED experiments.

quant-ph↗

Constraints on phantom codes from automorphism group bounds

Executing a logical quantum circuit fault-tolerantly incurs a large spacetime overhead. Recent work has proposed and investigated phantom codes, defined by the property that every in-block logical $\mathrm{CNOT}$ circuit can be implemented with a physical permutation, a property that has the potential to greatly reduce the depth of compiled circuits. Here we show that phantomness comes at the cost of low encoding rate. Specifically, we prove that any binary phantom code encoding $k$ logical qubits into $n$ physical qubits with distance $d\geq 2$ obeys the bound $k\leq \log_2(n+1)$ for all $k\neq 4$. For $k=4$ we explicitly construct a nonstabiliser $(\!(8, 2^4, 2)\!)$ phantom code that violates the bound and has a transversal non-Clifford gate. We further show that, within the class of nontrivial CSS phantom codes with $k\neq 4$, there is a unique family of codes saturating this bound. In addition, we prove that this logarithmic ceiling cannot be circumvented by permitting additional local unitary gates, or by making use of subsystem codes: any subspace or subsystem code admitting a $\mathrm{SWAP}$-transversal implementation of every logical $\mathrm{CNOT}$ circuit is constrained to satisfy the same bound. These bounds follow from a general theorem relating the length of a quantum code to the structure of its automorphism group, a result which may find applications beyond phantom codes.

quant-ph↗

State preparation with parallel-sequential circuits

We introduce parallel-sequential (PS) circuits, a family of quantum circuit layouts that interpolate between brickwall and sequential circuits, which introduces control parameters governing a trade-off between the amount of entanglement and the maximum correlation range they can express. We provide numerical evidence that PS circuits can efficiently prepare many-body ground states in one dimension. On noisy devices, characterized through both idling errors and two-qubit gate errors, we show that in a wide parameter regime, PS circuits outperform brickwall, sequential, and the log-depth circuits from [Malz, Styliaris, Wei, Cirac, PRL 132, 040404 (2024)]. Additionally, we demonstrate that properly chosen noisy random PS circuits suppress error proliferation and, when employed as a variational ansatz, exhibit superior trainability.

quant-ph↗

Random Permutation Circuits Beyond Qubits are Quantum Chaotic

Random permutation circuits were recently introduced as minimal models for local many-body dynamics that can be interpreted both as classical and quantum. Standard dynamical complexity indicators such as damage spreading and out-of-time-order correlators (OTOCs), show that these systems exhibit sensitivity to initial conditions in the classical setting and operator scrambling in the quantum setting. Here, we address their quantum chaoticity - a stricter property - by studying the time evolution of local operator entanglement (LOE). We show that the behaviour of LOE in random permutation circuits depends on the dimension of the local configuration space q. When q = 2, i.e. the circuits act on qubits, random permutations are Clifford and the LOE of any local operator is bounded by a constant, indicating that they are not truly chaotic. On the other hand, when the dimension of the local configuration space exceeds two, the LOE grows linearly in time. We prove this in the limit of large q and present numerical evidence that a three-dimensional local configuration space is sufficient for a linear growth of LOE. Our findings highlight that quantum chaos can be produced by essentially classical dynamics. Moreover, we show that LOE can be defined also in the classical realm and put it forward as a universal indicator chaos, both quantum and classical.

cond-mat.stat-mech↗

Computational complexity of injective projected entangled pair states

Projected entangled pair states (PEPS) constitute a variational family of quantum states with area-law entanglement. PEPS are particularly relevant and successful for studying ground states of spatially local Hamiltonians. However, computing local expectation values in these states is known to be \postBQP-hard. Injective PEPS, where all constituent tensors fulfil an injectivity constraint, are generally believed to be better behaved, because they are unique ground states of spatially local Hamiltonians. In this work, we therefore examine how the computational hardness of contraction depends on the injectivity. We establish that below a constant positive injectivity threshold, evaluating local observables remains \postBQP-complete, while above a different constant nontrivial threshold there exists an efficient classical algorithm for the task, resolving an open question from (Anshu et al., STOC `24). We do this by proving that noisy postselected quantum computation can be made fault-tolerant.

quant-ph↗

Renormalization-group-based preparation of matrix product states on up to 80 qubits

A key challenge for quantum computers is the efficient preparation of many-body entangled states across many qubits. In this work, we demonstrate the preparation of matrix product states (MPS) using a renormalization-group(RG)-based quantum algorithm on superconducting quantum hardware. Compared to sequential generation, it has been shown that the RG-based protocol asymptotically prepares short-range correlated MPS with an exponentially shallower circuit depth (when scaling system size), but it is not yet clear for which system sizes it starts to convey an advantage. We thus apply this algorithm to prepare a class of MPS exhibiting a phase transition between a symmetry-protected topological (SPT) and a trivial phase for systems of up to 80 qubits. We find that the reduced depth of the RG-based circuits makes them more resilient to noise, and that they generally outperform the sequential circuits for large systems, as we showcase by measuring string-order-like local expectation values and energy densities. We thus demonstrate that the RG-based protocol enables large-scale preparation of MPS and, in particular, SPT-ordered states beyond the fixed point.

quant-ph↗

Estimating applied potentials in cold atom lattice simulators

Cold atoms in optical lattices are a versatile and highly controllable platform for quantum simulation, capable of realizing a broad family of Hubbard models, and allowing site-resolved readout via quantum gas microscopes. In principle, arbitrary site-dependent potentials can also be implemented; however, since lattice spacings are typically below the diffraction limit, precisely applying and calibrating these potentials remains challenging. Here, we propose a simple and efficient experimental protocol that can be used to measure any potential with high precision. The key ingredient in our protocol is the ability in some atomic species to turn off interactions using a Feshbach resonance, which makes the evolution easy to compute. Given this, we demonstrate that collecting snapshots from the time evolution of a known, easily prepared initial state is sufficient to accurately estimate the potential. Our protocol is robust to state preparation errors and uncertainty in the hopping rate. This paves the way toward precision quantum simulation with arbitrary potentials.

cond-mat.quant-gas↗

Gaussian tomography for cold-atom simulators

A limitation of analog quantum simulators based on cold atoms in optical lattices is that readout is typically limited to observables diagonal in the charge basis, i.e., densities and density correlation functions. To overcome this limitation, we propose experiment-friendly schemes to measure charge-off-diagonal correlations (such as currents). Our protocols use non-interacting dynamics for random times followed by standard quantum gas microscope measurements to effectively measure in random bases. The main requirement of our scheme is the ability to turn off interactions, which can be done in many atomic species using Feshbach resonances. Importantly, our scheme requires no local control and otherwise also exhibits modest requirements in terms of total evolution time and number of repetitions. We numerically demonstrate efficient estimation of bilinear correlation functions, requiring less than $4000$ samples to measure local currents to 5% error (system-size independent) and $\sim 10^4$ samples to simultaneously measure all non-local correlations in 70-site systems. Due to its simplicity, our protocol is implementable in existing platforms and thus paves the way to precision measurements beyond particle number measurements.

quant-ph↗

Theory of quantum-enhanced interferometry with general Markovian light sources

Quantum optical systems comprising quantum emitters interacting with engineered optical modes generate non-classical states of light that can be used as resource states for quantum-enhanced interferometry. However, outside of well-controlled systems producing either single-mode states (e.g. Fock states or squeezed states) or highly symmetric multi-mode states (e.g. superradiant states), their potential for quantum advantage remains uncharacterized. In this work, we develop a framework to analyze quantum enhanced interferometry with general Markovian quantum light sources. First, we show how to compute the quantum Fisher Information (QFI) of the photons emitted by a source efficiently by just tracking its internal dynamics and without explicitly computing the state of the emitted photons. We then use this relationship to elucidate the connection between the level structure and spectrum of the source to a potential quantum advantage in interferometry. Finally, we analyze optimal measurement protocols that can be used to achieve this quantum advantage with experimentally available optical elements. In particular, we show that tunable optical elements with Kerr non-linearity can always be harnessed to implement the optimal measurement for any given source. Simultaneously, we also outline general conditions under which linear optics and photodetection is enough to implement the optimal measurement.

quant-ph↗