ANALYSIS METHOD OF AN EXECUTION SIMULATION OF A QUANTUM CIRCUIT

Description

Technical field

[0001] The invention relates to the field of methods for analyzing simulations of the execution of a quantum circuit. Prior art

[0002] For such an analysis, it is known to repeatedly perform a very large number of simulations, in order to obtain all the values ​​of the possible quantum states.

[0003] It is also known to perform intermediate measurements during the simulation of the quantum circuit execution.

[0004] KRISTEL MICHIELSEN ET AL: "QCE: A Simulator for Quantum Computer Hardware",TURKISH JOURNAL OF PHYSICS, vol. 27, no. 5, September 1, 2003 (2003-09-01), pages 343-370, describes an emulator for quantum circuits. Technical problem

[0005] These known solutions do not allow a good compromise to be achieved between, on the one hand, the simplification of the analysis of the execution of a quantum circuit and, on the other hand, the completeness of the analysis carried out. Summary of the invention

[0006] The invention at least partially overcomes the drawbacks of the prior art and improves the compromise mentioned above.

[0007] This involves being able to analyze the execution of a quantum circuit, particularly for the purposes of debugging this quantum circuit.

[0008] For this, according to the invention, it will be interesting on the one hand to be able to follow step by step the execution of this quantum circuit and on the other hand to extract in a simple and complete manner, or even transparently for the analyst of the execution of this quantum circuit, all or part of the values ​​of quantum state vectors for certain qbits of particular interest to this analyst, all this at the same time in order to facilitate doubly, by facilitating the focus on the part of the execution of this quantum circuit considered to be particularly interesting while then facilitating the extraction of the data relating to this part of execution, the analysis of the execution of this quantum circuit while preserving the completeness of this analysis, that is to say without losing or sacrificing all or part of the quantum states considered to be interesting by the analyst, which, otherwise, could degrade the completeness of the analysis and / or the progress of the analysis,leading in particular to debugging the execution of this quantum circuit being significantly less efficient.

[0009] To achieve this good compromise between notable simplification of the analysis of the execution of this quantum circuit on the one hand and assured completeness of the analysis carried out on the other hand, the invention proposes a particular combination between on the one hand a post-selection and on the other hand a quantum iteration, both carried out on a simulation of execution rather than on a real execution.

[0010] The invention allows the analyst of the execution of this quantum circuit, on the one hand, to be able to focus in a simple and efficient manner on the part of the execution of this quantum circuit which interests him, while on the other hand making it simpler or even transparent for him to extract the interesting data obtained, hence a precise focus on what interests him, with a simpler way of extracting precisely what interests him.

[0011] Furthermore, the great simplification achieved by using a quantum iterator allows the user to perform more and more detailed post-selection operations, without making the analysis time and difficulty prohibitive. Statement of the invention

[0012] The invention is defined by the independent claim. Particular embodiments are defined by the dependent claims.

[0013] Preferably, the method comprises, between the post-selection step and the analysis step: a fixing filtering step fixing the value of one or more quantum states of the quantum state vector(s) resulting from the post-selection(s) of qbits.

[0014] Thus, it will be interesting on the one hand to be able to follow step by step the execution of this quantum circuit and on the other hand to carry out measurements at the level of the different execution operations of this quantum circuit without notable disturbance of the execution of this quantum circuit, all this at the same time in order to facilitate the analysis of the execution of this quantum circuit while preserving the relevance of this analysis, that is to say without possible disturbances in the execution of this quantum circuit, in particular due to the measurements, degrading the relevance of the analysis of the execution of this quantum circuit, making it either useless or less useful, thus resulting in particular in a debugging of the execution of this quantum circuit that is notably less efficient.

[0015] To achieve this good compromise between notable simplification of the analysis of the execution of this quantum circuit on the one hand and high relevance of the analysis carried out on the other hand, the invention proposes a particular combination between on the one hand a post-selection and on the other hand a fixation filtering, both carried out on an execution simulation rather than on a real execution.

[0016] The method therefore allows the quantum circuit execution analyst to focus on a part of the quantum circuit execution that interests him and on the type of execution of this part of execution, increasing the possibilities of debugging the quantum circuit.

[0017] Preferably, the method comprises between the post-selection step and the analysis step, and before the recovery step: the fixing filtering step fixing the value of one or more quantum states of the quantum state vector(s) resulting from the post-selection(s) of qbits.

