Mar 8, 2013 · Here we present a polynomial-time algorithm for optimizing quantum circuits that takes the actual implementation of fault-tolerant logical gates into ...

Sep 16, 2014 · Here we present a polynomial-time algorithm for optimizing quantum circuits that takes the actual implementation of fault-tolerant logical gates ...

A polynomial-time algorithm for optimizing quantum circuits that takes the actual implementation of fault-tolerant logical gates into consideration, ...

Dec 13, 2013 · The algorithm uses a representation of circuits based on linear Boolean functions, allowing. T gates to be combined and then parallelized ...

Our algorithm resynthesizes quantum circuits composed of CNOT and T gates, the latter being typically the most costly gate in fault-tolerant models, e.g., those ...

Dec 13, 2013 · Abstract. Most work in quantum circuit optimization has been performed in isolation from the results of quantum fault-tolerance.

T-par is a quantum circuit optimizer utilizing sum-over-paths representations to analyze and re-synthesize Clifford+T circuits.

Some prominent examples include: "Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning", Matthew Amy, Dmitri Maslov, Michele ...

Sep 13, 2022 · We investigate the problem of synthesizing T-depth optimal quantum circuits for exactly implementable unitaries over the Clifford+T gate set.

Polynomial-Time T-Depth Optimization of Clifford+T Circuits Via Matroid Partitioning. M Amy, D Maslov, M Mosca. Computer-Aided Design of Integrated Circuits and ...