Magnetic Resonance Simulation of Effective Transverse Relaxation (T2*)

• URL: http://arxiv.org/abs/2601.19246v1
• Date: Tue, 27 Jan 2026 06:28:52 GMT
• Title: Magnetic Resonance Simulation of Effective Transverse Relaxation (T2*)
• Authors: Hidenori Takeshima,
• Abstract summary: To simulate effective transverse relaxation ($T*$) as a part of MR simulation.<n>$Tprime$ is not easily simulated if only magnetizations of individual isochromats are simulated.<n>To approximate the Lorentzian function of $Tprime$ realistically, conventional simulators require 100+ isochromats.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Purpose: To simulate effective transverse relaxation ($T_2^*$) as a part of MR simulation. $T_2^*$ consists of reversible ($T_2^{\prime}$) and irreversible ($T_2$) components. Whereas simulations of $T_2$ are easy, $T_2^{\prime}$ is not easily simulated if only magnetizations of individual isochromats are simulated. Theory and Methods: Efficient methods for simulating $T_2^{\prime}$ were proposed. To approximate the Lorentzian function of $T_2^{\prime}$ realistically, conventional simulators require 100+ isochromats. This approximation can be avoided by utilizing a linear phase model for simulating an entire Lorentzian function directly. To represent the linear phase model, the partial derivatives of the magnetizations with respect to the frequency axis were also simulated. To accelerate the simulations with these partial derivatives, the proposed methods introduced two techniques: analytic solutions, and combined transitions. For understanding the fundamental mechanism of the proposed method, a simple one-isochromat simulation was performed. For evaluating realistic cases, several pulse sequences were simulated using two phantoms with and without $T_2^{\prime}$ simulations. Results: The one-isochromat simulation demonstrated that $T_2^{\prime}$ simulations were possible. In the realistic cases, $T_2^{\prime}$ was recovered as expected without using 100+ isochromats for each point. The computational times with $T_2^{\prime}$ simulations were only 2.0 to 2.7 times longer than those without $T_2^{\prime}$ simulations. When the above-mentioned two techniques were utilized, the analytic solutions accelerated 19 times, and the combined transitions accelerated up to 17 times. Conclusion: Both theory and results showed that the proposed methods simulated $T_2^{\prime}$ efficiently by utilizing a linear model with a Lorentzian function, analytic solutions, and combined transitions.

Related papers

• Polynomial Mixing Times of Simulated Tempering for Mixture Targets by Conductance Decomposition [4.008356608627647]
  We study the theoretical complexity of simulated tempering for sampling from mixtures of log-concave components differing only by location shifts.<n>The main result establishes the first-time guarantee for simulated tempering combined with the Metropolis- Langevin algorithm (MALA)<n>The proof builds on a general state decomposition theorem for $s$-conductance, applied to an auxiliary Markov chain constructed on an augmented space.
  arXiv  Detail & Related papers  (2025-11-01T21:16:35Z)
• FFT-Accelerated Auxiliary Variable MCMC for Fermionic Lattice Models: A Determinant-Free Approach with $O(N\log N)$ Complexity [52.3171766248012]
  We introduce a Markov Chain Monte Carlo (MCMC) algorithm that dramatically accelerates the simulation of quantum many-body systems.<n>We validate our algorithm on benchmark quantum physics problems, accurately reproducing known theoretical results.<n>Our work provides a powerful tool for large-scale probabilistic inference and opens avenues for physics-inspired generative models.
  arXiv  Detail & Related papers  (2025-10-13T07:57:21Z)
• Accelerated characterization of two-level systems in superconducting qubits via machine learning [74.02542457579791]
  We introduce a data-driven approach for extracting two-level system (TLS) parameters-frequency $omega_TLS$, coupling strength $g$, dissipation time $T_TLS, 1$, and the pure dephasing time $Tphi_TLS, 2$.<n>A custom convolutional neural network model(CNN) can simultaneously predict $omega_TLS$, $g$, $T_TLS, 1$ and $Tphi_TLS, 2$ from the spectroscopy data presented in the form of
  arXiv  Detail & Related papers  (2025-09-22T12:55:52Z)
• Quantum simulation of a noisy classical nonlinear dynamics [2.0065923589074735]
  We present an end-to-end quantum algorithm for simulating nonlinear dynamics described by a system of dissipative differential equations with a quadratic nonlinearity.<n>Our algorithm can approximate the expected value of any correlation function that depends on $O(1)$ variables with rigorous approximation error.<n>To the best of our knowledge, this is the first rigorous quantum algorithm capable of simulating strongly nonlinear systems with $Jgg lambda$ at the cost poly-logarithmic in $N$ and in $t$.
  arXiv  Detail & Related papers  (2025-07-08T17:25:40Z)
• Parallel Simulation for Log-concave Sampling and Score-based Diffusion Models [55.07411490538404]
  We propose a novel parallel sampling method that improves adaptive complexity dependence on dimension $d$.<n>Our approach builds on parallel simulation techniques from scientific computing.
  arXiv  Detail & Related papers  (2024-12-10T11:50:46Z)
• Fast and scalable Wasserstein-1 neural optimal transport solver for single-cell perturbation prediction [55.89763969583124]
  Optimal transport (OT) theory provides a principled framework for constructing such mappings.<n>We propose a novel solver based on Wasserstein-1 ($W$) dual formulation.<n>Our experiments demonstrate that the proposed $W$ neural optimal transport solver can mimic the $W$ OT in finding a unique and mon" map.
  arXiv  Detail & Related papers  (2024-11-01T14:23:19Z)
• Quantum simulation of real-space dynamics [7.143485463760098]
  We conduct a systematic study of quantum algorithms for real-space dynamics. We give applications to several computational problems, including faster real-space simulation of quantum chemistry.
  arXiv  Detail & Related papers  (2022-03-31T13:01:51Z)
• Fast Stabiliser Simulation with Quadratic Form Expansions [0.8122270502556371]
  This is a representation of a quantum state which specifies a formula for the expansion in the standard basis. We show how, with deft management of the quadratic form expansion representation, we may simulate individual stabiliser operations in $O(n2)$ time.
  arXiv  Detail & Related papers  (2021-09-17T16:17:21Z)
• Hybridized Methods for Quantum Simulation in the Interaction Picture [69.02115180674885]
  We provide a framework that allows different simulation methods to be hybridized and thereby improve performance for interaction picture simulations. Physical applications of these hybridized methods yield a gate complexity scaling as $log2 Lambda$ in the electric cutoff. For the general problem of Hamiltonian simulation subject to dynamical constraints, these methods yield a query complexity independent of the penalty parameter $lambda$ used to impose an energy cost.
  arXiv  Detail & Related papers  (2021-09-07T20:01:22Z)
• A Random Matrix Analysis of Random Fourier Features: Beyond the Gaussian Kernel, a Precise Phase Transition, and the Corresponding Double Descent [85.77233010209368]
  This article characterizes the exacts of random Fourier feature (RFF) regression, in the realistic setting where the number of data samples $n$ is all large and comparable. This analysis also provides accurate estimates of training and test regression errors for large $n,p,N$.
  arXiv  Detail & Related papers  (2020-06-09T02:05:40Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.