Searcharxiv⌕ Search

arXiv subjects

Thomas Schuster

Publications and source records attributed to Thomas Schuster.

At least 19 recordsLinked to original sources

Quantitative approximation for Fourier neural operators in controlled ordinary differential equations

Fourier neural operators (FNOs) avoid the curse of parametric complexity when approximating the solution operator of certain partial differential equations (PDEs). While recent studies primarily focus on PDEs, in this article we derive upper error bounds for approximating the solution operator of controlled ordinary differential equations (CODEs) $\dot{y}=f(y,u)$ using a FNO. Under a Carathéodory setting and suitable regularity assumptions, including a smallness condition, we prove that the size of the FNO grows at most algebraically in $1/\varepsilon$, namely like $\varepsilon^{-(1+d/(2(s-1)))}$ up to logarithmic factors for GELU networks, and is thus sub-quadratic for sufficiently smooth $f$, where $d=1+n_y+n_u$ and $s$ denotes the Sobolev regularity of $f$. Our proof is based on emulating the Picard iteration through the layers of the FNO while exploiting the differentiation formula of the discrete Fourier transform. This result contributes to the quantitative approximation theory of FNOs for physically motivated problems and provides a theoretical foundation for leveraging a FNO as efficient forward surrogate for the solution operator of CODEs, especially in inverse parameter estimation where repeated evaluations of the forward operator are needed.

math.NA↗

Learning Quantum Hamiltonians from the Dynamical Structure Factor

Identifying the microscopic interactions governing a quantum system is essential for developing predictive theories of materials and validating quantum technologies. Despite considerable progress, learning Hamiltonians from realistic experimental data remains a challenge. Motivated by neutron scattering and quantum simulations, we study the problem of learning a quantum Hamiltonian from the dynamical structure factor (DSF), which captures two-point correlation data in quantum magnets. We show that the DSF encodes sufficient information to efficiently reconstruct broad classes of quantum Hamiltonians. Our approach exploits simple relations between low-order spectral moments of the DSF and microscopic couplings, giving rise to three complementary Hamiltonian tomography protocols based on the high-temperature expansion, strong-field polarization, and the fluctuation-dissipation theorem, respectively. The framework we introduce establishes practical and robust Hamiltonian learning from common experimental data, with potentially immediate application to neutron scattering experiments.

cond-mat.str-el↗

Quantum error mitigation from information dynamics

Overcoming experimental errors is a central challenge in quantum science. This challenge is particularly acute in large and complex quantum circuits, where quantum information spreads into exponentially many paths, foiling any direct attempt to understand errors' impact. In this work, we present a novel approach to understanding and mitigating experimental errors, based on a surprisingly compact representation of a quantum circuit's information dynamics, the reactivity function. The shape of a circuit's reactivity function governs its noise response, and its amenability to different error mitigation methods. From this viewpoint, we introduce two complementary such methods. The first, Pauli-path zero-noise extrapolation, fits a parameterized model to a circuit's reactivity function and uses it to accurately extrapolate to zero noise. The second, tunable error cancellation, filters a circuit's reactivity function to cancel noise on all information up to a threshold locality. Crucially, both methods feature a tuning parameter that allows one to systematically improve their accuracy until convergence. Across three circuit families from published experiments, our methods overcome conventional zero-noise extrapolation biases as large as 30%; at $\sim$$10^{-2}$ root-mean-square error, they reduce sampling cost relative to probabilistic error cancellation by up to a factor of $10^3$.

quant-ph↗

Probing the classical complexity of quantum dynamics experiments