[0018] This allows the recovery of a previously filtered quantum state vector. The analysis of the filtered quantum state vector can thus be done immediately after recovering this quantum state vector, without requiring additional operations on this quantum state vector.

[0019] Preferably, the method comprises: a step of identifying each quantum state of said vector(s) of quantum states and a parameter representative of a probability which is respectively associated with said each quantum state, situated between the post-selection step and the recovery step, the recovery step further comprising the recovery of each parameter representative of the probability respectively associated with each quantum state.

[0020] The iterator therefore allows the extraction of additional information about the quantum state vector, in a simple and unsupervised manner. This therefore makes it possible to further improve the completeness of the execution analysis.

[0021] The step of post-selection of one or more particular values ​​of one or more qbits is carried out at the measurement output of said qbit(s).

[0022] Since intermediate measurements or the final measurement are an integral part of the execution, the post-selection step can advantageously be carried out after one of these measurements. This allows the simulation to be analyzed step by step.

[0023] The step of post-selection of one or more particular values ​​of one or more qbits is carried out following an operation by a quantum gate on said qbit(s).

[0024] Thus, by knowing the sequence of operations during execution, the post-selection step can be performed at any time during execution. This therefore allows a complete and non-degraded analysis of the quantum states deemed interesting at any time during the simulation.

[0025] The process includes: a step of communicating quantum states of one or more quantum state vectors between, on the one hand, a simulator in which these quantum states are stored and, on the other hand, an application terminal in which these quantum states will be analyzed, these quantum states being communicated several times, the quantity of data communicated each time not exceeding the size of a buffer memory, this buffer memory size being smaller than the size of the memory storing these quantum states in the simulator, preferably at least 10 times smaller, and preferentially at least 100 times smaller.

[0026] This allows for a very significant memory saving, especially at the application terminal level, whose memory can be quite limited.

[0027] Preferably, the size of the buffer memory, at the application terminal level and at the simulator level, is large enough so that the processing time of the contents of this buffer memory by the application terminal is greater than the transfer time of the data communicated between the simulator and the application terminal.

[0028] This significant memory gain is therefore not, or almost not, at the expense of data processing speed in the application terminal.

[0029] Preferably, the buffer size is between 1MB and 100MB, preferably between 3MB and 20MB.

[0030] The memory range is thus optimized for the compromise between memory gain and preservation of processing speed.

[0031] Preferably, the analysis step is followed by a debugging step of the execution of the quantum circuit.

[0032] This therefore allows an interesting application of the analysis step, making it possible to improve the quality and efficiency of the analyzed quantum circuit.

[0033] Preferably, the method comprises, between the post-selection step and the analysis step: a threshold filtering step setting a probability threshold below which the corresponding quantum states are removed from the vector of quantum states to which they belong, and / or a value filtering step, selecting a value of a quantum state for which the corresponding quantum states are retained in the vector of quantum states.

[0034] Several filtering steps can therefore be performed on the quantum state vector. Filtering the quantum states of the quantum state vector according to different parameters makes it possible to further increase the completeness of the analysis, by focusing on the quantum states deemed interesting. The different types of filtering can be combined and / or superimposed on each other.

[0035] Preferably, the method comprises, following the fixing filtering step: a renormalization step of the vector of quantum states, so that the sum of the probabilities of the quantum states conserved in this vector of quantum states is still 1.

[0036] The renormalization step advantageously makes it possible to have a coherent filtered quantum state vector, in particular when quantum states of the quantum state vector have been removed from said quantum state vector during one of the filtering steps.

[0037] Preferably, the method is integrated into an application programming interface (API) capable of accessing a server including a quantum circuit execution simulator and a communication module with an application terminal remote from the simulator.

[0038] This improves ease of use for the user-analyst from their application terminal.

[0039] The number of qubits in the quantum circuit is between 10 and 50.

[0040] The analysis method of the invention works even with large or even very large quantum circuits.

[0041] Preferably, the analysis method is implemented in Python language. Python language is well suited for this type of quantum circuit operation analysis method.

[0042] The invention and the variants thereof can make it possible, in general, to propose a method for analyzing a simulation of the execution of a quantum circuit allowing a complete and simplified analysis, in particular for debugging the execution of the quantum circuit, and in particular to offer a better compromise between, on the one hand, the simplification of the analysis of the execution of a quantum circuit and, on the other hand, the completeness of the analysis carried out.

[0043] Such a solution allows to solve the problems posed by known solutions. Brief description of the drawings

