SearcharxivSearch

arXiv subjects

Filip Wudarski

Publications and source records attributed to Filip Wudarski.

At least 19 recordsLinked to original sources

Sequential Reservoir Computing for Efficient High-Dimensional Spatiotemporal Forecasting

Forecasting high-dimensional spatiotemporal systems remains computationally challenging for recurrent neural networks (RNNs) and long short-term memory (LSTM) models due to gradient-based training and memory bottlenecks. Reservoir Computing (RC) mitigates these challenges by replacing backpropagation with fixed recurrent layers and a convex readout optimization, yet conventional RC architectures still scale poorly with input dimensionality. We introduce a Sequential Reservoir Computing (Sequential RC) architecture that decomposes a large reservoir into a series of smaller, interconnected reservoirs. This design reduces memory and computational costs while preserving long-term temporal dependencies. Using both low-dimensional chaotic systems (Lorenz63) and high-dimensional physical simulations (2D vorticity and shallow-water equations), Sequential RC achieves 15-25% longer valid forecast horizons, 20-30% lower error metrics (SSIM, RMSE), and up to three orders of magnitude lower training cost compared to LSTM and standard RNN baselines. The results demonstrate that Sequential RC maintains the simplicity and efficiency of conventional RC while achieving superior scalability for high-dimensional dynamical systems. This approach provides a practical path toward real-time, energy-efficient forecasting in scientific and engineering applications.

cs.LG

From quantum feature maps to quantum reservoir computing: perspectives and applications

We explore the interplay between two emerging paradigms: reservoir computing and quantum computing. We observe how quantum systems featuring beyond-classical correlations and vast computational spaces can serve as non-trivial, experimentally viable reservoirs for typical tasks in machine learning. With a focus on neutral atom quantum processing units, we describe and exemplify a novel quantum reservoir computing (QRC) workflow. We conclude exploratively discussing the main challenges ahead, whilst arguing how QRC can offer a natural candidate to push forward reservoir computing applications.

quant-ph

Revealing inadvertent periodic modulation of qubit frequency

The paper describes the means to reveal and characterize slow periodic modulation of qubit frequency. Such modulation can come from different sources and can impact qubit stability. We show that the modulation leads to very sharp peaks in the power spectrum of outcomes of periodically repeated Ramsey measurements. The positions and shapes of the peaks allow finding both the frequency and the amplitude of the modulation. We also explore how additional slow fluctuations of the qubit frequency and fluctuations of the modulation frequency affect the spectrum. The analytical results are in excellent agreement with extensive simulations.

quant-ph

Hybrid quantum-classical reservoir computing for simulating chaotic systems

Forecasting chaotic systems is a notably complex task, which in recent years has been approached with reasonable success using reservoir computing (RC), a recurrent network with fixed random weights (the reservoir) used to extract the spatio-temporal information of the system. This work presents a hybrid quantum reservoir-computing (HQRC) framework, which replaces the reservoir in RC with a quantum circuit. The modular structure and measurement feedback in the circuit are used to encode the complex system dynamics in the reservoir states, from which classical learning is performed to predict future dynamics. The noiseless simulations of HQRC demonstrate valid prediction times comparable to state-of-the-art classical RC models for both the Lorenz63 and double-scroll chaotic paradigmatic systems and adhere to the attractor dynamics long after the forecasts have deviated from the ground truth.

quant-ph

Benchmarking the Operation of Quantum Heuristics and Ising Machines: Scoring Parameter Setting Strategies on Optimization Applications

We discuss guidelines for evaluating the performance of parameterized stochastic solvers for optimization problems, with particular attention to systems that employ novel hardware, such as digital quantum processors running variational algorithms, analog processors performing quantum annealing, or coherent Ising Machines. We illustrate through an example a benchmarking procedure grounded in the statistical analysis of the expectation of a given performance metric measured in a test environment. In particular, we discuss the necessity and cost of setting parameters that affect the algorithm's performance. The optimal value of these parameters could vary significantly between instances of the same target problem. We present an open-source software package that facilitates the design, evaluation, and visualization of practical parameter tuning strategies for complex use of the heterogeneous components of the solver. We examine in detail an example using parallel tempering and a simulator of a photonic Coherent Ising Machine computing and display the scoring of an illustrative baseline family of parameter-setting strategies that feature an exploration-exploitation trade-off.

