Patent Forecast

1. A method for the development of a compilation process for a quantum circuit on a quantum processor, comprising: (1) (15)

a selection step:

of a quantum circuit,

of a quantum processor whereupon to compile the quantum circuit,

of a set of executable quantum gates on the selected quantum processor, based on the selected quantum processor,

of an optimization metric,

of a heuristic or meta-heuristic,

an implementation of the compilation method comprising first:

a step of division of the selected quantum circuit into quantum sub-circuits,

a first step of re-writing of the quantum sub-circuits comprising quantum gates non-executable by the selected quantum processor so that they comprise only quantum gates executable by the selected quantum processor,

a second step of re-writing the quantum sub-circuits according to the selected heuristic or meta-heuristic, in order to obtain quantum sub-circuits comprising quantum gates executable by the selected quantum processor, improving the selected metric,

a step of regrouping the quantum sub-circuits into a quantum circuit compilable by the selected quantum processor,

an implementation step of the compilation method successively comprising:

a quantum gate acting only on the neighboring physical qubits being an effective quantum gate,

a quantum gate acting on at least two non-neighboring physical qubits being an ineffective quantum gate,

a step of determining an implementation of logical qubits on the physical qubits of the selected quantum processor, by the application of the selected heuristic or meta-heuristic, which reduces the number of ineffective quantum gates and which reduces the number of quantum value swap gates between two physical qubits to be inserted into the quantum circuit so that all the quantum gates of the quantum circuit are, that is remain or become effective quantum gates.

2. A method for the development of a compilation process for a quantum circuit on a quantum processor according to claim 1, wherein the determination step comprises: (1) (7)

an iteration loop successively comprising:

a step of simulation of a given implementation of the logical qubits on the physic al qubits of the quantum processor,

a step of detecting, in the quantum circuit, the ineffective quantum gate(s),

a step of estimating the number of quantum value swap gates between two physical qubits to be inserted into the quantum circuit so that all of the quantum gates of the quantum circuit are, that is remain or become, effective quantum gates,

a retroaction step, by means of the selected heuristic or meta-heuristic, involving a new step of simulation based on the number of quantum value swap gates between two estimated physical qubits, until attaining, whereupon the quantum gates are effective:

either a minimum threshold of the number of estimated quantum value swap gates between two physical qubits,

or a maximum threshold of iterations in the loop.

3. Method for development of a compilation process for a quantum circuit on a quantum processor according to claim 2 wherein: (0) (1)

4. A method for the compilation of a quantum circuit on a quantum processor, by the use of a set of quantum gates executable on the quantum processor, comprising: (1) (9)

first:

a step of division of the selected quantum circuit into quantum sub-circuits,

a first step of re-writing of the quantum sub-circuits comprising quantum gates non-executable by the selected quantum processor so that they comprise only quantum gates executable by the selected quantum processor,

a second step of re-writing of the quantum sub-circuits according to the selected heuristic or meta-heuristic, in order to obtain quantum sub-circuits comprising quantum gates executable by the selected quantum processor, improving the selected metric,

a step of regrouping the quantum sub-circuits into a quantum circuit compiled by the selected quantum processor,

subsequently:

a quantum gate acting only on the neighboring physical qubits being an effective quantum gate,

a quantum gate acting on at least two non-neighboring physical qubits being an ineffective quantum gate,

a step of determining an implementation of the logical qubits on the physical qubits of the selected quantum processor, by the application of the selected heuristic or meta-heuristic, which reduces the number of ineffective quantum gates and which reduces the number of quantum value swap gates between two physical qubits to be inserted into the quantum circuit so that all the quantum gates of the quantum circuit are, that is remain or become effective quantum gates.

5. A method for the compilation of a quantum circuit, on a quantum processor, by the use of a set of quantum gates executable on the quantum processor according to claim 4, wherein the determination step comprises: (1) (7)

an iteration loop successively comprising:

a step of simulation of a given implementation of the logical qubits on the physic al qubits of the quantum processor,

a step of detecting, in the quantum circuit, the ineffective quantum gate(s),

a step of estimating the number of quantum value swap gates between two physical qubits to be inserted into the quantum circuit so that all of the quantum gates of the quantum circuit are, that is remain or become, effective quantum gates,

a retroaction step, by means of the selected heuristic or meta-heuristic, involving a new step of simulation based on the number of quantum value swap gates between two estimated physical qubits, until attaining, whereupon all of the quantum gates are effective:

either a minimum threshold of the number of estimated quantum value swap gates between two physical qubits,

or a maximum threshold of iterations in the loop.

6. A method for the compilation of a quantum circuit on a quantum processor, by the use of a set of quantum gates executable on the quantum processor according to claim 5, wherein: (0) (1)

