Fast Simulation of Magnetic Field Gradients for Optimization of Pulse Sequences

• URL: http://arxiv.org/abs/2006.10133v1
• Date: Wed, 17 Jun 2020 20:02:39 GMT
• Title: Fast Simulation of Magnetic Field Gradients for Optimization of Pulse Sequences
• Authors: John P. S. Peterson, Hemant Katiyar and Raymond Laflamme
• Abstract summary: We study how to simulate, efficiently, pulse field gradients (PFG) used in nuclear magnetic resonance (NMR) We show that the fast simulation of PFG allow us to optimize sequences composed of PFG, radio-frequency pulses and free evolution, to implement non-unitary evolution (quantum channels) In the second experiment, we used the fast simulation of PFG to optimize and implement a sequence to prepare pseudo pure state with better signal to noise ratio than any known procedure till now.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study how to simulate, efficiently, pulse field gradients (PFG) used in nuclear magnetic resonance (NMR). An efficient simulation requires discretization in time and space. We study both discretizations and provide a guideline to choose best discretization values depending on the precision required experimentally. We provide a theoretical study and simulation showing the minimum number of divisions we need in space for simulating, with high precision, a sequence composed of several unitary evolution and PFG. We show that the fast simulation of PFG allow us to optimize sequences composed of PFG, radio-frequency pulses and free evolution, to implement non-unitary evolution (quantum channels). As an evidence of the success of our work, we performed two types of experiments. First, we implement two quantum channels and compare the results with their theoretical predictions. In the second experiment, we used the fast simulation of PFG to optimize and implement a sequence to prepare pseudo pure state with better signal to noise ratio than any known procedure till now.

Related papers

• Accelerate Neural Subspace-Based Reduced-Order Solver of Deformable Simulation by Lipschitz Optimization [9.364019847856714]
  Reduced-order simulation is an emerging method for accelerating physical simulations with high DOFs. We propose a method for finding optimized subspace mappings, enabling further acceleration of neural reduced-order simulations. We demonstrate the effectiveness of our approach through general cases in both quasi-static and dynamics simulations.
  arXiv  Detail & Related papers  (2024-09-05T12:56:03Z)
• A Multi-Grained Symmetric Differential Equation Model for Learning Protein-Ligand Binding Dynamics [74.93549765488103]
  In drug discovery, molecular dynamics simulation provides a powerful tool for predicting binding affinities, estimating transport properties, and exploring pocket sites. We propose NeuralMD, the first machine learning surrogate that can facilitate numerical MD and provide accurate simulations in protein-ligand binding. We show the efficiency and effectiveness of NeuralMD, with a 2000$times$ speedup over standard numerical MD simulation and outperforming all other ML approaches by up to 80% under the stability metric.
  arXiv  Detail & Related papers  (2024-01-26T09:35:17Z)
• Bayesian Optimization for Robust State Preparation in Quantum Many-Body Systems [0.0]
  We apply Bayesian optimization to a state-preparation protocol recently implemented in an ultracold-atom system. Compared to manual ramp design, we demonstrate the superior performance of our optimization approach in a numerical simulation. The proposed protocol and workflow will pave the way toward the realization of more complex many-body quantum states in experiments.
  arXiv  Detail & Related papers  (2023-12-14T18:59:55Z)
• Improved real-space parallelizable matrix-product state compression and its application to unitary quantum dynamics simulation [0.0]
  We introduce an improved real-space parallelizable matrix-product state (MPS) compression method. We apply this method to simulate unitary quantum dynamics and introduce an improved parallel time-evolving block-decimation algorithm. The obtained numerical results unequivocally demonstrate that the improved pTEBD algorithm achieves the same level of simulation precision as the current state-of-the-art MPS algorithm.
  arXiv  Detail & Related papers  (2023-12-05T11:14:48Z)
• D4FT: A Deep Learning Approach to Kohn-Sham Density Functional Theory [79.50644650795012]
  We propose a deep learning approach to solve Kohn-Sham Density Functional Theory (KS-DFT) We prove that such an approach has the same expressivity as the SCF method, yet reduces the computational complexity. In addition, we show that our approach enables us to explore more complex neural-based wave functions.
  arXiv  Detail & Related papers  (2023-03-01T10:38:10Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Quantum emulation of the transient dynamics in the multistate Landau-Zener model [50.591267188664666]
  We study the transient dynamics in the multistate Landau-Zener model as a function of the Landau-Zener velocity. Our experiments pave the way for more complex simulations with qubits coupled to an engineered bosonic mode spectrum.
  arXiv  Detail & Related papers  (2022-11-26T15:04:11Z)
• Hybrid Physical-Neural ODEs for Fast N-body Simulations [0.22419496088582863]
  We present a new scheme to compensate for the small-scales approximations resulting from Particle-Mesh schemes for cosmological N-body simulations. We find that our approach outperforms PGD for the cross-correlation coefficients, and is more robust to changes in simulation settings.
  arXiv  Detail & Related papers  (2022-07-12T13:06:06Z)
• Quantum Simulation of Z2 Lattice Gauge theory with minimal resources [0.7734726150561088]
  We investigate various options for simulating the fermionic Z2 gauge field theory in (2+1) D. To simulate the theory on a NISQ device it is vital to minimize both the number of qubits used and the circuit depth. We develop a new way to simulate this theory on a quantum computer, with minimal qubit requirements.
  arXiv  Detail & Related papers  (2022-06-17T17:35:29Z)
• Fast and differentiable simulation of driven quantum systems [58.720142291102135]
  We introduce a semi-analytic method based on the Dyson expansion that allows us to time-evolve driven quantum systems much faster than standard numerical methods. We show results of the optimization of a two-qubit gate using transmon qubits in the circuit QED architecture.
  arXiv  Detail & Related papers  (2020-12-16T21:43:38Z)
• Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
  Random quantum circuits are commonly viewed as hard to simulate classically. We show that approximate simulation of typical instances is almost as hard as exact simulation. We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
  arXiv  Detail & Related papers  (2019-12-31T19:00:00Z)

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.