JP2003114132A - Method and apparatus for searching for driving route using quantum calculation, driving route search program and record medium recording the program - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a driving route-searching method and a driving route- searching apparatus using quantum calculation for searching for a route drastically in a short time by using the quantum calculation that is a parallel calculation method, to provide a driving route-searching program, and a record medium for recording the program. SOLUTION: A driving route in a mobile body is expressed in a bit train at an overlapped state creation section 1. The overlapped state in the drive route that is expressed by the bit train is created. An interference operation is made to the bit train for expressing the overlapped drive route by an interference operation section 3. The presence probability of an inappropriate drive route is reduced. The presence probability of an appropriate drive route is increased. The bit train having a high presence probability is read by a result- reading section 5 by the interference operation, thus obtaining an appropriate drive route.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a travel route search method and device, a travel route search program, and a program using a quantum calculation for searching a travel route of a moving body such as a vehicle in car navigation or delivery of luggage. The present invention relates to a recorded recording medium.

[0002]

2. Description of the Related Art For example, when searching for a shortest travel route from a start point to a goal point when searching for a travel route of a vehicle for car navigation, baggage delivery, etc. List all possible driving routes from the point to the goal point, calculate the required time for each of all the listed driving routes in turn, and compare the required time of all the calculated driving routes The travel route with the shortest required time is selected as the optimum route.

[0003]

In the above-mentioned conventional search for a traveling route, the required time is the shortest after the required time is sequentially calculated for each of all the traveling routes from the start point to the goal point. Since one is selected as the optimum route, there is a problem that it takes a very long time to obtain the optimum route, especially when there are many combinations of traveling routes from the start point to the goal point.

The present invention has been made in view of the above,
An object of the invention is to provide a travel route search method and device, a travel route search program, and a program using the quantum computation that can search a route in a dramatically short time by using a quantum computation which is a parallel computation method. It is to provide a recording medium in which is recorded.

[0005]

In order to achieve the above object, the present invention according to claim 1 is a travel route search method for searching a travel route of a mobile body, wherein the travel route of the mobile body is expressed by a bit string. Then, the overlapping state of the traveling routes represented by this bit string is created, and the existence probability of the inappropriate traveling route is reduced with respect to the bit sequence representing the overlapping traveling routes, and the appropriate traveling route The gist is to obtain an optimum travel route by performing an interference operation that increases the existence probability and reading a bit string having a high existence probability by this interference operation.

According to the first aspect of the present invention, the existence state of an inappropriate traveling route is created by creating an overlapping state of the traveling routes and performing an interference operation on the bit strings of the traveling routes thus overlapped. In order to reduce the probability, increase the existence probability of an appropriate travel route, and read the bit string with a high existence probability to obtain the optimum travel route, it is possible to perform route search significantly faster by parallel computation, which is a feature of quantum computation. it can.

The present invention according to claim 2 is a traveling route search device for searching a traveling route of a moving body, wherein the traveling route of the moving body is represented by a bit string, and the traveling route represented by the bit string is By performing an interference operation on the superposition state creating means for creating the superposition state and the bit string expressing the superposed travel route, the existence probability of an inappropriate travel route is reduced, and an appropriate travel route The gist is to have an interference calculation means for increasing the existence probability and a result reading means for obtaining an optimum traveling route by reading a bit string having a high existence probability by this interference operation.

According to the second aspect of the present invention, the existence of an unsuitable traveling route is created by creating an overlapping state of the traveling routes and performing an interference operation on the bit strings of the superimposed traveling routes. In order to reduce the probability, increase the existence probability of an appropriate travel route, and read the bit string with a high existence probability to obtain the optimum travel route, it is possible to perform route search significantly faster by parallel computation, which is a feature of quantum computation. it can.

Further, the present invention according to claim 3 is a traveling route search program for searching a traveling route of a moving body, wherein the traveling route of the moving body is represented by a bit string, and the traveling route represented by the bit string is Create a superposition state, perform an interference operation on the bit string expressing this superposed traveling route, reduce the existence probability of an inappropriate traveling route, increase the existence probability of an appropriate traveling route, in the travel route search program to obtain the optimal driving route by reading the high existence probability bit string in this interference operation, the step of encoding the unitary matrix operator U _F input function f, and the operator U _F quantum Gate G (G
Represents a unitary matrix), applying the quantum gate G to an initial vector to create a basis vector, measuring the basis vector, and applying and measuring the steps k times (k Satisfying 0 <k) and decoding the basis vector including decoding the basis vector into an output vector.

