Timothee Goubault de Brugiere
Timothee Goubault de Brugiere has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
Benoit Valiron
Laboratoire de Recherche en Informatique, CentraleSupélec, Orsay, France
1 shared publicationCyril Allouche
Atos Quantum Lab, Les Clayes-sous-Bois, France
1 shared publicationMarc Baboulin
Laboratoire de Recherche en Informatique, Université Paris-Saclay, Orsay, France
1 shared publication- Nicolas Heurtel1 shared publication
Simon Martiel
Atos Quantum Lab, Les Clayes-sous-Bois, France
1 shared publication- Simon Martiel
Atos Quantum Lab, Les Clayes-sous-Bois, France
1 shared publication
Latest Publications
- 17 January 2026
- Published by Elsevier in Computer Physics Communications
- Vol. 321
Fast and memory-efficient strong simulation of noisy adaptive linear optical circuits
- 17 January 2026
- Published by Elsevier in Computer Physics Communications
- Vol. 321
Fast and memory-efficient strong simulation of noisy adaptive linear optical circuits
- Open Access
- 13 February 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Quantum Computing
- Vol. 6 (2) , 1-24
Shallower CNOT Circuits on Realistic Quantum Hardware
We focus on the depth optimization of CNOT circuits on hardware with limited connectivity. We adapt the algorithm from Kutin et al. that implements any n -qubit CNOT circuit in depth at most 5n on a Linear Nearest Neighbor architecture. Our proposal is a block version of Kutin et al.’s algorithm that is scalable with the number of interactions available in the hardware: the more interactions we have, the less the depth. We derive better theoretical upper bounds and provide a simple implementation of the algorithm. Overall, we achieve better depth complexity for CNOT circuits on some realistic quantum hardware like a grid or a ladder. For instance, the execution of an n -qubit CNOT circuit on a grid can be done in depth 4n+8 .
- 13 February 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Quantum Computing
- Vol. 6 (2) , 1-24
Open AccessShallower CNOT Circuits on Realistic Quantum Hardware
We focus on the depth optimization of CNOT circuits on hardware with limited connectivity. We adapt the algorithm from Kutin et al. that implements any n -qubit CNOT circuit in depth at most 5n on a Linear Nearest Neighbor architecture. Our proposal is a block version of Kutin et al.’s algorithm that is scalable with the number of interactions available in the hardware: the more interactions we have, the less the depth. We derive better theoretical upper bounds and provide a simple implementation of the algorithm. Overall, we achieve better depth complexity for CNOT circuits on some realistic quantum hardware like a grid or a ladder. For instance, the execution of an n -qubit CNOT circuit on a grid can be done in depth 4n+8 .
- Open Access
- 7 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Quantum Engineering
- Vol. 2, 1-22
Reducing the Depth of Linear Reversible Quantum Circuits
In quantum computing the decoherence time of the qubits determines the computation time available, and this time is very limited when using current hardware. In this article, we minimize the execution time (the depth) for a class of circuits referred to as linear reversible circuits, which has many applications in quantum computing (e.g., stabilizer circuits, “CNOT+T” circuits, etc.). We propose a practical formulation of a divide-and-conquer algorithm that produces quantum circuits that are twice as shallow as those produced by existing algorithms. We improve the theoretical upper bound of the depth in the worst case for some range of qubits. We also propose greedy algorithms based on cost minimization to find more optimal circuits for small or simple operators. Overall, we manage to consistently reduce the total depth of a class of reversible functions, with up to 92% savings in an ancilla-free case and up to 99% when ancillary qubits are available.
- 7 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Quantum Engineering
- Vol. 2, 1-22
Open AccessReducing the Depth of Linear Reversible Quantum Circuits
In quantum computing the decoherence time of the qubits determines the computation time available, and this time is very limited when using current hardware. In this article, we minimize the execution time (the depth) for a class of circuits referred to as linear reversible circuits, which has many applications in quantum computing (e.g., stabilizer circuits, “CNOT+T” circuits, etc.). We propose a practical formulation of a divide-and-conquer algorithm that produces quantum circuits that are twice as shallow as those produced by existing algorithms. We improve the theoretical upper bound of the depth in the worst case for some range of qubits. We also propose greedy algorithms based on cost minimization to find more optimal circuits for small or simple operators. Overall, we manage to consistently reduce the total depth of a class of reversible functions, with up to 92% savings in an ancilla-free case and up to 99% when ancillary qubits are available.