| Presentation | 2001/7/17 Analysis of Petri Nets by Quantum Computation Kunihiko Hiraishi, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | The aim of this research is to utilize quantum algorithms for model checking of concurrent systems represented by Petri nets. We propose a quantum algorithm for checking reachability in a given Petri net with capacity. The algorithm first computes a set of markings that contains all markings reachable within κ steps as a superposition of them in a Hilbert space. Then the quantum search algorithm is applied to check of a given goal marking is in the superposition or not. The algorithm requires only a number of quantum bits proportional to the size of the net and the number of steps κ. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Petri nets / quantum computation / model checking |
| Paper # | CST2001-11 |
| Date of Issue |
| Conference Information | |
| Committee | CST |
|---|---|
| Conference Date | 2001/7/17(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Concurrent System Technology (CST) |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Analysis of Petri Nets by Quantum Computation |
| Sub Title (in English) | |
| Keyword(1) | Petri nets |
| Keyword(2) | quantum computation |
| Keyword(3) | model checking |
| 1st Author's Name | Kunihiko Hiraishi |
| 1st Author's Affiliation | School of Information Science, Japan Advanced Institute of Science and Technology() |
| Date | 2001/7/17 |
| Paper # | CST2001-11 |
| Volume (vol) | vol.101 |
| Number (no) | 212 |
| Page | pp.pp.- |
| #Pages | 8 |
| Date of Issue | |