According to the third aspect of the present invention, the existence state of an inappropriate traveling route is created by creating an overlapping state of the traveling routes and performing an interference operation on the bit strings of the traveling routes overlapped with each other. The driving route search for decreasing the probability, increasing the existence probability of an appropriate traveling route, and reading a bit string having a high existence probability to obtain an optimal traveling route is performed by a coding step for the unitary matrix operator U _F , a quantum gate G Embedded step, basis vector creation step,
Since it can be configured by software including a repeating step and a step of converting to an output vector, an economical system can be constructed only by software without using special hardware.

According to a fourth aspect of the present invention, there is provided a recording medium in which a traveling route search program for searching a traveling route of a moving body is recorded, wherein the traveling route of the moving body is expressed by a bit string, and is expressed by this bit string. The overlapping state of the traveling routes is created, and the bit string expressing the superimposed traveling routes is subjected to an interference operation to reduce the existence probability of the inappropriate traveling route and determine the existence probability of the appropriate traveling route. And a step of encoding the input function f into a unitary matrix operator U _F , using a recording medium recording a travel route search program for increasing the number of bit strings having a high existence probability by this interference operation to obtain an optimum travel route. , A step of incorporating this operator U _F into a quantum gate G (G represents a unitary matrix), and applying the quantum gate G to an initial vector Tol, measuring the basis vector, repeating the steps of applying and measuring k times (k satisfies 0 <k), and decoding the basis vector into an output vector. The driving route search program having a step of decoding the basis vector including conversion is recorded in a recording medium.

According to the fourth aspect of the present invention, an overlapping state of the traveling routes is created, and an interference operation is performed with respect to the bit strings of the superimposed traveling routes so that an inappropriate traveling route exists. The driving route search for decreasing the probability, increasing the existence probability of an appropriate traveling route, and reading a bit string having a high existence probability to obtain an optimal traveling route is performed by a coding step for the unitary matrix operator U _F , a quantum gate G Embedded step, basis vector creation step,
Since the travel route search program including the repeating step and the step of converting to the output vector is recorded in the recording medium, the distribution property can be improved by using the recording medium.

The present invention according to claim 5 is a travel route search program for searching a travel route of a mobile body, wherein the travel route of the mobile body is represented by a bit string, and the travel route represented by the bit string is displayed. Create a superposition state, perform an interference operation on the bit string expressing this superposed traveling route, reduce the existence probability of an inappropriate traveling route, increase the existence probability of an appropriate traveling route, The gist is to obtain an optimum travel route by reading a bit string having a high existence probability by this interference operation.

According to the fifth aspect of the present invention, the existence of an inappropriate traveling route is created by creating an overlapping state of the traveling routes and performing an interference operation on the bit strings of the overlapping traveling routes. In order to reduce the probability, increase the existence probability of an appropriate travel route, and read the bit string with a high existence probability to obtain the optimum travel route, it is possible to perform route search significantly faster by parallel computation, which is a feature of quantum computation. it can.

Further, the present invention according to claim 6 is a recording medium recording a travel route search program for searching a travel route of a mobile body, wherein the travel route of the mobile body is expressed by a bit string, and expressed by this bit string. The overlapping state of the traveling routes is created, and the bit string expressing the overlapping traveling routes is subjected to the interference operation to reduce the existence probability of the improper traveling route, and the existence of the appropriate traveling route. The gist is to record a travel route search program using quantum computation that increases the probability and reads the bit string having a high existence probability by this interference operation to obtain an optimal travel route on a recording medium.

According to the sixth aspect of the present invention, an overlapping state of the traveling routes is created, and an interference operation is performed on the bit strings of the traveling routes thus overlapped, so that an inappropriate traveling route exists. Since the probability of decreasing the probability of existence of an appropriate travel route, increasing the existence probability of an appropriate travel route, and reading a bit string having a high existence probability to obtain an optimum travel route is recorded in the recording medium, the recording medium is used. ,
Its distribution can be improved.

[0017]

BEST MODE FOR CARRYING OUT THE INVENTION Embodiments of the present invention will be described below with reference to the drawings. FIG. 1 is a block diagram showing the configuration of a travel route search device that implements a travel route search method using quantum computation according to an embodiment of the present invention.

