Skip to content

Is it possible to reduce path finding time? #64

Answered by yangcal
NathanCQC asked this question in Q&A
Discussion options

You must be logged in to vote

Hello @NathanCQC @yapolyak ,

We've pinned down a couple of factors and hopefully that can resolve all the questions above:

  1. Regarding the large performance difference in path-finding, turns out the cuquantum-python that we're testing with is our soon to-be-released 23.06 version (apologies here). We've added a few optimizations in our path-finder and that should be where the big difference is using my snippet. I tried the snippet again with 2303 and it was also stuck in the path-finding stage for at least tens of minutes.
  2. For large tensor network like you have with n=7, you're encouraged to turn on hyper sampling via OptimizerOptions.samples(default is off). You can also adjust the number…

Replies: 3 comments 44 replies

Comment options

You must be logged in to vote
22 replies
@NathanCQC
Comment options

@NathanCQC
Comment options

@leofang
Comment options

@NathanCQC
Comment options

@NathanCQC
Comment options

Comment options

You must be logged in to vote
14 replies
@yapolyak
Comment options

@yapolyak
Comment options

@yapolyak
Comment options

@yapolyak
Comment options

@leofang
Comment options

Comment options

You must be logged in to vote
8 replies
@leofang
Comment options

@NathanCQC
Comment options

@yapolyak
Comment options

@NathanCQC
Comment options

@yangcal
Comment options

Answer selected by leofang
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Category
Q&A
Labels
None yet
5 participants