quant-ph

Wave function Ansatz (but Periodic) Networks and the Homogeneous Electron Gas

We design a neural network Ansatz for variationally finding the ground-state wave function of the Homogeneous Electron Gas, a fundamental model in the physics of extended systems of interacting fermions. We study the spin-polarised and paramagnetic phases with 7, 14 and 19 electrons over a broad range of densities from $r_s=1$ to $r_s=100$, obtaining similar or higher accuracy compared to a state-of-the-art iterative backflow baseline even in the challenging regime of very strong correlation. Our work extends previous applications of neural network Ansätze to molecular systems with methods for handling periodic boundary conditions, and makes two notable changes to improve performance: splitting the pairwise streams by spin alignment and generating backflow coordinates for the orbitals from the network. We illustrate the advantage of our high quality wave functions in computing the reduced single particle density matrix. This contribution establishes neural network models as flexible and high precision Ansätze for periodic electronic systems, an important step towards applications to crystalline solids.

physics.chem-ph

Two-Unitary Decomposition Algorithm and Open Quantum System Simulation

Simulating general quantum processes that describe realistic interactions of quantum systems following a non-unitary evolution is challenging for conventional quantum computers that directly implement unitary gates. We analyze complexities for promising methods such as the Sz.-Nagy dilation and linear combination of unitaries that can simulate open systems by the probabilistic realization of non-unitary operators, requiring multiple calls to both the encoding and state preparation oracles. We propose a quantum two-unitary decomposition (TUD) algorithm to decompose a $d$-dimensional operator $A$ with non-zero singular values as $A=(U_1+U_2)/2$ using the quantum singular value transformation algorithm, avoiding classically expensive singular value decomposition (SVD) with an $O(d^3)$ overhead in time. The two unitaries can be deterministically implemented, thus requiring only a single call to the state preparation oracle for each. The calls to the encoding oracle can also be reduced significantly at the expense of an acceptable error in measurements. Since the TUD method can be used to implement non-unitary operators as only two unitaries, it also has potential applications in linear algebra and quantum machine learning.

quant-ph

Nonergodic measurements of qubit frequency noise

Slow fluctuations of a qubit frequency are one of the major problems faced by quantum computers. To understand their origin it is necessary to go beyond the analysis of their spectra. We show that characteristic features of the fluctuations can be revealed using comparatively short sequences of periodically repeated Ramsey measurements, with the sequence duration smaller than needed for the noise to approach the ergodic limit. The outcomes distribution and its dependence on the sequence duration are sensitive to the nature of noise. The time needed for quantum measurements to display quasi-ergodic behavior can strongly depend on the measurement parameters.

quant-ph

Characterizing low-frequency qubit noise

Fluctuations of the qubit frequencies are one of the major problems to overcome on the way to scalable quantum computers. Of particular importance are fluctuations with the correlation time that exceeds the decoherence time due to decay and dephasing by fast processes. The statistics of the fluctuations can be characterized by measuring the correlators of the outcomes of periodically repeated Ramsey measurements. This work suggests a method that allows describing qubit dynamics during repeated measurements in the presence of evolving noise. It made it possible, in particular, to evaluate the two-time correlator for the noise from two-level systems and obtain two- and three-time correlators for a Gaussian noise. The explicit expressions for the correlators are compared with simulations. A significant difference of the three-time correlators for the noise from two-level systems and for a Gaussian noise is demonstrated. Strong broadening of the distribution of the outcomes of Ramsey measurements, with a possible fine structure, is found for the data acquisition time comparable to the noise correlation time.

quant-ph