[0044] Other characteristics, details and advantages of the invention will appear on reading the detailed description below, and on analyzing the attached drawings, in which: Fig. 1 [ Fig. 1 ] shows a system for implementing a method for analyzing a simulation of the execution of a quantum circuit Fig. 2 [ Fig. 2] shows a flowchart illustrating the main steps of the process of analyzing a simulation of the execution of a quantum circuit Fig. 3 [ Fig. 3 ] shows an example of the flow of execution on a vector of quantum states . Description of the embodiments

[0045] Reference is now made to the figure 1 , on which an example of system 1 making it possible to implement a method for analyzing the execution of a simulation of a quantum circuit is illustrated.

[0046] System 1 includes in particular a simulator 2 of a quantum circuit. More precisely, simulator 2 makes it possible to simulate a quantum processor.

[0047] At the output of simulator 2, a vector of quantum states is obtained. The vector of quantum states includes 2 n< quantum states, n being the number of qbits on which the simulation is carried out.

[0048] The vector of quantum states comprises, for example, between 2 2< and 2 1000< . In other words, the quantum circuit comprises between 2 and 1000 qbits. Preferably, the vector of quantum states comprises, for example, between 2 10< and 2 50< . In other words, the quantum circuit comprises between 10 and 50 qbits.

[0049] The simulator 2 comprises for example a memory 3. The memory 3 may in particular be capable of storing the vector of quantum states obtained. The memory 3 therefore comprises a significant storage capacity in order to be capable of storing a vector of quantum states comprising between 2 2< and 2 1000< , and preferably between 2 10< and 2 50< possible quantum states.

[0050] Simulator 2 is for example stored on a server 4.

[0051] The server 4 comprises, for example, a communication module 5a, enabling communication with an application terminal 6 via a communication module 5b of the application terminal 6.

[0052] The application terminal 6 is, for example, remote from the server 4. The application terminal 6 allows an analyst in particular to access the quantum state vector in order to analyze it, without storing it.

[0053] For this purpose, an iterator 7 is implemented in system 1. The iterator 7 allows interaction between the application terminal 6 and the simulator 2.

[0054] More precisely, iterator 7 makes it possible to avoid duplication of all the information, in other words the vector of quantum states obtained at the output of simulator 2, to the application terminal 6. In other words, iterator 7 makes it possible to recover the information at the output of simulator 2, on the application terminal 6. Iterator 7 therefore allows an analyst to have access to the information at the output of simulator 2 in a simple manner.

[0055] More precisely, iterator 7 loops over each quantum state of the quantum state vector obtained at the output of simulator 2, so that each quantum state can be retrieved on the application terminal.

[0056] The iterator 7 may further comprise filters F1, F2 and F3 to be applied to the quantum state vector. These filters are more precisely described with reference to the figure 2 .

[0057] Furthermore, the system 1 comprises a buffer memory 8a implemented in the simulator 2, and a buffer memory 8b implemented in the application terminal 6.

[0058] The information obtained at the output of the simulator 2 is transmitted to the application terminal 6, by means of the iterator 7, via the buffer memories 8a, 8b.

[0059] Iterator 7 is stored in simulator 2 and is in communication with buffer 8a.

[0060] The use of buffer memories 8a, 8b makes it possible to greatly reduce the memory size required to access the information obtained at the output of simulator 2.

[0061] The size of the buffer memories 8a, 8b can be chosen so that the processing time of the contents of the buffer memory 8b by the application terminal 6 is greater than the transfer time of the information obtained at the output of the simulator 2 from the simulator 2 to the application terminal 6.

[0062] Thus, the size of the buffer memories 8a, 8b can be chosen between 1MB and 100MB, and preferably between 3MB and 20MB.

[0063] As a result, the size of the buffer memories 8a, 8b is at least 10 times, and reference at least 100 times smaller than the size of the memory 3 storing the information obtained at the output of the simulator 2.

[0064] Thus, at the end of the simulation, a quantum state vector 2 n< is obtained. The quantum state vector 2 n< is stored in the memory 3 of the simulator 2. The memory 3 communicates with the iterator 7. More precisely, the memory 3 transmits sections of the quantum state vector 2 n< to the iterator 7. The iterator 7 is configured to process these sections of the quantum state vector 2 n< , in particular by means of the filters F1, F2 and F3. The iterator 7 is configured to send the sections of the quantum state vector to the buffer memory 8a of the simulator 2 which transmits them, via the communication interfaces 5a, 5b, to the application terminal 6. The buffer memory 8b of the application terminal 6 receives the sections of the quantum state vector, so that they can be analyzed by an analyst directly on the application terminal. Communication between the server 4 and the application terminal 6 is, for example, carried out by radio waves or via the Internet network.

