×
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

User: h-k-biernat

Noisy Tree Data Structures and Quantum Applications. (arXiv:2210.11197v2 [quant-ph] UPDATED)

Click here to flash read.

The paper presents a technique for constructing noisy data structures called
a walking tree. We apply it for a Red-Black tree (an implementation of a
Self-Balanced Binary Search Tree) and a segment tree. We obtain the same
complexity of the main operations for these data structures as in the case
without noise (asymptotically). We present several applications of the data
structures for quantum algorithms.


Finally, we suggest new quantum solution for strings sorting problem and show
the lower bound. The upper and lower bounds are the same up to a log factor. At
the same time, it is more effective than classical counterparts.

Click here to read this post out
ID: 129831; Unique Viewers: 0
Voters: 0
Latest Change: May 16, 2023, 7:31 a.m. Changes:
Dictionaries:
Words:
Spaces:
Comments:
Newcom
<0:100>