Simulations of state-of-the-art fermionic neural network wave functions with diffusion Monte Carlo

Recently developed neural network-based \emph{ab-initio} solutions (Pfau et. al arxiv:1909.02487v2) for finding ground states of fermionic systems can generate state-of-the-art results on a broad class of systems. In this work, we improve the results for this Ansatz with Diffusion Monte Carlo. Additionally, we introduce several modifications to the network (Fermi Net) and optimization method (Kronecker Factored Approximate Curvature) that reduce the number of required resources while maintaining or improving the modelling performance. In terms of the model, we remove redundant computations and alter the way data is handled in the permutation equivariant function. The Diffusion Monte Carlo results exceed or match state-of-the-art performance for all systems investigated: atomic systems Be-Ne, and the carbon cation C$^+$.

physics.chem-ph

Real time evolution for ultracompact Hamiltonian eigenstates on quantum hardware

In this work we present a detailed analysis of variational quantum phase estimation (VQPE), a method based on real-time evolution for ground and excited state estimation on near-term hardware. We derive the theoretical ground on which the approach stands, and demonstrate that it provides one of the most compact variational expansions to date for solving strongly correlated Hamiltonians. At the center of VQPE lies a set of equations, with a simple geometrical interpretation, which provides conditions for the time evolution grid in order to decouple eigenstates out of the set of time evolved expansion states, and connects the method to the classical filter diagonalization algorithm. Further, we introduce what we call the unitary formulation of VQPE, in which the number of matrix elements that need to be measured scales linearly with the number of expansion states, and we provide an analysis of the effects of noise which substantially improves previous considerations. The unitary formulation allows for a direct comparison to iterative phase estimation. Our results mark VQPE as both a natural and highly efficient quantum algorithm for ground and excited state calculations of general many-body systems. We demonstrate a hardware implementation of VQPE for the transverse field Ising model. Further, we illustrate its power on a paradigmatic example of strong correlation (Cr2 in the SVP basis set), and show that it is possible to reach chemical accuracy with as few as ~50 timesteps.

quant-ph

Entanglement Across Separate Silicon Dies in a Modular Superconducting Qubit Device

Assembling future large-scale quantum computers out of smaller, specialized modules promises to simplify a number of formidable science and engineering challenges. One of the primary challenges in developing a modular architecture is in engineering high fidelity, low-latency quantum interconnects between modules. Here we demonstrate a modular solid state architecture with deterministic inter-module coupling between four physically separate, interchangeable superconducting qubit integrated circuits, achieving two-qubit gate fidelities as high as 99.1$\pm0.5$\% and 98.3$\pm$0.3\% for iSWAP and CZ entangling gates, respectively. The quality of the inter-module entanglement is further confirmed by a demonstration of Bell-inequality violation for disjoint pairs of entangled qubits across the four separate silicon dies. Having proven out the fundamental building blocks, this work provides the technological foundations for a modular quantum processor: technology which will accelerate near-term experimental efforts and open up new paths to the fault-tolerant era for solid state qubit architectures.

quant-ph

Quantum algorithms with local particle number conservation: noise effects and error correction

Quantum circuits with local particle number conservation (LPNC) restrict the quantum computation to a subspace of the Hilbert space of the qubit register. In a noiseless or fault-tolerant quantum computation, such quantities are preserved. In the presence of noise, however, the evolution's symmetry could be broken and non-valid states could be sampled at the end of the computation. On the other hand, the restriction to a subspace in the ideal case suggest the possibility of more resource efficient error mitigation techniques for circuits preserving symmetries that are not possible for general circuits. Here, we analyze the probability of staying in such symmetry-preserved subspaces under noise, providing an exact formula for local depolarizing noise. We apply our findings to benchmark, under depolarizing noise, the symmetry robustness of XY-QAOA, which has local particle number conserving symmetries, and is a special case of the Quantum Alternating Operator Ansatz. We also analyze the influence of the choice of encoding the problem on the symmetry robustness of the algorithm and discuss a simple adaption of the bit flip code to correct for symmetry-breaking errors with reduced resources.