[0065] According to an alternative embodiment, the iterator 7 is stored in the buffer memory 8a of the simulator 2.

[0066] There figure 2 illustrates the main steps of a method for simulating the execution of a quantum circuit according to an example of implementation.

[0067] In simulation step S1, the simulation of the quantum circuit is launched. When simulating the execution of a quantum circuit, the obtained quantum state vector is composed of a plurality of qbits having quantum states 0 and 1.

[0068] In reference to the figure 3 , the quantum states of the qbits in the quantum state vector are not known. Each quantum state of a qbit has a probability associated with it, with the sum of the probabilities equal to 1.

[0069] So when the measurement of qbit 2 is performed, a probability p is associated with one of the two quantum states 0 or 1, and a probability p-1 is associated with the other quantum state 0 or 1.

[0070] With each measurement, a new probability is associated with each quantum state 0 or 1 of the measured qubits.

[0071] Thus, when measuring qbit n, a probability p' is associated with one of the two quantum states 0 or 1 for the first qbit, and a probability 1-p' is associated with the other of the two quantum states 0 or 1. Similarly, for the nth qbit, a probability p" is associated with one of the two quantum states 0 or 1 of the nth qbit, and a probability 1-p" is associated with the other of the two quantum states 0 or 1 of the nth qbit.

[0072] The probabilities p, p' and p" are generally different but can, in certain cases, be equal.

[0073] During the simulation, intermediate measurements are made for each qbit. These intermediate measurements affect the quantum state of the measured qbits, causing a qbit to be fixed to a quantum state between 0 and 1.

[0074] The simulation therefore makes it possible to obtain an execution tree, illustrated in the figure 3 , on which the nodes represent each qbit of the vector of quantum states. Following intermediate measurements made on the qbits, two branches leave each node: each branch representing a quantum state of the measured qbit to which its probability is associated.

[0075] At the end of the execution, a plurality of quantum state vectors, comprising 2 n< quantum states, is obtained.

[0076] The triangles symbolize quantum operations that can be performed on the qbits. Quantum operations, for example, include applying quantum gates to the qbits, which can change the value of the qbits or not.

[0077] In the post-selection step S2, a post-selection of one or more particular values ​​of one or more qubits at one or more steps of the simulation is performed. By particular value, we mean a particular quantum state.

[0078] In other words, it is possible to post-select one or more branches of execution. More precisely, it is possible to post-select a quantum state of one or more qubits during execution.

[0079] Post-selection can amount to choosing values ​​of the quantum states from the quantum state vector.

[0080] For the same simulation, post-selections of qbit values ​​can be successive. Post-selections can also be repetitive. For example, it is possible to post-select the same value of a qbit several times. For example, it is possible to post-select different values ​​for the same qbit several times. For example, it is possible to select different values ​​of different qbits several times.

[0081] In the remainder of the description, the term “post-selection” is used, although multiple post-selections may be performed, as described above.

[0082] Post-selection is performed in several stages of the simulation. For example, post-selection is performed at the output of the qbit measurement.

[0083] Post-selection is performed following an operation by a quantum gate on the qubit.

[0084] Then, a fixation filtering step S3 is performed. The fixation filtering fixes the value of one or more quantum states of the quantum state vector(s) resulting from the post-selection(s) of qbits.

[0085] The terms “quantum state vector resulting from the post-selection(s) of qbits” and “quantum state vector of the post-selected qbit(s)” are used interchangeably in the remainder of the description.

[0086] The fixation filtering step S3 is for example carried out by the iterator 7, and in particular by applying the filter F1 illustrated in the figure 1 .

[0087] The fixation filtering step S3 is for example located between the post-selection step S2 and the recovery step S5, described below.

[0088] The fixing filtering step S3 includes in particular the fixing of quantum state values ​​of the quantum state vector resulting from the post-selection.

[0089] The fixation filtering step allows in particular the iterator 7 not to have to go through the entire vector of quantum states resulting from the post-selection of qbits when it is retrieved on the application terminal 6.

[0090] More precisely, if, on a vector of quantum states resulting from the post-selection of qbits of n quantum states, three quantum states are fixed during the fixing filtering step, a vector of size 2 n-3< is recovered by means of iterator 7, and no longer a quantum vector of size 2 n< .

