arXiv subjects

Maciej Koch-Janusz

Publications and source records attributed to Maciej Koch-Janusz.

At least 19 recordsLinked to original sources

arXiv2026

Demonstration of a Structured Agentic Workflow for Applied Quantum Computing Research

Quantum hardware advances now make it practical to explore quantum approaches to scientific problems. Applied quantum computing research sits at the intersection of domain knowledge, algorithms, theoretical physics, device physics, and quantum and classical computational methods. The breadth of expertise required and the inherent project complexity challenge not only any individual researcher, but also generic AI systems. Here, we introduce the Quantum Agentic Operating System (QAOS), a structured agentic research system designed to address this challenge for quantum and computational R&D projects. QAOS is built around a nonlinear workflow graph of heterogeneous multi-agent nodes, with a controlled flow of context and computational resources. It decomposes a complex research project into sandboxed multi-agent tasks executed under constraints from the project graph, task-relevant methodologies, and necessary verification steps. We demonstrate QAOS on a quantum chemistry prototyping task, in which it is asked to set up a minimal model for a proton-transfer problem and to implement its solution using sample-based quantum diagonalization (SQD), together with classical reference methods such as FCI (exact diagonalization) and density functional theory (DFT). We compare the QAOS solution to those obtained with baseline agents (Claude Sonnet 5 with the Claude Code harness). In contrast to QAOS, the baseline agents silently ignore explicit instructions, and the runs show large variability.

quant-ph↗

arXiv2026

Quantum Hamiltonian simulation of linearised Euler equations in complex geometries

Quantum computing promises exponential improvements in solving large systems of partial differential equations (PDE), which forms a bottleneck in high-resolution simulations of, among others, computational fluid dynamics (CFD) in aerospace applications and weather forecasting. One approach is via mapping classical PDE problems to a quantum Hamiltonian evolution, for which recently an explicit quantum circuit construction has been shown in simple cases, allowing proof-of-concept execution on quantum processors. Here we extended this method to more complex and practically relevant cases. We first demonstrate how arbitrary complex-shaped geometrical obstacles with Dirichlet, Neumann or mixed boundary conditions can be introduced in the quantum representations of elementary difference operators used to implement the PDE, either directly or using Linear Combination of Unitaries (LCU). We provide their explicit and efficient circuit constructions, and analyze the Trotter errors and asymptotic gate complexities, which in the Dirichlet case do not grow compared to the free space equation. Using these methods we then derive quantum circuits for the linearized Euler equations in the presence of a background fluid flow and obstacles, both in the conservative and non-conservative regimes. We illustrate our results by simulating the obtained quantum circuits for different boundary conditions and geometries, comparing their error to a classical finite difference scheme.

quant-ph↗

arXiv2026

Reducing quantum and classical resources for quantum-centric supercomputing workloads on near-term hardware

Sample-based Krylov quantum diagonalization (SKQD) is a paradigmatic example of a quantum-centric supercomputing workflow that combines the convergence structure of Krylov quantum diagonalization with classical sampling-based post-processing. It provides convergence guarantees assuming that the important computational-basis configurations can be sampled from a set of Krylov states with sufficient probability. We analyze this assumption under depolarizing noise, deriving shot-count resource estimates that expose an exponential depth penalty, and perform experiments on current noisy hardware with the one-dimensional single-impurity Anderson model on a 20-site (40-qubit) instance. Device noise breaks the practical convergence predicted by the noiseless SKQD analysis, but approximate compilation techniques can compress the Krylov time-evolution circuits before execution. The compressed circuits accumulate less hardware noise, recover the expected energy convergence, and reduce both the quantum shot budget and the classical subspace dimension, remaining beneficial even when classical configuration recovery is applied.

quant-ph↗

arXiv2026

Entanglement scaling in matrix product state representation of smooth functions and their shallow quantum circuit approximations

Encoding classical data in a quantum state is a key prerequisite of many quantum algorithms. Recently matrix product state (MPS) methods emerged as the most promising approach for constructing shallow quantum circuits approximating input functions, including probability distributions, with only linear number of gates. We derive rigorous asymptotic expansions for the decay of entanglement across bonds in the MPS representation depending on the smoothness of the input function, real or complex. We also consider the dependence of the entanglement on localization properties and function support. Based on these analytical results we construct an improved MPS-based algorithm yielding shallow and accurate encoding quantum circuits. By using Tensor Cross Interpolation we are able to construct utility-scale quantum circuits in a compute- and memory-efficient way. We validate our methods by loading heavy-tailed distributions, including Levy, important in finance, but they apply to any smooth function inputs. We test the performance of the resulting quantum circuits by executing and sampling from them on IBM quantum devices, for up to 156 qubits.

