arXiv subjects

Kamil Korzekwa

Publications and source records attributed to Kamil Korzekwa.

At least 19 recordsLinked to original sources

arXiv2026

Quantum Koopman Algorithms

Solving high-dimensional dynamical systems by encoding their state in the amplitudes of a quantum state is expected to be a core application of fault-tolerant quantum computers. However, the conditions under which this paradigm yields quantum advantage can be restrictive, motivating complementary approaches. Here, we introduce Quantum Koopman Algorithms, where quantum amplitudes encode approximately closed sets of observables for a linear or nonlinear dynamics. These amplitudes evolve under the Koopman operator, and we establish conditions for efficient quantum algorithms addressing both dynamical and spectral problems. With this approach, we show that classes of open-system dynamics involving exponentially large fermionic systems can be efficiently simulated on a quantum computer. For nonlinear dynamics, we introduce a novel nonlinear interaction picture that enables quantum simulation beyond existing weak-nonlinearity conditions, and extract late-time spectral data where quantum phase estimation is unavailable.

quant-ph↗

arXiv2026

Finite-size catalysis in quantum resource theories

Quantum catalysis, the ability to enable previously impossible transformations by using auxiliary systems without degrading them, has emerged as a powerful tool in various resource theories. Although catalytically enabled state transformations have been formally characterized by the monotonic behaviour of entropic quantifiers (e.g., the von Neumann entropy or non-equilibrium free energy), such characterizations often rely on unphysical assumptions, namely the ability of using catalysts of infinitely large dimension. This approach offers very limited insights into the practical significance of using catalysis for quantum information processing. Here, we address this problem across a broad class of quantum resource theories. Leveraging quantum information tools beyond the asymptotic regime, we establish sufficient conditions for the existence of catalytic transformations with finite-size catalysts. We further unveil connections between finite-size catalysis and multi-copy transformations. Notably, we discover a phenomenon of catalytic resonance: by carefully tailoring the catalysts's state, one can drastically reduce the required dimension of the catalyst, thus enabling efficient catalytic transformations with minimal resources. Finally, we illustrate our findings with examples from the resource theories of entanglement and thermodynamics, as well in the context of catalytic unitary transformations.

quant-ph↗

arXiv2025

Simulating non-trivial incompressible flows with a quantum lattice Boltzmann algorithm

Quantum algorithms have been identified as a potential means to accelerate computational fluid dynamics (CFD) simulations, with the lattice Boltzmann method (LBM) being a promising candidate for realizing quantum speedups. Here, we extend the recent quantum algorithm for the incompressible LBM to account for realistic fluid dynamics setups by incorporating walls, inlets, outlets, and external forcing. We analyze the associated complexity cost and show that these modifications preserve the asymptotic scaling, and potential quantum advantage, of the original algorithm. Moreover, to support our theoretical analysis, we provide a classical numerical study illustrating the accuracy, complexity, and convergence of the algorithm for representative incompressible-flow cases, including the driven Taylor-Green vortex, the lid-driven cavity flow, and the flow past a cylinder. Our results provide a pathway to accurate quantum simulation of nonlinear fluid dynamics, and a framework for extending quantum LBM to more challenging flow configurations.

physics.flu-dyn↗

arXiv2025

An end-to-end quantum algorithm for nonlinear fluid dynamics with bounded quantum advantage

Computational fluid dynamics (CFD) is a cornerstone of classical scientific computing, and there is growing interest in whether quantum computers can accelerate such simulations. To date, the existing proposals for fault-tolerant quantum algorithms for CFD have almost exclusively been based on the Carleman embedding method, used to encode nonlinearities on a quantum computer. In this work, we begin by showing that these proposals suffer from a range of severe bottlenecks that negate conjectured quantum advantages: lack of convergence of the Carleman method, prohibitive time-stepping requirements, unfavorable condition number scaling, and inefficient data extraction. With these roadblocks clearly identified, we develop a novel algorithm for the incompressible lattice Boltzmann equation that circumvents these obstacles, and then provide a detailed analysis of our algorithm, including all potential sources of algorithmic complexity, as well as gate count estimates. We find that for an end-to-end problem, a modest quantum advantage may be preserved for selected observables in the high-error-tolerance regime. We lower bound the Reynolds number scaling of our quantum algorithm in dimension $D$ at Kolmogorov microscale resolution with $O(\mathrm{Re}^{\frac{3}{4}(1+\frac{D}{2})} \times q_M)$, where $q_M$ is a multiplicative overhead for data extraction with $q_M = O(\mathrm{Re}^{\frac{3}{8}})$ for the drag force. This upper bounds the scaling improvement over classical algorithms by $O(\mathrm{Re}^{\frac{3D}{8}})$. However, our numerical investigations suggest a lower speedup, with a scaling estimate of $O(\mathrm{Re}^{1.936} \times q_M)$ for $D=2$. Our results give robust evidence that small, but nontrivial, quantum advantages can be achieved in the context of CFD, and motivate the need for additional rigorous end-to-end quantum algorithm development.