A confluence of recent works has shown that many quantum circuits and dynamics are efficiently simulable by classical algorithms that track local information, even when conventional complexity measures such as the entanglement and magic are high. Here, we introduce a novel measure of complexity, the reactivity, to capture this new method of classical attack. Unlike conventional complexity measures, the reactivity does not capture a property of a quantum state or operator in isolation, but rather a quantum experiment as a whole. We provide numerical and rigorous evidence that quantum experiments with low reactivity are simple by a host of measures: they are efficient to classically simulate, learn, and fast-forward. This motivates the search for quantum experiments with high reactivity, which may evade these simplistic features. To this end, we introduce easily implementable experimental protocols---dubbed Pauli path spectroscopy---that allow one to efficiently measure the reactivity of any quantum experiment of interest. Our protocols are applicable even when the experiment itself is beyond the reach of classical simulation.

quant-ph↗

Conditional dependence and Scrooge ensembles in shallow random quantum circuits

The output state of a 2D geometrically local shallow random quantum circuit does not have long range correlations due to its lightcone structure. But this changes if one measures a subset of the qubits: long-range entanglement can be induced by the measurement process, leading to conditional correlations between distant qubits. In this paper we investigate the structure of conditional dependence in these circuits and its consequences for quantum advantage. For a tripartition $ABC$ of the qubits, we consider the ensemble of post-measurement states on $A$ that is conditioned on a specific measurement outcome on $B$ and ranges over all possible measurement outcomes on $C$. For circuit depths exceeding a constant critical value $d^*$, we conjecture that this ensemble is well approximated by a certain generalization of the Haar ensemble, called the Scrooge ensemble~[Jozsa \textit{et al.}, \href{https://doi.org/10.1103/PhysRevA.49.668}{Phys. Rev. A \textbf{49}, 668 (1994)}]; we also provide supporting numerical and analytical evidence. Our conjecture describes a precise sense in which the state retains its lightcone structure on the remaining unmeasured qubits, but also develops some globally random features arising from the measurement. A consequence is that $n$-qubit shallow random quantum circuits in two dimensions are classically efficiently simulable in the presence of a tiny depolarizing noise rate $Ω(\log(n)/n)$.

quant-ph↗

Adaptive Reduced-Basis Trust-Region Methods for Defect Identification in Elastic Materials

Monitoring the integrity of elastic structures using ultrasonic waves requires the efficient identification of material parameters from measured surface displacements. The displacement field is governed by Cauchy's equation of motion, i.e., an elastic wave equation. Consequently, defect localization leads to a high-dimensional spatial parameter identification problem for a hyperbolic system with given initial and boundary conditions. Stable parameter reconstructions typically rely on regularization techniques such as the iteratively regularized Gauss-Newton method (IRGNM). However, its practical application is computationally demanding due to the high-dimensional nature of the problem. To address this bottleneck, we propose a reduced-order modeling approach that simultaneously reduces the state and parameter spaces using adaptively constructed reduced-basis spaces. This yields online-efficient surrogate models for both the forward and adjoint evaluations required in derivative-based optimization. To ensure reliability, the IRGNM iteration is embedded into an adaptive, trust-region framework that provides accuracy of the reduced-order approximations. The approach extends our recent contributions, which focus on elliptic and parabolic problems, to the hyperbolic setting. We demonstrate the reliability and effectiveness of the method for defect detection through numerical experiments.

math.NA↗

Hardness of recognizing phases of matter

We prove that recognizing the phase of matter of an unknown quantum state is quantum computationally hard. More specifically, we show that the quantum computational time of any phase recognition algorithm must grow exponentially in the range of correlations $ξ$ of the unknown state. This exponential growth renders the problem practically infeasible for even moderate correlation ranges, and leads to super-polynomial quantum computational time in the system size $n$ whenever $ξ= ω(\log n)$. Our results apply to a substantial portion of all known phases of matter, including symmetry-breaking phases and symmetry-protected topological phases for any discrete on-site symmetry group in any spatial dimension. To establish this hardness, we extend the study of pseudorandom unitaries (PRUs) to quantum systems with symmetries. We prove that symmetric PRUs exist under standard cryptographic conjectures, and can be constructed in extremely low circuit depths. We also establish hardness for systems with translation invariance and purely classical phases of matter. A key technical limitation is that the locality of the parent Hamiltonians of the states we consider is linear in $ξ$; the complexity of phase recognition for Hamiltonians with constant locality remains an important open question.

quant-ph↗

Benchmarking von ASR-Modellen im deutschen medizinischen Kontext: Eine Leistungsanalyse anhand von Anamnesegesprächen

Automatic Speech Recognition (ASR) offers significant potential to reduce the workload of medical personnel, for example, through the automation of documentation tasks. While numerous benchmarks exist for the English language, specific evaluations for the German-speaking medical context are still lacking, particularly regarding the inclusion of dialects. In this article, we present a curated dataset of simulated doctor-patient conversations and evaluate a total of 29 different ASR models. The test field encompasses both open-weights models from the Whisper, Voxtral, and Wav2Vec2 families as well as commercial state-of-the-art APIs (AssemblyAI, Deepgram). For evaluation, we utilize three different metrics (WER, CER, BLEU) and provide an outlook on qualitative semantic analysis. The results demonstrate significant performance differences between the models: while the best systems already achieve very good Word Error Rates (WER) of partly below 3%, the error rates of other models, especially concerning medical terminology or dialect-influenced variations, are considerably higher.

cs.CL↗

Tensor field tomography with attenuation and refraction: adjoint operators for the dynamic case and numerical experiments

This article is concerned with tensor field tomography in a fairly general setting, that takes refraction, attenuation and time-dependence of tensor fields into account. The mathematical model is given by attenuated ray transforms of the fields along geodesic curves corresponding to a Riemannian metric that is defined by the index of refraction. The data are given at the boundary tangent bundle of the domain and it is well-known that they can be characterized as boundary data of a transport equation turning tensor field tomography into an inverse source problem. This way the adjoint of the forward mapping can be computed using the integral representation or, equivalently, associated to a dual transport equation. The article offers and proves two different representations for the adjoint mappings both in the dynamic and static case. The numerical implementation is demonstrated and evaluated for static fields using the damped Landweber method with Nesterov acceleration applied to both, the integral and PDE-based formulations. The transport equations are solved using a viscosity approximation. The error analysis reveals that the integral representation significantly outperforms PDE-based methods in terms of computational efficiency while achieving comparable reconstruction accuracy. The impact of noise and deviations from straight-line trajectories are investigated confirming improved accuracy if refraction is taken into account. We conclude that the inclusion of refraction to the forward model pays in spite of increased numerical cost.

math.NA↗

The Scrooge ensemble in many-body quantum systems

In many physical settings, the statistical properties of quantum states are thought to be described by the Scrooge ensemble, a more structured generalization of the Haar ensemble. In this work, we prove several key results on the properties and complexity of Scrooge-random states in macroscopic quantum systems, and provide a general-purpose calculus for evaluating their moments. A key theme of our results is a separation between universal random fluctuations in non-local properties and exponential concentration of all local properties. Implications for device benchmarking, sampling advantages beyond random circuits, quantum complexity growth, and the physical origin of Scrooge-random states are discussed.

quant-ph↗

Cooling the Sachdev-Ye-Kitaev model using thermofield double states

We analyze a simple and efficient experimental protocol to cool the Sachdev-Ye-Kitaev (SYK) model to low temperatures. The protocol utilizes local couplings between two copies of an SYK model to create a gapped adiabatic path, between a high temperature product state and a low temperature thermofield double state. By smoothly varying the coupling strength between these two limits, one efficiently cools the SYK model. We support these predictions-and demonstrate fast cooling to the low-temperature gravitational regime-via exact numerical solutions to the large-N equations of motion that govern the ground state and dynamical properties of the coupled system. Finally, we present a theoretical framework based upon eigenstate thermalization that provides a microscopic explanation for the efficacy of the cooling protocol; intriguingly, this suggests that the protocol may be applicable for cooling strongly-interacting quantum Hamiltonians more broadly.

quant-ph↗

Observation of ballistic plasma and memory in high-energy gauge theory dynamics

Gauge theories describe the fundamental forces of nature. However, high-energy dynamics, such as the formation of quark-gluon plasmas, is notoriously difficult to model with classical methods. Quantum simulation offers a promising alternative in this regime, yet experiments have mainly probed low energies. Here, we observe the formation of a ballistic plasma and long-time memory effects in high-energy gauge theory dynamics on a high-precision quantum simulator. Both observations are unexpected, as the initial state - fully filled with particle-antiparticle pairs - was thought to rapidly thermalize. Instead, we find correlations spreading ballistically to long distances and a memory of charge clusters. Our observations cannot be explained by many-body scars, but are captured by a new theory of plasma oscillations between electric field and current operators, persisting all the way to the continuum limit of the (1+1)D Schwinger model, of which we simulate a lattice version. Adapting techniques from quantum optics, we visualize plasma oscillations as rotations of Wigner distributions, leading to a novel set of predictions which we test in experiment and numerics. The new framework encompasses both our scenario and scars, which show up as coherent states of the plasma. The experimental surprises we observe in the high-energy dynamics of a simple gauge theory point to the potential of high-precision quantum simulations of gauge theories for general scientific discovery.

quant-ph↗

Random unitaries from Hamiltonian dynamics

The nature of randomness and complexity growth in systems governed by unitary dynamics is a fundamental question in quantum many-body physics. This problem has motivated the study of models such as local random circuits and their convergence to Haar-random unitaries in the long-time limit. However, these models do not correspond to any family of physical time-independent Hamiltonians. In this work, we address this gap by studying the indistinguishability of time-independent Hamiltonian dynamics from truly random unitaries. On one hand, we establish a no-go result showing that for any ensemble of constant-local Hamiltonians and any evolution times, the resulting time-evolution unitary can be efficiently distinguished from Haar-random and fails to form a $2$-design or a pseudorandom unitary (PRU). On the other hand, we prove that this limitation can be overcome by increasing the locality slightly: there exist ensembles of random polylog-local Hamiltonians in one-dimension such that under constant evolution time, the resulting time-evolution unitary is indistinguishable from Haar-random, i.e. it forms both a unitary $k$-design and a PRU. Moreover, these Hamiltonians can be efficiently simulated under standard cryptographic assumptions.

quant-ph↗

Random unitaries that conserve energy

Random unitaries sampled from the Haar measure serve as fundamental models for generic quantum many-body dynamics. Under standard cryptographic assumptions, recent works have constructed polynomial-size quantum circuits that are computationally indistinguishable from Haar-random unitaries, establishing the concept of pseudorandom unitaries (PRUs). While PRUs have found broad implications in many-body physics, they fail to capture the energy conservation that governs physical systems. In this work, we investigate the computational complexity of generating PRUs that conserve energy under a fixed and known Hamiltonian $H$. We provide an efficient construction of energy-conserving PRUs when $H$ is local and commuting with random coefficients. Conversely, we prove that for certain translationally invariant one-dimensional $H$, there exists an efficient quantum algorithm that can distinguish truly random energy-conserving unitaries from any polynomial-size quantum circuit. This establishes that energy-conserving PRUs cannot exist for these Hamiltonians. Furthermore, we prove that determining whether energy-conserving PRUs exist for a given family of one-dimensional local Hamiltonians is an undecidable problem. Our results reveal an unexpected computational barrier that fundamentally separates the generation of generic random unitaries from those obeying the basic physical constraint of energy conservation.

quant-ph↗

Strong random unitaries and fast scrambling

Understanding how fast physical systems can resemble Haar-random unitaries is a fundamental question in physics. Many experiments of interest in quantum gravity and many-body physics, including the butterfly effect in quantum information scrambling and the Hayden-Preskill thought experiment, involve queries to a random unitary $U$ alongside its inverse $U^\dagger$, conjugate $U^*$, and transpose $U^T$. However, conventional notions of approximate unitary designs and pseudorandom unitaries (PRUs) fail to capture these experiments. In this work, we introduce and construct strong unitary designs and strong PRUs that remain robust under all such queries. Our constructions achieve the optimal circuit depth of $O(\log n)$ for systems of $n$ qubits. We further show that strong unitary designs can form in circuit depth $O(\log^2 n)$ in circuits composed of independent two-qubit Haar-random gates, and that strong PRUs can form in circuit depth $\text{poly}(\log n)$ in circuits with no ancilla qubits. Our results provide an operational proof of the fast scrambling conjecture from black hole physics: every observable feature of the fastest scrambling quantum systems reproduces Haar-random behavior at logarithmic times.

quant-ph↗

Will it glue? On short-depth designs beyond the unitary group

We study the formation of short-depth designs beyond the unitary group. We provide a range of results on several groups of broad interest in quantum information science: the Clifford group, the orthogonal group, the unitary symplectic groups, and the matchgate group. For all of these groups, we prove that analogues of unitary designs cannot be generated by any circuit ensemble with light-cones that are smaller than the system size. This implies linear lower bounds on the circuit depth in one-dimensional systems. For the Clifford and orthogonal group, we moreover show that a broad class of circuits cannot generate designs in sub-linear depth on any circuit architecture. We show this by exploiting observables in the higher-order commutants of each group, which allow one to distinguish any short-depth circuit from truly random. While these no-go results rule out short-depth unitary designs, we prove that slightly weaker forms of randomness -- including additive-error state designs and anti-concentration in sampling distributions -- nevertheless emerge at logarithmic depths in many cases. Our results reveal that the onset of randomness in shallow quantum circuits is a widespread yet subtle phenomenon, dependent on the interplay between the group itself and the context of its application.

quant-ph↗

Unitary designs in nearly optimal depth

We construct $\varepsilon$-approximate unitary $k$-designs on $n$ qubits in circuit depth $O(\log k \log \log n k / \varepsilon)$. The depth is exponentially improved over all known results in all three parameters $n$, $k$, $\varepsilon$. We further show that each dependence is optimal up to exponentially smaller factors. Our construction uses $\tilde{O}(nk)$ ancilla qubits and ${O}(nk)$ bits of randomness, which are also optimal up to $\log(n k)$ factors. An alternative construction achieves a smaller ancilla count $\tilde{O}(n)$ with circuit depth ${O}(k \log \log nk/\varepsilon)$. To achieve these efficient unitary designs, we introduce a highly-structured random unitary ensemble that leverages long-range two-qubit gates and low-depth implementations of random classical hash functions. We also develop a new analytical framework for bounding errors in quantum experiments involving many queries to random unitaries. As an illustration of this framework's versatility, we provide a succinct alternative proof of the existence of pseudorandom unitaries.

quant-ph↗

Adaptive Reduced Basis Trust Region Methods for Parabolic Inverse Problems

We consider nonlinear inverse problems arising in the context of parameter identification for parabolic partial differential equations (PDEs). For stable reconstructions, regularization methods such as the iteratively regularized Gauss-Newton method (IRGNM) are commonly used, but their application is computationally demanding due to the high-dimensional nature of PDE discretizations. To address this bottleneck, we propose a reduced-order modeling approach that accelerates both the state and adjoint evaluations required for derivative-based optimization. Our method builds on the recent contribution [Kartmann et al. Adaptive reduced basis trust region methods for parameter identification problems. Comput. Sci. Eng. 1, 3 (2024)] for elliptic forward operators and constructs the reduced forward operator adaptively in an online fashion, combining both parameter and state space reduction. To ensure reliability, we embed the IRGNM iteration within an adaptive, error-aware trust-region framework that certifies the accuracy of the reduced-order approximations. We demonstrate the effectiveness of the proposed approach through numerical results for both time-dependent and time-independent parameter identification problems in dynamic reaction-diffusion systems. The implementation is made available for reproducibility and further use.

math.NA↗