[0091] The fixation filtering step therefore also makes it possible to reduce the size of the information to be transmitted to the application terminal.

[0092] According to one embodiment, an additional filtering step S4 is performed.

[0093] The additional filtering step S4 is implemented by iterator 7.

[0094] For example, the additional filtering step S4 may comprise threshold filtering and / or value filtering of the quantum states of the quantum state vector resulting from the post-selection of qbits.

[0095] Threshold filtering includes, in particular, defining a probability threshold for which quantum states associated with a probability below this threshold are not preserved.

[0096] Threshold filtering is performed by applying the F2 filter shown in the figure 1 .

[0097] Value filtering includes in particular the definition of a quantum state value for which the quantum states of the quantum state vector resulting from the post-selection of qbits having this value are not recovered.

[0098] Value filtering is performed by applying the F3 filter shown in the figure 1 .

[0099] This additional filtering step S4 makes it possible, on the one hand, to reduce the size of the information to be exchanged to the application terminal 6 by removing certain quantum states from the vector of quantum states resulting from the post-selection of qbits, and, on the other hand, to increase the completeness of the analysis by focusing only on the quantum states deemed interesting.

[0100] Filtering types can be combined and / or superimposed for multiple quantum states of the quantum state vector.

[0101] According to one embodiment, the fixing filtering steps S3 and additional filtering S4 may be followed by a renormalization step of the filtered quantum state vector during which the probability of each quantum state conserved in the filtered quantum state vector is modified so that the sum of the probabilities of each quantum state is equal to 1.

[0102] Then, a recovery step S5, by the iterator 7, of all or part of the quantum states of the quantum state vector(s) resulting from the post-selection of qbits and filtered is carried out.

[0103] The recovery step S5 may also comprise the recovery, by the iterator 7, of all or part of the quantum states of the quantum state vector(s) resulting from the post-selection of qbits and resulting from the different types of filtering, described with reference to the fixation filtering steps S3 and additional filtering steps S4.

[0104] The recovery step S5 may further comprise recovering each of the probabilities associated with each quantum state of the recovered quantum state vector, renormalized or not.

[0105] In particular, the iterator 7 is capable of identifying a parameter representative of the probability of each quantum state of the vector of quantum states, between the post-selection step and the recovery step, for example before the fixation filtering step.

[0106] The iterator 7 is for example able to read the vector of quantum states, and to associate a probability with each quantum state. The iterator is also able, from a complex model of the “stabilizer matrix” type, to recalculate the elements of the matrix to put them in the form of a readable vector of quantum states and to associate a probability with each quantum state of this vector of quantum states.

[0107] The iterator 7 is configured to iterate over each of the quantum states of the quantum state vector obtained after step S4, and possibly over the probabilities associated with them, so that an analyst can access them from the application terminal 6 for an analysis step S6.

[0108] The analysis step S6 comprises for example the comparison of the quantum states of the recovered quantum state vector with the quantum states of the expected quantum state vector following the post-selection steps S2 and fixation filtering steps S3.

[0109] In debugging step S7, the data from the analysis can be used for debugging the execution of the quantum circuit.

[0110] The method is implemented on an application programming interface (or “API”), capable of accessing the server 4.

[0111] Alternatively, threshold filtering involves defining a probability threshold for which quantum states associated with a probability above that threshold are not conserved.

[0112] Alternatively, the value filtering includes in particular the definition of a quantum state value for which only the quantum states of the quantum state vector resulting from the post-selection of qbits having this value are recovered. Industrial application

[0113] The invention may find application in particular in the field of quantum computing and debugging the execution of quantum circuits.

[0114] The invention is not limited to the examples described above, only by way of example, but it encompasses all the variants that a person skilled in the art may envisage within the framework of the protection sought. List of reference signs

[0115] 1: System 2: Quantum simulator 3: Memory 4: Server 5: Communication interface 6: Application terminal 7: Iterator 8a, 8b: Buffer memories S1: Simulation step S2: Post-selection step S3: Fixation filtering step S4: Additional filtering step S5: Recovery step S6: Analysis step S7: Debugging step

Claims