quant-ph↗

arXiv2025

Quantum algorithms for general nonlinear dynamics based on the Carleman embedding

Important nonlinear dynamics, such as those found in plasma and fluid systems, are typically hard to simulate on classical computers. Thus, if fault-tolerant quantum computers could efficiently solve such nonlinear problems, it would be a transformative change for many industries. In a recent breakthrough [Liu et al., PNAS 2021], the first efficient quantum algorithm for solving nonlinear differential equations was constructed, based on a single condition $R<1$, where $R$ characterizes the ratio of nonlinearity to dissipation. This result, however, is limited to the class of purely dissipative systems with negative log-norm, which excludes application to many important problems. In this work, we correct technical issues with this and other prior analysis, and substantially extend the scope of nonlinear dynamical systems that can be efficiently simulated on a quantum computer in a number of ways. Firstly, we extend the existing results from purely dissipative systems to a much broader class of stable systems, and show that every quadratic Lyapunov function for the linearized system corresponds to an independent $R$-number criterion for the convergence of the Carlemen scheme. Secondly, we extend our stable system results to physically relevant settings where conserved polynomial quantities exist. Finally, we provide extensive results for the class of non-resonant systems. With this, we are able to show that efficient quantum algorithms exist for a much wider class of nonlinear systems than previously known, and prove the BQP-completeness of nonlinear oscillator problems of exponential size. In our analysis, we also obtain several results related to the Poincaré-Dulac theorem and diagonalization of the Carleman matrix, which could be of independent interest.

quant-ph↗

arXiv2024

Improved simulation of quantum circuits dominated by free fermionic operations

We present a classical algorithm for simulating universal quantum circuits composed of "free" nearest-neighbour matchgates or equivalently fermionic-linear-optical (FLO) gates, and "resourceful" non-Gaussian gates. We achieve the promotion of the efficiently simulable FLO subtheory to universal quantum computation by gadgetizing controlled phase gates with arbitrary phases employing non-Gaussian resource states. Our key contribution is the development of a novel phase-sensitive algorithm for simulating FLO circuits. This allows us to decompose the resource states arising from gadgetization into free states at the level of statevectors rather than density matrices. The runtime cost of our algorithm for estimating the Born-rule probability of a given quantum circuit scales polynomially in all circuit parameters, except for a linear dependence on the newly introduced FLO extent, which scales exponentially with the number of controlled-phase gates. More precisely, as a result of finding optimal decompositions of relevant resource states, the runtime doubles for every maximally resourceful (e.g., swap or CZ) gate added. Crucially, this cost compares very favourably with the best known prior algorithm, where each swap gate increases the simulation cost by a factor of approximately 9. For a quantum circuit containing arbitrary FLO unitaries and $k$ controlled-Z gates, we obtain an exponential improvement $O(4.5^k)$ over the prior state-of-the-art.

quant-ph↗

arXiv2024

Perfect quantum protractors

In this paper we introduce and investigate the concept of a perfect quantum protractor, a pure quantum state $|ψ\rangle\in\mathcal{H}$ that generates three different orthogonal bases of $\mathcal{H}$ under rotations around each of the three perpendicular axes. Such states can be understood as pure states of maximal uncertainty with regards to the three components of the angular momentum operator, as we prove that they maximise various entropic and variance-based measures of such uncertainty. We argue that perfect quantum protractors can only exist for systems with a well-defined total angular momentum $j$, and we prove that they do not exist for $j\in\{1/2,2,5/2\}$, but they do exist for $j\in\{1,3/2,3\}$ (with numerical evidence for their existence when $j=7/2$). We also explain that perfect quantum protractors form an optimal resource for a metrological task of estimating the angle of rotation around (or the strength of magnetic field along) one of the three perpendicular axes, when the axis is not $\textit{a priori}$ known. Finally, we demonstrate this metrological utility by performing an experiment with warm atomic vapours of rubidium-87, where we prepare a perfect quantum protractor for a spin-1 system, let it precess around $x$, $y$ or $z$ axis, and then employ it to optimally estimate the rotation angle.

quant-ph↗

arXiv2024

Quantum-embeddable stochastic matrices

The classical embeddability problem asks whether a given stochastic matrix $T$, describing transition probabilities of a $d$-level system, can arise from the underlying homogeneous continuous-time Markov process. Here, we investigate the quantum version of this problem, asking of the existence of a Markovian quantum channel generating state transitions described by a given $T$. More precisely, we aim at characterising the set of quantum-embeddable stochastic matrices that arise from memoryless continuous-time quantum evolution. To this end, we derive both upper and lower bounds on that set, providing new families of stochastic matrices that are quantum-embeddable but not classically-embeddable, as well as families of stochastic matrices that are not quantum-embeddable. As a result, we demonstrate that a larger set of transition matrices can be explained by memoryless models if the dynamics is allowed to be quantum, but we also identify a non-zero measure set of random processes that cannot be explained by either classical or quantum memoryless dynamics. Finally, we fully characterise extreme stochastic matrices (with entries given only by zeros and ones) that are quantum-embeddable.

quant-ph↗

arXiv2024

Quantum dichotomies and coherent thermodynamics beyond first-order asymptotics

We address the problem of exact and approximate transformation of quantum dichotomies in the asymptotic regime, i.e., the existence of a quantum channel $\mathcal E$ mapping $ρ_1^{\otimes n}$ into $ρ_2^{\otimes R_nn}$ with an error $ε_n$ (measured by trace distance) and $σ_1^{\otimes n}$ into $σ_2^{\otimes R_n n}$ exactly, for a large number $n$. We derive second-order asymptotic expressions for the optimal transformation rate $R_n$ in the small, moderate, and large deviation error regimes, as well as the zero-error regime, for an arbitrary pair $(ρ_1,σ_1)$ of initial states and a commuting pair $(ρ_2,σ_2)$ of final states. We also prove that for $σ_1$ and $σ_2$ given by thermal Gibbs states, the derived optimal transformation rates in the first three regimes can be attained by thermal operations. This allows us, for the first time, to study the second-order asymptotics of thermodynamic state interconversion with fully general initial states that may have coherence between different energy eigenspaces. Thus, we discuss the optimal performance of thermodynamic protocols with coherent inputs and describe three novel resonance phenomena allowing one to significantly reduce transformation errors induced by finite-size effects. What is more, our result on quantum dichotomies can also be used to obtain, up to second-order asymptotic terms, optimal conversion rates between pure bipartite entangled states under local operations and classical communication.

quant-ph↗

arXiv2024

Resource engines

In this paper we aim to push the analogy between thermodynamics and quantum resource theories one step further. Previous inspirations were based predominantly on thermodynamic considerations concerning scenarios with a single heat bath, neglecting an important part of thermodynamics that studies heat engines operating between two baths at different temperatures. Here, we investigate the performance of resource engines, which replace the access to two heat baths at different temperatures with two arbitrary constraints on state transformations. The idea is to imitate the action of a two--stroke heat engine, where the system is sent to two agents (Alice and Bob) in turns, and they can transform it using their constrained sets of free operations. We raise and address several questions, including whether or not a resource engine can generate a full set of quantum operations or all possible state transformations, and how many strokes are needed for that. We also explain how the resource engine picture provides a natural way to fuse two or more resource theories, and we discuss in detail the fusion of two resource theories of thermodynamics with two different temperatures, and two resource theories of coherence with respect to two different bases.

quant-ph↗

arXiv2023

Thermal recall: Memory-assisted Markovian thermal processes

