Hybrid quantum algorithms for flow problems.

For quantum computing (QC) to emerge as a practically indispensable computational tool, there is a need for quantum protocols with end-to-end practical applications-in this instance, fluid dynamics. We debut here a high-performance quantum simulator which we term QFlowS (Quantum Flow Simulator), designed for fluid flow simulations using QC. Solving nonlinear flows by QC generally proceeds by solving an equivalent infinite dimensional linear system as a result of linear embedding. Thus, we first choose to simulate two well-known flows using QFlowS and demonstrate a previously unseen, full gate-level implementation of a hybrid and high precision Quantum Linear Systems Algorithms (QLSA) for simulating such flows at low Reynolds numbers. The utility of this simulator is demonstrated by extracting error estimates and power law scaling that relates [Formula: see text] (a parameter crucial to Hamiltonian simulations) to the condition number [Formula: see text] of the simulation matrix and allows the prediction of an optimal scaling parameter for accurate eigenvalue estimation. Further, we include two speedup preserving algorithms for a) the functional form or sparse quantum state preparation and b) in situ quantum postprocessing tool for computing nonlinear functions of the velocity field. We choose the viscous dissipation rate as an example, for which the end-to-end complexity is shown to be [Formula: see text], where [Formula: see text] is the size of the linear system of equations, [Formula: see text] is the solution error, and [Formula: see text] is the error in postprocessing. This work suggests a path toward quantum simulation of fluid flows and highlights the special considerations needed at the gate-level implementation of QC.

Robust multishot diffusion-weighted imaging of the abdomen with region-based shot rejection.

PURPOSE: Diffusion-weighted (DW) imaging provides a useful clinical contrast, but is susceptible to motion-induced dephasing caused by the application of strong diffusion gradients. Phase navigators are commonly used to resolve shot-to-shot motion-induced phase in multishot reconstructions, but poor phase estimates result in signal dropout and Apparent Diffusion Coefficient (ADC) overestimation. These artifacts are prominent in the abdomen, a region prone to involuntary cardiac and respiratory motion. To improve the robustness of DW imaging in the abdomen, region-based shot rejection schemes that selectively weight regions where the shot-to-shot phase is poorly estimated were evaluated. METHODS: Spatially varying weights for each shot, reflecting both the accuracy of the estimated phase and the degree of subvoxel dephasing, were estimated from the phase navigator magnitude images. The weighting was integrated into a multishot reconstruction using different formulations and phase navigator resolutions and tested with different phase navigator resolutions in multishot DW-echo Planar Imaging acquisitions of the liver and pancreas, using conventional monopolar and velocity-compensated diffusion encoding. Reconstructed images and ADC estimates were compared qualitatively. RESULTS: The proposed region-based shot rejection reduces banding and signal dropout artifacts caused by physiological motion in the liver and pancreas. Shot rejection allows conventional monopolar diffusion encoding to achieve median ADCs in the pancreas comparable to motion-compensated diffusion encoding, albeit with a greater spread of ADCs. CONCLUSION: Region-based shot rejection is a linear reconstruction that improves the motion robustness of multi-shot DWI and requires no sequence modifications.

Feasibility of sparse large Lotka-Volterra ecosystems.

Consider a large ecosystem (foodweb) with n species, where the abundances follow a Lotka-Volterra system of coupled differential equations. We assume that each species interacts with [Formula: see text] other species and that their interaction coefficients are independent random variables. This parameter d reflects the connectance of the foodweb and the sparsity of its interactions especially if d is much smaller that n. We address the question of feasibility of the foodweb, that is the existence of an equilibrium solution of the Lotka-Volterra system with no vanishing species. We establish that for a given range of d, namely [Formula: see text] or [Formula: see text] with an extra condition on the sparsity structure, there exists an explicit threshold depending on n and d and reflecting the strength of the interactions, which guarantees the existence of a positive equilibrium as the number of species n gets large. From a mathematical point of view, the study of feasibility is equivalent to the existence of a positive solution [Formula: see text] (component-wise) to the equilibrium linear equation: [Formula: see text]where [Formula: see text] is the [Formula: see text] vector with components 1 and [Formula: see text] is a large sparse random matrix, accounting for the interactions between species. The analysis of such positive solutions essentially relies on large random matrix theory for sparse matrices and Gaussian concentration of measure. The stability of the equilibrium is established. The results in this article extend to a sparse setting the results obtained by Bizeul and Najim in Bizeul and Najim (2021).

Persistence of Excitation for Identifying Switched Linear Systems.

This paper investigates the uniqueness of parameters via persistence of excitation for switched linear systems. The main contribution is a much weaker sufficient condition on the regressors to be persistently exciting that guarantees the uniqueness of the parameter sets and also provides new insights in understanding the relation among different subsystems. It is found that for uniquely determining the parameters of switched linear systems, the needed minimum number of samples derived from our sufficient condition is much smaller than that reported in the literature.

Quantum Linear System Algorithm for General Matrices in System Identification.

