×
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

Improved real-space parallelizable matrix-product state compression and its application to unitary quantum dynamics simulation. (arXiv:2312.02667v1 [quant-ph])

Click here to flash read.

Towards the efficient simulation of near-term quantum devices using tensor
network states, we introduce an improved real-space parallelizable
matrix-product state (MPS) compression method. This method enables efficient
compression of all virtual bonds in constant time, irrespective of the system
size, with controlled accuracy, while it maintains the stability of the
wavefunction norm without necessitating sequential renormalization procedures.
In addition, we introduce a parallel regauging technique to partially restore
the deviated canonical form, thereby improving the accuracy of the simulation
in subsequent steps. We further apply this method to simulate unitary quantum
dynamics and introduce a parallel time-evolving block-decimation (pTEBD)
algorithm. We employ the pTEBD algorithm for extensive simulations of typical
one- and two-dimensional quantum circuits, involving over 1000 qubits. The
obtained numerical results unequivocally demonstrate that the pTEBD algorithm
achieves the same level of simulation precision as the current state-of-the-art
MPS algorithm but in polynomially shorter time, exhibiting nearly perfect weak
scaling performance on a modern supercomputer.

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