We develop a resource-theoretic framework that allows one to bridge the gap between two approaches to quantum thermodynamics based on Markovian thermal processes (which model memoryless dynamics) and thermal operations (which model arbitrarily non-Markovian dynamics). Our approach is built on the notion of memory-assisted Markovian thermal processes, where memoryless thermodynamic processes are promoted to non-Markovianity by explicitly modelling ancillary memory systems initialised in thermal equilibrium states. Within this setting, we propose a family of protocols composed of sequences of elementary two-level thermalisations that approximate all transitions between energy-incoherent states accessible via thermal operations. We prove that, as the size of the memory increases, these approximations become arbitrarily good for all transitions in the infinite temperature limit, and for a subset of transitions in the finite temperature regime. Furthermore, we present solid numerical evidence for the convergence of our protocol to any transition at finite temperatures. We also explain how our framework can be used to quantify the role played by memory effects in thermodynamic protocols such as work extraction. Finally, our results show that elementary control over two energy levels at a given time is sufficient to generate all energy-incoherent transitions accessible via thermal operations if one allows for ancillary thermal systems.

quant-ph↗

arXiv2022

Geometric structure of thermal cones

The second law of thermodynamics imposes a fundamental asymmetry in the flow of events. The so-called thermodynamic arrow of time introduces an ordering that divides the system's state space into past, future and incomparable regions. In this work, we analyse the structure of the resulting thermal cones, i.e., sets of states that a given state can thermodynamically evolve to (the future thermal cone) or evolve from (the past thermal cone). Specifically, for a $d$-dimensional classical state of a system interacting with a heat bath, we find explicit construction of the past thermal cone and the incomparable region. Moreover, we provide a detailed analysis of their behaviour based on thermodynamic monotones given by the volumes of thermal cones. Results obtained apply also to other majorisation-based resource theories (such as that of entanglement and coherence), since the partial ordering describing allowed state transformations is then the opposite of the thermodynamic order in the infinite temperature limit. Finally, we also generalise the construction of thermal cones to account for probabilistic transformations.

quant-ph↗

arXiv2022

Continuous thermomajorization and a complete set of laws for Markovian thermal processes

The standard dynamical approach to quantum thermodynamics is based on Markovian master equations describing the thermalization of a system weakly coupled to a large environment, and on tools such as entropy production relations. Here we develop a new framework overcoming the limitations that the current dynamical and information theory approaches encounter when applied to this setting. More precisely, we introduce the notion of continuous thermomajorization, and employ it to obtain necessary and sufficient conditions for the existence of a Markovian thermal process transforming between given initial and final energy distributions of the system. These lead to a complete set of generalized entropy production inequalities including the standard one as a special case. Importantly, these conditions can be reduced to a finitely verifiable set of constraints governing non-equilibrium transformations under master equations. What is more, the framework is also constructive, i.e., it returns explicit protocols realizing any allowed transformation. These protocols use as building blocks elementary thermalizations, which we prove to be universal controls. Finally, we also present an algorithm constructing the full set of energy distributions achievable from a given initial state via Markovian thermal processes and provide a $\texttt{Mathematica}$ implementation solving $d=6$ on a laptop computer in minutes.

quant-ph↗

arXiv2022

Optimizing thermalizations

We present a rigorous approach, based on the concept of continuous thermomajorisation, to algorithmically characterise the full set of energy occupations of a quantum system accessible from a given initial state through weak interactions with a heat bath. The algorithm can be deployed to solve complex optimization problems in out-of-equilibrium setups and it returns explicit elementary control sequences realizing optimal transformations. We illustrate this by finding optimal protocols in the context of cooling, work extraction and catalysis. The same tools also allow one to quantitatively assess the role played by memory effects in the performance of thermodynamic protocols. We obtained exhaustive solutions on a laptop machine for systems with dimension $d\leq 7$, but with heuristic methods one could access much higher $d$.

quant-ph↗

arXiv2022

Encoding classical information into quantum resources

We introduce and analyse the problem of encoding classical information into different resources of a quantum state. More precisely, we consider a general class of communication scenarios characterised by encoding operations that commute with a unique resource destroying map and leave free states invariant. Our motivating example is given by encoding information into coherences of a quantum system with respect to a fixed basis (with unitaries diagonal in that basis as encodings and the decoherence channel as a resource destroying map), but the generality of the framework allows us to explore applications ranging from super-dense coding to thermodynamics. For any state, we find that the number of messages that can be encoded into it using such operations in a one-shot scenario is upper-bounded in terms of the information spectrum relative entropy between the given state and its version with erased resources. Furthermore, if the resource destroying map is the twirling channel over some unitary group, we find matching one-shot lower-bounds as well. In the asymptotic setting where we encode into many copies of the resource state, our bounds yield an operational interpretation of resource monotones such as the relative entropy of coherence and its corresponding relative entropy variance.

