Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits - Vadym Kliuchnikov; Dmitri Maslov; Michele Mosca (CoRR, 2012)

Synthesis of unitaries with Clifford+T circuits. - Vadym Kliuchnikov (CoRR, 2013)

Asymptotically Optimal Topological Quantum Compiling. - Vadym Kliuchnikov; Alex Bocharov; Krysta M. Svore (CoRR, 2013)

Optimization of Clifford Circuits - Vadym Kliuchnikov; Dmitri Maslov (CoRR, 2013)

Fast and efficient exact synthesis of single-qubit unitaries generated by clifford and T gates. - Vadym Kliuchnikov; Dmitri Maslov; Michele Mosca (Quantum Inf. Comput., 2013)

An algorithm for the T-count. - David Gosset; Vadym Kliuchnikov; Michele Mosca; Vincent Russo (Quantum Inf. Comput., 2014)

New methods for Quantum Compiling. - Vadym Kliuchnikov (2014)

A Framework for Approximating Qubit Unitaries. - Vadym Kliuchnikov; Alex Bocharov; Martin Roetteler; Jon Yard (CoRR, 2015)

A framework for exact synthesis. - Vadym Kliuchnikov; Jon Yard (CoRR, 2015)

Practical Approximation of Single-Qubit Unitaries by Single-Qubit Quantum Clifford and T Circuits. - Vadym Kliuchnikov; Dmitri Maslov; Michele Mosca (IEEE Trans. Computers, 2016)

Q#: Enabling Scalable Quantum Computing and Development with a High-level DSL. - Krysta M. Svore; Alan Geller; Matthias Troyer; John Azariah; Christopher E. Granade; Bettina Heim; Vadym Kliuchnikov; Mariia Mykhailova; Andres Paz; Martin Roetteler (RWDSL@CGO, 2018)

Q#: Enabling scalable quantum computing and development with a high-level domain-specific language. - Krysta M. Svore; Alan Geller; Matthias Troyer; John Azariah; Christopher E. Granade; Bettina Heim; Vadym Kliuchnikov; Mariia Mykhailova; Andres Paz; Martin Roetteler (CoRR, 2018)

A Resource Estimation and Verification Workflow in Q# Special session paper. - Mathias Soeken; Mariia Mykhailova; Vadym Kliuchnikov; Christopher E. Granade; Alexander Vaschillo (DATE, 2021)

Enabling Dataflow Optimization for Quantum Programs. - David Ittah; Thomas Häner; Vadym Kliuchnikov; Torsten Hoefler (CoRR, 2021)

Surface code compilation via edge-disjoint paths. - Michael E. Beverland; Vadym Kliuchnikov; Eddie Schoute (CoRR, 2021)

QParallel: Explicit Parallelism for Programming Quantum Computers. - Thomas Häner; Vadym Kliuchnikov; Martin Roetteler; Mathias Soeken; Alexander Vaschillo (CoRR, 2022)

Space-time optimized table lookup. - Thomas Häner; Vadym Kliuchnikov; Martin Roetteler; Mathias Soeken (CoRR, 2022)

Assessing requirements to scale to practical quantum advantage. - Michael E. Beverland; Prakash Murali; Matthias Troyer; Krysta M. Svore; Torsten Hoefler; Vadym Kliuchnikov; Guang Hao Low; Mathias Soeken; Aarthi Sundaram; Alexander Vaschillo (CoRR, 2022)

Shorter quantum circuits. - Vadym Kliuchnikov; Kristin E. Lauter; Romy M. Minko; Christophe Petit 001; Adam Paetznick (IACR Cryptol. ePrint Arch., 2022)

Shorter quantum circuits via single-qubit gate approximation. - Vadym Kliuchnikov; Kristin E. Lauter; Romy M. Minko; Adam Paetznick; Christophe Petit 001 (Quantum, 2023)

Trading T gates for dirty qubits in state preparation and unitary synthesis. - Guang Hao Low; Vadym Kliuchnikov; Luke Schaeffer (Quantum, 2024)