×
Well done. You've clicked the tower. This would actually achieve something if you had logged in first. Use the key for that. The name takes you home. This is where all the applicables sit. And you can't apply any changes to my site unless you are logged in.

Our policy is best summarized as "we don't care about _you_, we care about _them_", no emails, so no forgetting your password. You have no rights. It's like you don't even exist. If you publish material, I reserve the right to remove it, or use it myself.

Don't impersonate. Don't name someone involuntarily. You can lose everything if you cross the line, and no, I won't cancel your automatic payments first, so you'll have to do it the hard way. See how serious this sounds? That's how serious you're meant to take these.

×
Register


Required. 150 characters or fewer. Letters, digits and @/./+/-/_ only.
  • Your password can’t be too similar to your other personal information.
  • Your password must contain at least 8 characters.
  • Your password can’t be a commonly used password.
  • Your password can’t be entirely numeric.
Enter the same password as before, for verification.
Login

Grow A Dic
Define A Word
Make Space
Set Task
Mark Post
Apply Votestyle
Create Votes
(From: saved spaces)
Exclude Votes
Apply Dic
Exclude Dic

Fully quantum algorithm for lattice Boltzmann methods with application to partial differential equations. (arXiv:2305.07148v1 [physics.comp-ph])

Click here to flash read.

Fluid flow simulations marshal our most powerful computational resources. In
many cases, even this is not enough. Quantum computers provide an opportunity
to speedup traditional algorithms for flow simulations. We show that
lattice-based mesoscale numerical methods can be executed as efficient quantum
algorithms due to their statistical features. This approach revises a quantum
algorithm for lattice gas automata to eliminate classical computations and
measurements at every time step. For this, the algorithm approximates the qubit
relative phases and subtracts them at the end of each time step, removing a
need for repeated measurements and state preparation (encoding). Phases are
evaluated using the iterative phase estimation algorithm and subtracted using
single-qubit rotation phase gates. This method delays the need for measurement
to the end of the computation, so the algorithm is better suited for modern
quantum hardware. We also demonstrate how the checker-board deficiency that the
D1Q2 scheme presents can be resolved using the D1Q3 scheme. The algorithm is
validated by simulating two canonical PDEs: the diffusion and Burgers'
equations on different quantum simulators. We find good agreement between
quantum simulations and classical solutions of the presented algorithm.

Click here to read this post out
ID: 128379; Unique Viewers: 0
Unique Voters: 0
Total Votes: 0
Votes:
Latest Change: May 15, 2023, 7:32 a.m. Changes:
/u/anonymous
Dictionaries:
Words:
Spaces:
Views: 8
CC:
No creative common's license
Comments: