Vadym Kliuchnikov

According to our database, Vadym Kliuchnikov authored at least 22 papers between 2012 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Trading T gates for dirty qubits in state preparation and unitary synthesis.

Guang Hao Low, Vadym Kliuchnikov, Luke Schaeffer

Quantum, 2024

2023

Shorter quantum circuits via single-qubit gate approximation.

Vadym Kliuchnikov, Kristin E. Lauter, Romy M. Minko, Adam Paetznick, Christophe Petit

Quantum, December, 2023

2022

QIRO: A Static Single Assignment-based Quantum Program Representation for Optimization.

David Ittah, Thomas Häner, Vadym Kliuchnikov, Torsten Hoefler

ACM Trans. Quantum Comput., September, 2022

Shorter quantum circuits.

Vadym Kliuchnikov, Kristin E. Lauter, Romy M. Minko, Christophe Petit, Adam Paetznick

IACR Cryptol. ePrint Arch., 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

Space-time optimized table lookup.

Thomas Häner, Vadym Kliuchnikov, Martin Roetteler, Mathias Soeken

CoRR, 2022

QParallel: Explicit Parallelism for Programming Quantum Computers.

Thomas Häner, Vadym Kliuchnikov, Martin Roetteler, Mathias Soeken, Alexander Vaschillo

CoRR, 2022

2021

Surface code compilation via edge-disjoint paths.

Michael E. Beverland, Vadym Kliuchnikov, Eddie Schoute

CoRR, 2021

Enabling Dataflow Optimization for Quantum Programs.

David Ittah, Thomas Häner, Vadym Kliuchnikov, Torsten Hoefler

CoRR, 2021

A Resource Estimation and Verification Workflow in Q# Special session paper.

Mathias Soeken, Mariia Mykhailova, Vadym Kliuchnikov, Christopher E. Granade, Alexander Vaschillo

Proceedings of the Design, Automation & Test in Europe Conference & Exhibition, 2021

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

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

Proceedings of the Real World Domain Specific Languages Workshop, 2018

2016

Practical Approximation of Single-Qubit Unitaries by Single-Qubit Quantum Clifford and T Circuits.

Vadym Kliuchnikov, Dmitri Maslov, Michele Mosca

IEEE Trans. Computers, 2016

2015

A framework for exact synthesis.

Vadym Kliuchnikov, Jon Yard

CoRR, 2015

A Framework for Approximating Qubit Unitaries.

Vadym Kliuchnikov, Alex Bocharov, Martin Roetteler, Jon Yard

CoRR, 2015

2014

New methods for Quantum Compiling.

Vadym Kliuchnikov

PhD thesis, 2014

An algorithm for the T-count.

David Gosset, Vadym Kliuchnikov, Michele Mosca, Vincent Russo

Quantum Inf. Comput., 2014

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

Optimization of Clifford Circuits

Vadym Kliuchnikov, Dmitri Maslov

CoRR, 2013

Asymptotically Optimal Topological Quantum Compiling.

Vadym Kliuchnikov, Alex Bocharov, Krysta M. Svore

CoRR, 2013

Synthesis of unitaries with Clifford+T circuits.

Vadym Kliuchnikov

CoRR, 2013

2012

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