7. A method for the development of a compilation process for a quantum circuit on a quantum processor, comprising: (0) (19)

a selection step:

of a quantum circuit,

of a quantum processor whereupon to compile the quantum circuit,

of a set of executable quantum gates on the selected quantum processor, based on the selected quantum processor,

an implementation of the compilation method comprising first:

a step of division of the selected quantum circuit into quantum sub-circuits,

a first step of re-writing of the quantum sub-circuits comprising quantum gates non-executable by the selected quantum processor so that they comprise only quantum gates executable by the selected quantum processor,

a second step of re-writing of the quantum sub-circuits by application of a simulated annealing, so as to obtain quantum sub-circuits comprising quantum gates executable by the selected quantum processor, reducing the number of quantum gates,

a step of regrouping the quantum sub-circuits in a quantum circuit compilable by the selected quantum processor,

an implementation step of the compilation method successively comprising:

a quantum gate acting only on the neighboring physical qubits being an effective quantum gate,

a quantum gate acting on at least two non-neighboring physical qubits being an ineffective quantum gate,

an iteration loop successively comprising:

a step of simulation of a given implementation of logical qubits on the physical qubits of the quantum processor,

a step of detecting, in the quantum circuit, the ineffective quantum gate(s),

a step of estimating the number of quantum value swap gates between two physical qubits to be inserted into the quantum circuit so that all of the quantum gates of the quantum circuit are, that is remain or become, effective quantum gates,

a retroaction step, by means of the simulated annealing, involving a new step of simulation based on the number of quantum value swap gates between two estimated physical qubits, until attained, whereupon all the quantum gates are effective:

either a minimum threshold of the number of estimated quantum value swap gates between two physical qubits,

or a maximum threshold of iterations in the loop.

8. A method for the development of a compilation process for a quantum circuit on a quantum processor, comprising: (0) (13)

a selection step:

of a quantum circuit,

of a quantum processor whereupon to compile the quantum circuit,

an implementation step of the compilation method comprising:

a quantum gate acting only on the neighboring physical qubits being an effective quantum gate,

a quantum gate acting on at least two non-neighboring physical qubits being an ineffective quantum gate,

an iteration loop successively comprising:

a step of simulation of a given implementation of the logical qubits on the physical qubits of the quantum processor,

a step of detecting, in the quantum circuit, the ineffective quantum gate(s),

a step of estimating the number of quantum value swap gates between two physical qubits to be inserted into the quantum circuit so that all of the quantum gates of the quantum circuit are, that is remain or become, effective quantum gates,

a retroaction step, by means of the simulated annealing, involving a new step of simulation based on the number of quantum value swap gates between two estimated physical qubits, until attained, whereupon all of the quantum gates are effective:

either a minimum threshold of the number of estimated quantum value swap gates between two physical qubits,

or a maximum threshold of iterations in the loop.

10. A method for the compilation of a quantum circuit on a quantum processor, by the use of a set of quantum gates executable on the quantum processor, comprising: (0) (15)

first:

a step of division of the selected quantum circuit into quantum sub-circuits,

a first step of re-writing the quantum sub-circuits comprising quantum gates non-executable by the selected quantum processor so that they comprise only quantum gates executable by the selected quantum processor,

a second step of re-writing the quantum sub-circuits, by application of a simulated annealing, so as to obtain quantum sub-circuits comprising quantum gates executable by the selected quantum processor, reducing the number of quantum gates,

a step of regrouping the quantum sub-circuits in a quantum circuit compiled by the selected quantum processor,

subsequently:

a quantum gate acting only on the neighboring physical qubits being an effective quantum gate,

a quantum gate acting on at least two non-neighboring physical qubits being an ineffective quantum gate,

an iteration loop successively comprising:

a step of simulation of a given implementation of the logical qubits on the physical qubits of the quantum processor,

a step of detecting, in the quantum circuit, the ineffective quantum gate(s),

a step of estimating the number of quantum value swap gates between two physical qubits to be inserted into the quantum circuit so that all of the quantum gates of the quantum circuit are, that is remain or become, effective quantum gates,

a retroaction step, by means of the simulated annealing, involving a new step of simulation based on the number of quantum value swap gates between two estimated physical qubits, until attained, whereupon all the quantum gates are effective:

either a minimum threshold of the number of estimated quantum value swap gates between two physical qubits,

or a maximum threshold of iterations in the loop.

Application US20200219003

METHOD FOR DEVELOPMENT OF A COMPILING PROCESS FOR A QUANTUM CIRCUIT ON A QUANTUM PROCESSOR AND SAID METHOD

Patent Matrix® Search