quant-ph↗

arXiv2026

Information theory for dimensionality reduction in dynamical systems

The dynamics of many-body systems can often be captured in terms of only a few relevant variables. Mathematical and numerical approaches exist to identify these variables by exploiting a separation of time scales between slow relevant and fast irrelevant variables, but such a separation of scales is not always obvious or even available. In this work, we introduce an information-theoretic framework for dimensionality reduction in dynamical systems that bypasses this limitation by instead identifying relevant variables based on how predictive they are of the system's future. To do so, we mathematically formalize the intuition that model reduction is about keeping "relevant" information while throwing away "irrelevant" information. We characterize the solution of the resulting optimization problem and prove that it reduces to standard approaches when a separation of time scales is indeed present in the dynamics. Importantly, we find that within this framework, the problems of identifying relevant variables and identifying their effective dynamics decouple and may be solved separately. This makes the method tractable in practice and enables us to derive dimensionally-reduced variables from data with neural networks. Combined with existing equation learning methods, the procedure introduced in this work reveals the dynamical rules governing the system's evolution in a data-driven manner. We illustrate these tools in diverse settings including simulated chaotic systems, uncurated satellite recordings of atmospheric fluid flows, and experimental videos of cyanobacteria colonies in which we discover an emergent synchronization order parameter.

cond-mat.stat-mech↗

arXiv2026

Quantum algorithm for the lattice Boltzmann method with applications on real quantum devices

We introduce a novel quantum algorithm for the lattice Boltzmann method (LBM) based on the one-step simplified LBM. The structure of the algorithm allows for more flexibility in modelling different physics in contrast to earlier quantum algorithms for the LBM, while retaining computational efficiency in terms of the gate and qubit complexity. The new algorithm has potential for full end-to-end quantum utility especially for linear problems. We discuss the implementation of examples in linear acoustics, as well as a nonlinear Navier-Stokes problem that was solved on an IBM QPU in a hybrid simulation loop.

quant-ph↗

arXiv2025

Computational access to lattice and long-wavelength physics in quantum mutual information

Quantum mutual information is an important tool for characterizing correlations in quantum many-body systems, but its numerical evaluation is often prohibitively expensive. While some variants of Rényi Mutual Information (RMI) are computationally more tractable, it is not clear whether they correctly capture the long-wavelength physics or are dominated by UV effects, which is of key importance in lattice simulations. We analyze the relevance of lattice effects on the family of $α$-$z$ Rényi mutual informations for ground states of models with conformal field theory descriptions. On the example of massless free fermions we identify distinct regions in the $α$-$z$ plane, where RMI corrections due to the lattice are relevant or irrelevant. We further support these findings with MPS calculations on the transverse field Ising model (TFIM). Our results, accompanied by the open-source Julia package QMICalc$.$jl, provide guidance to using RMI in quantum-many body physics numerical computations.

quant-ph↗

arXiv2025

Distributed Quantum Dynamics on Near-Term Quantum Processors

Simulations of quantum dynamics are a key application of near term quantum computing, but are hindered by the twin challenges of noise and small device scale, which limit the executable circuit depths and the number of qubits the algorithm can be run on. Towards overcoming these obstacles we develop and implement a distributed variant of the projected Variational Quantum Dynamics which we dub dp-VQD, which allows to simultaneously alleviate circuit depth and width limitations. We employ the wire cutting technique, which can be executed on the existing devices without quantum or classical communication. We demonstrate the full variational training on noisy simulators, and execute and perform the reconstruction on real IBM quantum devices. The algorithm allows to execute Hamiltonian evolution simulations for problem sizes exceeding devices' nominal qubit counts, and to combine multiple small devices in a distributed computation. We test our approach on the Heisenberg and Hubbard model dynamics.

quant-ph↗

arXiv2024

Compression theory for inhomogeneous systems