quant-ph↗

arXiv2022

Fluctuation-dissipation relations for thermodynamic distillation processes

The fluctuation-dissipation theorem is a fundamental result in statistical physics that establishes a connection between the response of a system subject to a perturbation and the fluctuations associated with observables in equilibrium. Here we derive its version within a resource-theoretic framework, where one investigates optimal quantum state transitions under thermodynamic constraints. More precisely, we first characterise optimal thermodynamic distillation processes, and then prove a relation between the amount of free energy dissipated in such processes and the free energy fluctuations of the initial state of the system. Our results apply to initial states given by either asymptotically many identical pure systems or arbitrary number of independent energy-incoherent systems, and allow not only for a state transformation, but also for the change of Hamiltonian. The fluctuation-dissipation relations we derive enable us to find the optimal performance of thermodynamic protocols such as work extraction, information erasure and thermodynamically-free communication, up to second-order asymptotics in the number $N$ of processed systems. We thus provide a first rigorous analysis of these thermodynamic protocols for quantum states with coherence between different energy eigenstates in the intermediate regime of large but finite $N$.

quant-ph↗

arXiv2022

Fast estimation of outcome probabilities for quantum circuits

We present two classical algorithms for the simulation of universal quantum circuits on $n$ qubits constructed from $c$ instances of Clifford gates and $t$ arbitrary-angle $Z$-rotation gates such as $T$ gates. Our algorithms complement each other by performing best in different parameter regimes. The $\tt{Estimate}$ algorithm produces an additive precision estimate of the Born rule probability of a chosen measurement outcome with the only source of run-time inefficiency being a linear dependence on the stabilizer extent (which scales like $\approx 1.17^t$ for $T$ gates). Our algorithm is state-of-the-art for this task: as an example, in approximately $13$ hours (on a standard desktop computer), we estimated the Born rule probability to within an additive error of $0.03$, for a $50$-qubit, $60$ non-Clifford gate quantum circuit with more than $2000$ Clifford gates. Our second algorithm, $\tt{Compute}$, calculates the probability of a chosen measurement outcome to machine precision with run-time $O(2^{t-r} t)$ where $r$ is an efficiently computable, circuit-specific quantity. With high probability, $r$ is very close to $\min \{t, n-w\}$ for random circuits with many Clifford gates, where $w$ is the number of measured qubits. $\tt{Compute}$ can be effective in surprisingly challenging parameter regimes, e.g., we can randomly sample Clifford+$T$ circuits with $n=55$, $w=5$, $c=10^5$ and $t=80$ $T$ gates, and then compute the Born rule probability with a run-time consistently less than $10$ minutes using a single core of a standard desktop computer. We provide a C+Python implementation of our algorithms and benchmark them using random circuits, the hidden shift algorithm and the quantum approximate optimization algorithm (QAOA).

quant-ph↗

arXiv2021

Dephasing superchannels

We characterise a class of environmental noises that decrease coherent properties of quantum channels by introducing and analysing the properties of dephasing superchannels. These are defined as superchannels that affect only non-classical properties of a quantum channel $\mathcal{E}$, i.e., they leave invariant the transition probabilities induced by $\mathcal{E}$ in the distinguished basis. We prove that such superchannels $Ξ_C$ form a particular subclass of Schur-product supermaps that act on the Jamiolkowski state $J(\mathcal{E})$ of a channel $\mathcal{E}$ via a Schur product, $J'=J\circ C$. We also find physical realizations of general $Ξ_C$ through a pre- and post-processing employing dephasing channels with memory, and show that memory plays a non-trivial role for quantum systems of dimension $d>2$. Moreover, we prove that coherence generating power of a general quantum channel is a monotone under dephasing superchannels. Finally, we analyse the effect dephasing noise can have on a quantum channel $\mathcal{E}$ by investigating the number of distinguishable channels that $\mathcal{E}$ can be mapped to by a family of dephasing superchannels. More precisely, we upper bound this number in terms of hypothesis testing channel divergence between $\mathcal{E}$ and its fully dephased version, and also relate it to the robustness of coherence of $\mathcal{E}$.

quant-ph↗