quant-ph

Augmented fidelities for single qubit gates

An average gate fidelity is a standard performance metric to quantify deviation between an ideal unitary gate transformation and its realistic experimental implementation. The average is taken with respect to states uniformly distributed over the full Hilbert space. We analytically (single-qubit) and numerically (two-qubit) show how this average changes if the uniform distribution condition is relaxed, replaced by parametrized distributions - polar cap and von Mises-Fisher distributions - and how the resulting fidelities can differentiate certain noise models. In particular, we demonstrate that Pauli channels with different noise rates along the three axes can be faithfully distinguished using these augmented fidelities.

quant-ph

Entanglement Production and Convergence Properties of the Variational Quantum Eigensolver

We perform a systematic investigation of variational forms (wave function Ansätze), to determine the ground state energies and properties of two-dimensional model fermionic systems on triangular lattices (with and without periodic boundary conditions), using the Variational Quantum Eigensolver (VQE) algorithm. In particular, we focus on the nature of the entangler blocks which provide the most efficient convergence to the system ground state inasmuch as they use the minimal number of gate operations, which is key for the implementation of this algorithm in NISQ computers. Using the concurrence measure, the amount of entanglement of the register qubits is monitored during the entire optimization process, illuminating its role in determining the efficiency of the convergence. Finally, we investigate the scaling of the VQE circuit depth as a function of the desired energy accuracy. We show that the number of gates required to reach a solution within an error $\varepsilon$ follows the Solovay-Kitaev scaling, $\mathcal{O}(\log^c(1/\varepsilon))$, with an exponent $c = 1.31 {\rm{\pm}}0.13$.

quant-ph

Characterizing local noise in QAOA circuits

Recently Xue et al. [arXiv:1909.02196] demonstrated numerically that QAOA performance varies as a power law in the amount of noise under certain physical noise models. In this short note, we provide a deeper analysis of the origin of this behavior. In particular, we provide an approximate closed form equation for the fidelity and cost in terms of the noise rate, system size, and circuit depth. As an application, we show these equations accurately model the trade off between larger circuits which attain better cost values, at the expense of greater degradation due to noise.

quant-ph

Channel Coding of a Quantum Measurement

In this work, we consider the preservation of a measurement for quantum systems interacting with an environment. Namely, a method of preserving an optimal measurement over a channel is devised, what we call channel coding of a quantum measurement in that operations are applied before and after a channel in order to protect a measurement. A protocol that preserves a quantum measurement over an arbitrary channel is shown only with local operations and classical communication without the use of a larger Hilbert space. Therefore, the protocol is readily feasible with present day's technologies. Channel coding of qubit measurements is presented, and it is shown that a measurement can be preserved for an arbitrary channel for both i) pairs of qubit states and ii) ensembles of equally probable states. The protocol of preserving a quantum measurement is demonstrated with IBM quantum computers.

quant-ph

Optimizing quantum heuristics with meta-learning

Variational quantum algorithms, a class of quantum heuristics, are promising candidates for the demonstration of useful quantum computation. Finding the best way to amplify the performance of these methods on hardware is an important task. Here, we evaluate the optimization of quantum heuristics with an existing class of techniques called `meta-learners'. We compare the performance of a meta-learner to Bayesian optimization, evolutionary strategies, L-BFGS-B and Nelder-Mead approaches, for two quantum heuristics (quantum alternating operator ansatz and variational quantum eigensolver), on three problems, in three simulation environments. We show that the meta-learner comes near to the global optima more frequently than all other optimizers we tested in a noisy parameter setting environment. We also find that the meta-learner is generally more resistant to noise, for example seeing a smaller reduction in performance in Noisy and Sampling environments and performs better on average by a `gain' metric than its closest comparable competitor L-BFGS-B. These results are an important indication that meta-learning and associated machine learning methods will be integral to the useful application of noisy near-term quantum computers.

quant-ph