The physics of complex systems stands to greatly benefit from the qualitative changes in data availability and advances in data-driven computational methods. Many of these systems can be represented by interacting degrees of freedom on inhomogeneous graphs. However, the lack of translational invariance presents a fundamental challenge to theoretical tools, such as the renormalization group, which were so successful in characterizing the universal physical behaviour in critical phenomena. Here we show that compression theory allows the extraction of relevant degrees of freedom in arbitrary geometries, and the development of efficient numerical tools to build an effective theory from data. We demonstrate our method by applying it to a strongly correlated system on an Ammann-Beenker quasicrystal, where it discovers an exotic critical point with broken conformal symmetry. We also apply it to an antiferromagnetic system on non-bipartite random graphs, where any periodicity is absent.

cond-mat.stat-mech↗

arXiv2023

Machine Learning the Operator Content of the Critical Self-Dual Ising-Higgs Gauge Model

We study the critical properties of the Ising-Higgs gauge theory in $(2+1)D$ along the self-dual line which have recently been a subject of debate. For the first time, using machine learning techniques, we determine the low energy operator content of the associated field theory. Our approach enables us to largely refute the existence of an emergent current operator and with it the standing conjecture that this transition is of the $XY^*$ universality class. We contrast these results with the ones obtained for the $(2+1)D$ Ashkin-Teller transverse field Ising model where we find the expected current operator. Our numerical technique extends the recently proposed Real-Space Mutual Information allowing us to extract sub-leading non-linear operators. This allows a controlled and computationally scalable approach to target CFT spectrum and discern universality classes beyond $(1+1)D$ from Monte Carlo data.

cond-mat.str-el↗

arXiv2021

Statistical physics through the lens of real-space mutual information

Identifying the relevant coarse-grained degrees of freedom in a complex physical system is a key stage in developing powerful effective theories in and out of equilibrium. The celebrated renormalization group provides a framework for this task, but its practical execution in unfamiliar systems is fraught with ad hoc choices, whereas machine learning approaches, though promising, often lack formal interpretability. Recently, the optimal coarse-graining in a statistical system was shown to exist, based on a universal, but computationally difficult information-theoretic variational principle. This limited its applicability to but the simplest systems; moreover, the relation to standard formalism of field theory was unclear. Here we present an algorithm employing state-of-art results in machine-learning-based estimation of information-theoretic quantities, overcoming these challenges. We use this advance to develop a new paradigm in identifying the most relevant field theory operators describing properties of the system, going beyond the existing approaches to real-space renormalization. We evidence its power on an interacting model, where the emergent degrees of freedom are qualitatively different from the microscopic building blocks of the theory. Our results push the boundary of formally interpretable applications of machine learning, conceptually paving the way towards automated theory building.

cond-mat.stat-mech↗

arXiv2021

Symmetries and phase diagrams with real-space mutual information neural estimation

Real-space mutual information (RSMI) was shown to be an important quantity, formally and from a numerical standpoint, in finding coarse-grained descriptions of physical systems. It very generally quantifies spatial correlations, and can give rise to constructive algorithms extracting relevant degrees of freedom. Efficient and reliable estimation or maximization of RSMI is, however, numerically challenging. A recent breakthrough in theoretical machine learning has been the introduction of variational lower bounds for mutual information, parametrized by neural networks. Here we describe in detail how these results can be combined with differentiable coarse-graining operations to develop a single unsupervised neural-network based algorithm, the RSMI-NE, efficiently extracting the relevant degrees of freedom in the form of the operators of effective field theories, directly from real-space configurations. We study the information contained in the statistical ensemble of constructed coarse-graining transformations, and its recovery from partial input data using a secondary machine learning analysis applied to this ensemble. In particular, we show how symmetries, also emergent, can be identified. We demonstrate the extraction of the phase diagram and the order parameters for equilibrium systems, and consider also an example of a non-equilibrium problem.

cond-mat.stat-mech↗

arXiv2020

Relevance in the Renormalization Group and in Information Theory

The analysis of complex physical systems hinges on the ability to extract the relevant degrees of freedom from among the many others. Though much hope is placed in machine learning, it also brings challenges, chief of which is interpretability. It is often unclear what relation, if any, the architecture- and training-dependent learned "relevant" features bear to standard objects of physical theory. Here we report on theoretical results which may help to systematically address this issue: we establish equivalence between the information-theoretic notion of relevance defined in the Information Bottleneck (IB) formalism of compression theory, and the field-theoretic relevance of the Renormalization Group. We show analytically that for statistical physical systems described by a field theory the "relevant" degrees of freedom found using IB compression indeed correspond to operators with the lowest scaling dimensions. We confirm our field theoretic predictions numerically. We study dependence of the IB solutions on the physical symmetries of the data. Our findings provide a dictionary connecting two distinct theoretical toolboxes, and an example of constructively incorporating physical interpretability in applications of deep learning in physics.