The traveling route searching apparatus of the embodiment shown in FIG. 1 expresses a traveling route of a moving body by a bit string, and an overlay state creating section 1 for creating an overlay state of the traveling routes represented by this bit string, An interference operation unit 3 that reduces the existence probability of an inappropriate travel route and increases the existence probability of an appropriate travel route by performing an interference operation on the bit strings representing the overlapped travel routes, and this interference. The result reading unit 5 obtains an optimal traveling route by reading the optimal traveling route from the data of the traveling routes that are overlapped, which is a bit string that has been operated.

A detailed description will be given with reference to FIG. 2 and subsequent figures.
FIG. 2 is a diagram showing a search route from the start point to the goal point. In the figure, the numbers 0, 1, 2, ... 2
Reference numerals 7 and 28 represent road numbers, and the travel route search device of the present embodiment searches for the optimum travel route from the start point to the goal point through the 29 roads indicated by the road numbers 0 to 28 in the shortest distance. Is what you are trying to do.

The traveling route search device of this embodiment searches for an optimal traveling route by using quantum computation, which is a parallel calculation method. First, the overlapping state creating unit 1 determines the overlapping states of all routes. create. in this case,
If the geometric constraint is not taken into consideration, there are 32 ²⁹ possible routes as shown in FIG. In addition,
In FIG. 3, among the numbers arranged in the lateral direction, the number shown at the left end shows the road number that passes first, and the number shown at the right end shows the road number that passes last. Most of the 32 ²⁹ routes shown in FIG. 3 are meaningless routes that are not possible in reality, but it is a fast and optimal route that does not need to be determined by using quantum computation. Since you can search for, set it like this.

The total number of traveling routes shown in FIG. 2 is 29.
Each sub-route consists of 5qbi
Since it can be expressed by t (qubit), all routes can be expressed by 5 × 29 = 145 qbits as shown in FIG.

Next, as shown in FIG. 5, a discrete Fourier transform (DFT) is performed on the bit string of 145 qbits shown in FIG. 4 in order from the left end.
ation), an initial superposition state is created in which the existence probabilities of all routes are equal,
As shown in FIG. 6, the existence probability of each route in the initial state is 1/32 ²⁹ .

As shown in FIG. 7, the interference calculation unit 3 performs an appropriate unitary transformation on the superposition state created as described above, so that a geometrically meaningless route or an inappropriate route is generated. The existence probability of the bit string corresponding to the root is lowered, and the existence probability of the bit string expressing an appropriate root is increased, whereby the existence probabilities of the respective roots become different as shown in FIG.

By performing the interference operation in the interference calculation unit 3 in this way, the existence probability of the bit string expressing an appropriate route is increased. Therefore, by reading this bit string in the result reading unit 5, the optimum You can get a good route.

Next, a method described in Japanese Patent Application No. 2000-226266, for example, is a method for realizing the above-described traveling route search method using quantum computation only by software without using special hardware for quantum computation. Can be used.

In this method, a step of encoding the input function f into a unitary matrix operator U _F , a step of incorporating this operator U _F into a quantum gate G (G represents a unitary matrix), and the quantum gate G To an initial vector to create a basis vector, and measuring the basis vector to apply and measure k
Repeating (k satisfies 0 <k) times,
Decoding the basis vector to the output vector, the decoding comprising converting the basis vector into an output vector.

By constructing the system only with software without using special hardware as described above, it is possible to achieve economic efficiency. In addition, such software is recorded in an arbitrary recording medium such as a CD, FD, or MD, and the recording medium is incorporated into a computer system, or a program recorded in the recording medium is stored in a computer system via a communication line. It is needless to say that it can be made to function as a travel route search device for carrying out the travel route search method by downloading to or installed from a storage medium and operating the computer system with the program. By using, it is possible to improve the distribution.

[0028]

As described above, according to the present invention,
By creating the overlapping state of the traveling routes and performing the interference operation on the bit string of the superimposed traveling routes, the existence probability of the inappropriate traveling route is reduced and the existence probability of the appropriate traveling route is increased. Since a bit string having a high existence probability is read to obtain an optimum traveling route, it is possible to perform route search remarkably fast by parallel computation, which is a feature of quantum computation.

Further, according to the present invention, the overlapping states of the traveling routes are created, and the bit string of the superimposed traveling routes is subjected to the interference operation to reduce the existence probability of the inappropriate traveling route. , The travel route search using quantum calculation that increases the existence probability of an appropriate travel route and reads the bit string with a high existence probability to obtain the optimum travel route is configured by software, so without using special hardware , It is possible to build an economical system only with software.

[Brief description of drawings]

FIG. 1 is a block diagram showing a configuration of a travel route search device that implements a travel route search method using quantum computation according to an embodiment of the present invention.