1. . Method for analyzing a simulation of the execution of a quantum circuit, comprising: - a step of post-selecting (S2) one or more particular values of one or more qubits at one or more steps of the simulation, carried out at the output of the measurement of said qubit(s) after a quantum gate operation on said qubit(s), in order to post-select one or more branches of the execution in the execution tree obtaned by said simulation, the execution tree comprising nodes representing each qubit of the quantum state vector, two branches departing from each node: each branch representing a quantum state of the measured qubit, - a step of retrieving (S5), by an iterator (7), all or some of the quantum states of the quantum state vector(s) derived from the post-selection(s) of qubits, - a step of analyzing (S6) the part of said simulation that corresponds to the post-selection(s) of qubits and to the quantum state vector(s) retrieved. - a step of communicating quantum states of one or more quantum state vectors between on the one hand a simulator (2) in which those quantum states are stored and on the other hand an application terminal (6) wherein those quantum states will be analyzed, - those quantum states being communicated in multiple installments, between a memory (3) of the simulator (2) and a buffer memory (8a) of the simulator (2), that buffer memory (8a) size being less than the size of the memory (3) storing those quantum states in the simulator (2), then between said buffer memory (8a) of the simulator (2) and a buffer memory (8b) of said application terminal (6), that buffer memory (8b) size being less than the size of the memory (3), - the iterator (7) looping onto each quantum state of the quantum state vector obtained at the output of the simulator (2), so that each quantum state can be retrieved on the application terminal (6), - the memory (3) of the simulator (2) transmitting sections of the quantum state vector to the iterator (7) which is configured to process those sections of the quantum state vector and to send those sections of the quantum state vector to the buffer memory (8a) of the simulator (2), - the number of qubits in the quantum circuit is between 10 and 50.

2. . Method for analyzing a simulation of the execution of a quantum circuit according to the preceding claim, characterized in that it comprises, between the step of post-selection (S2) and the step of analysis (S6): - a step of setting filtration (S3) that sets the value of one or more quantum states of the quantum state vector(s) derived from the post-selections of qubits.

3. . Method for analyzing a simulation of the execution of a quantum circuit according to the preceding claim, characterized in that it comprises, between the step of post-selection (S2) and the step of analysis (S6), and before the step of retrieval (S5): - the step of setting filtration (S3) that sets the value of one or more quantum states of the quantum state vector(s) derived from the post-selection(s) of qubits.

4. . Method for analyzing a simulation of the execution of a quantum circuit according to any one of the claims 1 to 3, characterized in that it comprises: - a step of identifying each quantum state of said quantum state vector(s) and a parameter representative of a probability that is respectively associated with said each quantum state, located between the step of post-selection (S2) and the step of retrieval (S5), - the step of retrieval (S5) further comprising the retrieval of each parameter representative of the probability respectively associated with each quantum state.

5. . Method for analyzing a simulation of the execution of a quantum circuit according to claim 4, characterized in that: - the size of the buffer memory (8a, 8b), in the application terminal (6) and in the simulator (2) is large enough for the time taken to process the contents of that buffer memory (8a, 8b) by the application terminal (6) to be longer than the time taken to transfer the data communicated between the simulator (2) and the application terminal (6).

6. . Method for analyzing a simulation of the execution of a quantum circuit according to one of the claims 4 to 5, characterized in that: - the size of the buffer memory is between 1 MB and 100 MB, preferably between 3 MB and 20 MB.

7. . Method for analyzing a simulation of the execution of a quantum circuit according to any one of the preceding claims, characterized in that: - the step of analysis (S6) is followed by a step of debugging (S7) the execution of the quantum circuit.

8. . Method for analyzing a simulation of the execution of a quantum circuit according to any one of the preceding claims, characterized in that it comprises, between the step of post-selection (S2) and the step of analysis (S6): - a step of threshold filtration (S4), setting a probability threshold below which the corresponding quantum states are removed from the quantum state vector to which they belong, and / or - a step of value filtration (S4), selecting a value of a quantum state for which the corresponding quantum states are kept in the quantum state vector.

9. . Method for analyzing a simulation of the execution of a quantum circuit according to any one of claims 2, 3, or 8, characterized in that it comprises, following the step of setting filtration (S3): - a step of renormalizing the quantum state vector, so that the sum of the probabilities of the quantum states kept in that quantum state vector is still equal to 1.

10. . Method for analyzing a simulation of the execution of a quantum circuit according to any one of the preceding claims, characterized in that it: - is integrated into an application programming interface (API) capable of accessing a server (4) including a quantum circuit execution simulator (2) and a module (5) for communicating with a remote application terminal (6) separate from the simulator (2).