cond-mat.stat-mech↗

arXiv2019

Optimal Renormalization Group Transformation from Information Theory

Recently a novel real-space RG algorithm was introduced, identifying the relevant degrees of freedom of a system by maximizing an information-theoretic quantity, the real-space mutual information (RSMI), with machine learning methods. Motivated by this, we investigate the information theoretic properties of coarse-graining procedures, for both translationally invariant and disordered systems. We prove that a perfect RSMI coarse-graining does not increase the range of interactions in the renormalized Hamiltonian, and, for disordered systems, suppresses generation of correlations in the renormalized disorder distribution, being in this sense optimal. We empirically verify decay of those measures of complexity, as a function of information retained by the RG, on the examples of arbitrary coarse-grainings of the clean and random Ising chain. The results establish a direct and quantifiable connection between properties of RG viewed as a compression scheme, and those of physical objects i.e. Hamiltonians and disorder distributions. We also study the effect of constraints on the number and type of coarse-grained degrees of freedom on a generic RG procedure.

cond-mat.stat-mech↗

arXiv2019

Training Deep Neural Networks by optimizing over nonlocal paths in hyperparameter space

Hyperparameter optimization is both a practical issue and an interesting theoretical problem in training of deep architectures. Despite many recent advances the most commonly used methods almost universally involve training multiple and decoupled copies of the model, in effect sampling the hyperparameter space. We show that at a negligible additional computational cost, results can be improved by sampling nonlocal paths instead of points in hyperparameter space. To this end we interpret hyperparameters as controlling the level of correlated noise in training, which can be mapped to an effective temperature. The usually independent instances of the model are coupled and allowed to exchange their hyperparameters throughout the training using the well established parallel tempering technique of statistical physics. Each simulation corresponds then to a unique path, or history, in the joint hyperparameter/model-parameter space. We provide empirical tests of our method, in particular for dropout and learning rate optimization. We observed faster training and improved resistance to overfitting and showed a systematic decrease in the absolute validation error, improving over benchmark results.

cs.LG↗

arXiv2019

An exactly soluble model for a fractionalized Weyl semimetal

We construct an exactly solvable lattice model of a fractional Weyl semimetal (FWS). The low energy theory of this strongly interacting state is that of a Weyl semimetal built out of fractionally charged fermions. We show the existence of a universally quantized and fractional circular photogalvanic effect (CPGE) and a violation of the Wiedemann-Franz law in the system. Together with a spectral gap in the single-particle electronic Green's function they provide strong experimental signatures for this exotic gapless state of matter.

cond-mat.str-el↗

arXiv2018

Mutual Information, Neural Networks and the Renormalization Group

Physical systems differring in their microscopic details often display strikingly similar behaviour when probed at macroscopic scales. Those universal properties, largely determining their physical characteristics, are revealed by the powerful renormalization group (RG) procedure, which systematically retains "slow" degrees of freedom and integrates out the rest. However, the important degrees of freedom may be difficult to identify. Here we demonstrate a machine learning algorithm capable of identifying the relevant degrees of freedom and executing RG steps iteratively without any prior knowledge about the system. We introduce an artificial neural network based on a model-independent, information-theoretic characterization of a real-space RG procedure, performing this task. We apply the algorithm to classical statistical physics problems in one and two dimensions. We demonstrate RG flow and extract the Ising critical exponent. Our results demonstrate that machine learning techniques can extract abstract physical concepts and consequently become an integral part of theory- and model-building.

cond-mat.dis-nn↗

arXiv2016

Edge--Entanglement correspondence for gapped topological phases with symmetry

The correspondence between the edge theory and the entanglement spectrum is firmly established for the chiral topological phases. We study gapped, topologically ordered, non-chiral states with a conserved $U(1)$ charge and show that the entanglement Hamiltonian contains not only the information about topologically distinct edges such phases may admit, but also which of them will be realized in the presence of symmetry breaking/conserving perturbations. We introduce an exactly solvable, charge conserving lattice model of a $\mathbb{Z}_2$ spin liquid and derive its edge theory and the entanglement Hamiltonian, also in the presence of perturbations. We construct a field theory of the edge and study its RG flow. We show the precise extent of the correspondence between the information contained in the entanglement Hamiltonian and the edge theory.

cond-mat.str-el↗