Vadym Kliuchnikov

24 papers A 1Journal 21Unranked 1

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	Trading T gates for dirty qubits in state preparation and unitary synthesis. Quantum Guang Hao Low, Vadym Kliuchnikov, Luke Schaeffer
2023	J	`jnl`	Shorter quantum circuits via single-qubit gate approximation. Quantum Vadym Kliuchnikov, Kristin E. Lauter, Romy M. Minko, Adam Paetznick, Christophe Petit
2022	J	`jnl`	Assessing requirements to scale to practical quantum advantage. CoRR Michael E. Beverland, Prakash Murali, Matthias Troyer, Krysta M. Svore, Torsten Hoefler, Vadym Kliuchnikov, Guang Hao Low, Mathias Soeken, Aarthi Sundaram, Alexander Vaschillo
2022	J	`jnl`	QIRO: A Static Single Assignment-based Quantum Program Representation for Optimization. ACM Trans. Quantum Comput. David Ittah, Thomas Häner, Vadym Kliuchnikov, Torsten Hoefler
2022	J	`jnl`	QParallel: Explicit Parallelism for Programming Quantum Computers. CoRR Thomas Häner, Vadym Kliuchnikov, Martin Roetteler, Mathias Soeken, Alexander Vaschillo
2022	J	`jnl`	Shorter quantum circuits. IACR Cryptol. ePrint Arch. Vadym Kliuchnikov, Kristin E. Lauter, Romy M. Minko, Christophe Petit, Adam Paetznick
2022	J	`jnl`	Space-time optimized table lookup. CoRR Thomas Häner, Vadym Kliuchnikov, Martin Roetteler, Mathias Soeken
2021	A	`conf`	A Resource Estimation and Verification Workflow in Q# Special session paper. DATE Mathias Soeken, Mariia Mykhailova, Vadym Kliuchnikov, Christopher E. Granade, Alexander Vaschillo
2021	J	`jnl`	Enabling Dataflow Optimization for Quantum Programs. CoRR David Ittah, Thomas Häner, Vadym Kliuchnikov, Torsten Hoefler
2021	J	`jnl`	Surface code compilation via edge-disjoint paths. CoRR Michael E. Beverland, Vadym Kliuchnikov, Eddie Schoute
2018	—	`conf`	Q#: Enabling Scalable Quantum Computing and Development with a High-level DSL. RWDSL@CGO Krysta M. Svore, Alan Geller, Matthias Troyer, John Azariah, Christopher E. Granade, Bettina Heim, Vadym Kliuchnikov, Mariia Mykhailova, Andres Paz, Martin Roetteler
2018	J	`jnl`	Q#: Enabling scalable quantum computing and development with a high-level domain-specific language. CoRR Krysta M. Svore, Alan Geller, Matthias Troyer, John Azariah, Christopher E. Granade, Bettina Heim, Vadym Kliuchnikov, Mariia Mykhailova, Andres Paz, Martin Roetteler
2016	J	`jnl`	Practical Approximation of Single-Qubit Unitaries by Single-Qubit Quantum Clifford and T Circuits. IEEE Trans. Computers Vadym Kliuchnikov, Dmitri Maslov, Michele Mosca
2015	J	`jnl`	A Framework for Approximating Qubit Unitaries. CoRR Vadym Kliuchnikov, Alex Bocharov, Martin Roetteler, Jon Yard
2015	J	`jnl`	A framework for exact synthesis. CoRR Vadym Kliuchnikov, Jon Yard
2014	J	`jnl`	An algorithm for the T-count. Quantum Inf. Comput. David Gosset, Vadym Kliuchnikov, Michele Mosca, Vincent Russo
2014	—	`—`	New methods for Quantum Compiling. Vadym Kliuchnikov
2013	J	`jnl`	Asymptotically Optimal Topological Quantum Compiling. CoRR Vadym Kliuchnikov, Alex Bocharov, Krysta M. Svore
2013	J	`jnl`	Fast and efficient exact synthesis of single-qubit unitaries generated by clifford and T gates. Quantum Inf. Comput. Vadym Kliuchnikov, Dmitri Maslov, Michele Mosca
2013	J	`jnl`	Optimization of Clifford Circuits CoRR Vadym Kliuchnikov, Dmitri Maslov
2013	J	`jnl`	Synthesis of unitaries with Clifford+T circuits. CoRR Vadym Kliuchnikov
2012	J	`jnl`	Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits CoRR Vadym Kliuchnikov, Dmitri Maslov, Michele Mosca
2012	J	`jnl`	Fast and efficient exact synthesis of single qubit unitaries generated by Clifford and T gates CoRR Vadym Kliuchnikov, Dmitri Maslov, Michele Mosca
2012	J	`jnl`	Practical approximation of single-qubit unitaries by single-qubit quantum Clifford and T circuits CoRR Vadym Kliuchnikov, Dmitri Maslov, Michele Mosca