Solving linear systems of equations is one of the most common and basic problems in classical identification systems. Given a coefficient matrix A and a vector b, the ultimate task is to find the solution x such that Ax=b. Based on the technique of the singular value estimation, the paper proposes a modified quantum scheme to obtain the quantum state |x⟩ corresponding to the solution of the linear system of equations in O(κ2rpolylog(mn)/ϵ) time for a general m×n dimensional A, which is superior to existing quantum algorithms, where κ is the condition number, r is the rank of matrix A and ϵ is the precision parameter. Meanwhile, we also design a quantum circuit for the homogeneous linear equations and achieve an exponential improvement. The coefficient matrix A in our scheme is a sparsity-independent and non-square matrix, which can be applied in more general situations. Our research provides a universal quantum linear system solver and can enrich the research scope of quantum computation.

A Signal Processing Approach to Pharmacokinetic Data Analysis.

The connection between pharmacokinetic models and system theory has been established for a long time. In this approach, the drug concentration is seen as the output of a system whose input is the drug administered at different times. In this article we further explore this connection. We show that system theory can be used to easily accommodate any therapeutic regime, no matter its complexity, allowing the identification of the pharmacokinetic parameters by means of a non-linear regression analysis. We illustrate how to exploit the properties of linear systems to identify non-linearities in the pharmacokinetic data. We also explore the use of bootstrapping as a way to compare populations of pharmacokinetic parameters and how to handle the common situation of using multiple hypothesis tests as a way to distinguish two different populations. Finally, we demonstrate how the bootstrap values can be used to estimate the distribution of derived parameters, as can be the allometric scale factors.

Validating Linear Systems Analysis for Laminar fMRI: Temporal Additivity for Stimulus Duration Manipulations.

Advancements in ultra-high field (7 T and higher) magnetic resonance imaging (MRI) scanners have made it possible to investigate both the structure and function of the human brain at a sub-millimeter scale. As neuronal feedforward and feedback information arrives in different layers, sub-millimeter functional MRI has the potential to uncover information processing between cortical micro-circuits across cortical depth, i.e. laminar fMRI. For nearly all conventional fMRI analyses, the main assumption is that the relationship between local neuronal activity and the blood oxygenation level dependent (BOLD) signal adheres to the principles of linear systems theory. For laminar fMRI, however, directional blood pooling across cortical depth stemming from the anatomy of the cortical vasculature, potentially violates these linear system assumptions, thereby complicating analysis and interpretation. Here we assess whether the temporal additivity requirement of linear systems theory holds for laminar fMRI. We measured responses elicited by viewing stimuli presented for different durations and evaluated how well the responses to shorter durations predicted those elicited by longer durations. We find that BOLD response predictions are consistently good predictors for observed responses, across all cortical depths, and in all measured visual field maps (V1, V2, and V3). Our results suggest that the temporal additivity assumption for linear systems theory holds for laminar fMRI. We thus show that the temporal additivity assumption holds across cortical depth for sub-millimeter gradient-echo BOLD fMRI in early visual cortex.

Erasure decoding of convolutional codes using first-order representations.

It is well known that there is a correspondence between convolutional codes and discrete-time linear systems over finite fields. In this paper, we employ the linear systems representation of a convolutional code to develop a decoding algorithm for convolutional codes over the erasure channel. In this kind of channel, which is important due to its use for data transmission over the Internet, the receiver knows if a received symbol is correct. We study the decoding problem using the state space description of a convolutional code, and this provides in a natural way additional information. With respect to previously known decoding algorithms, our new algorithm has the advantage that it is able to reduce the decoding delay as well as the computational effort in the erasure recovery process. We describe which properties a convolutional code should have in order to obtain a good decoding performance and illustrate it with an example.

Boolean network analysis through the joint use of linear algebra and algebraic geometry.

Among the various phenomena that can be modeled by Boolean networks, i.e., discrete-time dynamical systems with binary state variables, gene regulatory interactions are especially well known. Therefore, the analysis of Boolean networks is critical, e.g., to identify genetic pathways and to predict the effects of mutations on the cell functionality. Two methodologies (i.e., the semi-tensor product and the Gröbner bases over finite fields) have recently been proposed to tackle the problem of determining cycles and attractors (with the corresponding basin of attraction) for such systems. Here, it is shown that, by suitably coupling methodologies taken from these two fields (i.e., linear algebra and algebraic geometry), it is not only possible to determine cycles and attractors, but also to find closed-form solutions of the Boolean network. Such a goal is pursued by finding an immersion that recasts the Boolean dynamics in a linear form and by computing the closed-form solution of the latter system. The effectiveness of this technique is demonstrated by fully computing the solutions of the Boolean network modeling the differentiation of the Th-lymphocyte, a type of white blood cells involved in the human adaptive immune system.

The General Solution of Singular Fractional-Order Linear Time-Invariant Continuous Systems with Regular Pencils.

This paper introduces a general solution of singular fractional-order linear-time invariant (FoLTI) continuous systems using the Adomian Decomposition Method (ADM) based on the Caputo's definition of the fractional-order derivative. The complexity of their entropy lies in defining the complete solution of such systems, which depends on introducing a method of decomposing their dynamic states from their static states. The solution is formulated by converting the singular system of regular pencils into a recursive form using the sequence of transformations, which separates the dynamic variables from the algebraic variables. The main idea of this work is demonstrated via numerical examples.