FIG. 2 is a diagram showing a search route from a start point to a goal point, which is applied to the traveling route search device of the embodiment shown in FIG.

FIG. 3 is a diagram showing possible travel routes for the search route shown in FIG. 2;

FIG. 4 shows 5qb each of 29 sub-routes shown in FIG.
It is a figure expressed by it.

5 is a diagram in which a discrete Fourier transform is applied to the 145 qbits shown in FIG. 4 to create an initial superposition state.

6 is a diagram showing the existence probability of each route in the initial state shown in FIG.

FIG. 7 is a diagram showing an interference operation performed on the overlapping state created as shown in FIG.

8 is a diagram showing the existence probability of each route after the interference operation shown in FIG.

[Explanation of symbols]

1 Overlay state creation section 3 Interference calculator 5 Result reading section

Claims (6)

[Claims] 1. A traveling route search method for searching a traveling route of a mobile body, wherein the traveling route of the mobile body is represented by a bit string, and a superposition state of the traveling routes represented by the bit sequence is created, Interference operation is performed to reduce the existence probability of inappropriate travel routes and increase the existence probability of appropriate travel routes for the bit strings that represent the combined travel routes. A travel route search method using quantum computation, which is characterized by obtaining an optimum travel route by reading. 2. A traveling route search device for searching a traveling route of a moving body, wherein the traveling route of the moving body is expressed by a bit string, and an overlapping state of creating the overlapping state of the traveling routes expressed by the bit string is created. Creating means, and interference calculating means for performing an interference operation on the bit strings representing the superimposed traveling routes to reduce the existence probability of inappropriate traveling routes and increase the existence probability of appropriate traveling routes. A traveling route search device using quantum computation, comprising: a result reading unit that obtains an optimal traveling route by reading a bit string having a high existence probability by the interference operation. 3. A traveling route for searching a traveling route of a mobile body.
A search program, The travel route of the moving body is expressed by a bit string, and this bit string
Create the overlapping state of the driving route expressed by
To the bit string that represents the superimposed driving routes of
Probability of existence of inappropriate travel route
Decrease the probability of the existence of a suitable driving route,
By reading a bit string with a high existence probability in the interference operation,
Use a driving route search program to obtain an appropriate driving route.
hand, Input function f is unitary matrix operator U_F To encode
And this operator U _F Quantum gate G (G is unitary
Representing a matrix) and said quantum gate G
Is applied to the initial vector to create the basis vector.
And measure the basis vectors to apply and measure
The above-mentioned step of performing the setting is performed k times (k satisfies 0 <k)
, And decoding the basis vectors
Converting the basis vector, including converting to an output vector
And a decoding step.
Search program. 4. A traveling route for searching a traveling route of a mobile body.
A recording medium recording a search program, The travel route of the moving body is expressed by a bit string, and this bit string
Create the overlapping state of the driving route expressed by
To the bit string that represents the superimposed driving routes of
Probability of existence of inappropriate travel route
Decrease the probability of the existence of a suitable driving route,
By reading a bit string with a high existence probability in the interference operation,
Record a driving route search program to obtain an appropriate driving route
As a recording medium Input function f is unitary matrix operator U_F To encode
And this operator U _F Quantum gate G (G is unitary
Representing a matrix) and said quantum gate G
Is applied to the initial vector to create the basis vector.
And measure the basis vectors to apply and measure
The above-mentioned step of performing the setting is performed k times (k satisfies 0 <k)
, And decoding the basis vectors
Converting the basis vector, including converting to an output vector
And a decoding step.
A recording medium that records a search program. 5. A travel route search program for searching a travel route of a mobile body, wherein the travel route of the mobile body is expressed by a bit string, and a superposition state of the travel routes expressed by the bit string is created. Interference operation is performed on the bit string representing the combined travel route to reduce the existence probability of an inappropriate travel route and increase the existence probability of an appropriate travel route. A travel route search program using quantum computation, which is characterized by obtaining an optimum travel route by reading 6. A recording medium for recording a travel route search program for searching a travel route of a mobile body, wherein the travel route of the mobile body is represented by a bit string, and the overlapping state of the travel routes represented by the bit string is displayed. Create and perform an interference operation on the bit strings that represent the superimposed travel routes to reduce the existence probability of inappropriate travel routes and increase the existence probability of appropriate travel routes. A recording medium recording a traveling route search program using quantum computation, which is characterized in that an optimal traveling route is obtained by reading a bit string having a high existence probability.