Abstract: A method for generalizing an algorithm configured to synthesize a diagonal product of Pauli rotations to synthesize a product of Pauli rotations comprising X, Y and Z rotations, the method comprising: Providing a table of p number of rows and m number of columns, where p is a number of qubits and m a number of rotations in the quantum circuit, and where the table comprises X, Y, Z or I entry corresponding to the respective rotations of the qbits; Determining a pivot row, and recursively, until all rotations of the product of Pauli rotations are 1-qubit rotations: Determine a target row, Conjugate the target row with the pivot row by insertion of predetermined quantum gates on the qubits corresponding to the target row and/or pivot row by calling, at each recursive call, entries of the same type of the pivot row and by always calling first the identity entry.

Abstract: A method for compiling a quantum circuit on a trapped-ion quantum processor includes: obtaining a quantum circuit containing a first predetermined category of two-qubit quantum gates, and/or one-qubit quantum gates; a separation of the quantum circuit into local layers, and entangling layers; compiling the local layers; compiling the entangling layers, separate from the step of compiling the local layers, transforming the quantum gates of those entangling layers so that they contain only collective or entangling N-qubit quantum gates of a third predetermined category, one-qubit quantum gates of a fourth predetermined category; and a step of grouping together the compiled local layers and the compiled entangling layers into a compiled quantum circuit.

Abstract: The present disclosure relates to a compiling method (50) for converting an input quantum circuit into an output quantum circuit compliant with predetermined constraints of a quantum computer, said input quantum circuit being composed of quantum gates to be applied to a set of qubits, said quantum gates arranged successively in an execution order, wherein said method comprises, for each quantum gate of the input quantum circuit processed according to the execution order: if the processed quantum gate corresponds to an operator of a set of synthesizable operators: (S53) update the synthesizable accumulated operator to include the operator corresponding to the quantum gate, otherwise: a) (S54) synthesize a partial quantum sub-circuit partially implementing the current synthesizable accumulated operator and modify accordingly the synthesizable accumulated operator, and b) (S55) append the partial quantum sub-circuit to the output quantum circuit.

Abstract: A method for synthesizing a product of Pauli rotations, wherein said product of Pauli rotations comprises at least two different types of X, Y and/or Z n-qubits Pauli rotations and identities, where the method comprises: providing a table of p number of rows and m number of columns, where p is a number of qubits and m a number of rotations, each column describing one Pauli rotation and each row describing a qubit, the method performing iteratively, until the table is empty: a step of simulating conjugations of at least one pair of rows by simulating the insertion of a predetermined type of quantum gates on their respective qubit in order to bring one of the X, Y or Z entry of at least one column to an identity entry, for each simulation, a step of counting the number of identity entries that appeared, a step of associating a score to each simulation, where the higher score corresponds to the simulation bringing the most identity entries in the associated column, and a step of performing one conjugation,

Abstract: A method for generalizing an algorithm configured to synthesize a diagonal product of Pauli rotations to synthesize a product of Pauli rotations comprising X, Y and Z rotations, the method comprising: Providing a table of p number of rows and m number of columns, where p is a number of qubits and m a number of rotations in the quantum circuit, and where the table comprises X, Y, Z or I entry corresponding to the respective rotations of the qbits; Determining a pivot row, and recursively, until all rotations of the product of Pauli rotations are 1-qubit rotations: Determine a target row, Conjugate the target row with the pivot row by insertion of predetermined quantum gates on the qubits corresponding to the target row and/or pivot row by calling, at each recursive call, entries of the same type of the pivot row and by always calling first the identity entry.

Abstract: The present disclosure relates to a compiling method (50) for converting an input quantum circuit into an output quantum circuit compliant with predetermined constraints of a quantum computer, said input quantum circuit being composed of quantum gates to be applied to a set of qubits, said quantum gates arranged successively in an execution order, wherein said method comprises, for each quantum gate of the input quantum circuit processed according to the execution order: if the processed quantum gate corresponds to an operator of a set of synthesizable operators: (S53) update the synthesizable accumulated operator to include the operator corresponding to the quantum gate, otherwise: a) (S54) synthesize a partial quantum sub-circuit partially implementing the current synthesizable accumulated operator and modify accordingly the synthesizable accumulated operator, and b) (S55) append the partial quantum sub-circuit to the output quantum circuit.

Abstract: A method for compiling a quantum circuit on a trapped-ion quantum processor includes: obtaining a quantum circuit containing only a first predetermined category of two-qubit quantum gates, and/or one-qubit quantum gates; a step of compiling the quantum gates so that they only contain collective or entangling N-qubit quantum gates of a third predetermined category, one-qubit quantum gates of a fourth predetermined category, and so that all or at least some of those collective or entangling quantum gates simultaneously apply to at least three qubits, advantageously simultaneously apply to the majority of qubits, and even more advantageously simultaneously apply to all the qubits; and a step of grouping together the compiled quantum gates in a compiled quantum circuit.

Abstract: A method for compiling a quantum circuit on a trapped-ion quantum processor includes: obtaining a quantum circuit containing a first predetermined category of two-qubit quantum gates, and/or one-qubit quantum gates; a separation of the quantum circuit into local layers, and entangling layers; compiling the local layers; compiling the entangling layers, separate from the step of compiling the local layers, transforming the quantum gates of those entangling layers so that they contain only collective or entangling N-qubit quantum gates of a third predetermined category, one-qubit quantum gates of a fourth predetermined category; and a step of grouping together the compiled local layers and the compiled entangling layers into a compiled quantum circuit.

Abstract: A method for compiling a quantum circuit on a trapped-ion quantum processor includes: obtaining a quantum circuit containing only a first predetermined category of two-qubit quantum gates, and/or one-qubit quantum gates; a step of compiling the quantum gates so that they only contain collective or entangling N-qubit quantum gates of a third predetermined category, one-qubit quantum gates of a fourth predetermined category, and so that all or at least some of those collective or entangling quantum gates simultaneously apply to at least three qubits, advantageously simultaneously apply to the majority of qubits, and even more advantageously simultaneously apply to all the qubits; and a step of grouping together the compiled quantum gates in a compiled quantum circuit.