Dissipative Quantum Computation for computing Fixed-Points of Reachability Problems
Summarize this article with:
Hello people of Reddit. Today i was contacted by a professor at my institute, because i submitted a project idea that i wanted to work on. It is no more than a proposal, but my idea has the following title: - Using Dissipative Quantum Computing to compute Fixed-Points of Timed-Automata or Dependency Graphs for the Reachability problem. He basically said i was cooked and good luck with the project. The idea is to configure some Hamiltonian that should encode the transitions of my model and then it should converge towards some ground state that represents the fixed-point set and include all reachable states from the initial state. Do you think i am cooked or do you think there is potential to my approach? submitted by /u/Fancy-Lengthiness515 [link] [comments]