default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVadym Kliuchnikov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j4]Vadym Kliuchnikov, Kristin E. Lauter, Romy M. Minko, Adam Paetznick, Christophe Petit
:
Shorter quantum circuits via single-qubit gate approximation. Quantum 7: 1208 (2023)- 2022
- [i15]Thomas Häner, Vadym Kliuchnikov, Martin Roetteler, Mathias Soeken, Alexander Vaschillo:
QParallel: Explicit Parallelism for Programming Quantum Computers. CoRR abs/2210.03680 (2022) - [i14]Thomas Häner, Vadym Kliuchnikov, Martin Roetteler, Mathias Soeken:
Space-time optimized table lookup. CoRR abs/2211.01133 (2022) - [i13]Michael E. Beverland, Prakash Murali, Matthias Troyer, Krysta M. Svore, Torsten Hoefler, Vadym Kliuchnikov, Guang Hao Low, Mathias Soeken, Aarthi Sundaram, Alexander Vaschillo:
Assessing requirements to scale to practical quantum advantage. CoRR abs/2211.07629 (2022) - [i12]Vadym Kliuchnikov, Kristin E. Lauter, Romy M. Minko, Christophe Petit, Adam Paetznick:
Shorter quantum circuits. IACR Cryptol. ePrint Arch. 2022: 372 (2022) - 2021
- [c2]Mathias Soeken, Mariia Mykhailova, Vadym Kliuchnikov, Christopher E. Granade, Alexander Vaschillo:
A Resource Estimation and Verification Workflow in Q# Special session paper. DATE 2021: 1050-1055 - [i11]David Ittah, Thomas Häner, Vadym Kliuchnikov, Torsten Hoefler:
Enabling Dataflow Optimization for Quantum Programs. CoRR abs/2101.11030 (2021) - [i10]Michael E. Beverland, Vadym Kliuchnikov, Eddie Schoute:
Surface code compilation via edge-disjoint paths. CoRR abs/2110.11493 (2021)
2010 – 2019
- 2018
- [c1]Krysta M. Svore, Alan Geller, Matthias Troyer, John Azariah, Christopher E. Granade, Bettina Heim, Vadym Kliuchnikov, Mariia Mykhailova, Andres Paz, Martin Roetteler:
Q#: Enabling Scalable Quantum Computing and Development with a High-level DSL. RWDSL@CGO 2018: 7:1-7:10 - [i9]Krysta M. Svore, Alan Geller, Matthias Troyer, John Azariah, Christopher E. Granade, Bettina Heim, Vadym Kliuchnikov, Mariia Mykhailova, Andres Paz, Martin Roetteler:
Q#: Enabling scalable quantum computing and development with a high-level domain-specific language. CoRR abs/1803.00652 (2018) - 2016
- [j3]Vadym Kliuchnikov, Dmitri Maslov, Michele Mosca:
Practical Approximation of Single-Qubit Unitaries by Single-Qubit Quantum Clifford and T Circuits. IEEE Trans. Computers 65(1): 161-172 (2016) - 2015
- [i8]Vadym Kliuchnikov, Jon Yard:
A framework for exact synthesis. CoRR abs/1504.04350 (2015) - [i7]Vadym Kliuchnikov, Alex Bocharov, Martin Roetteler, Jon Yard:
A Framework for Approximating Qubit Unitaries. CoRR abs/1510.03888 (2015) - 2014
- [b1]Vadym Kliuchnikov:
New methods for Quantum Compiling. University of Waterloo, Ontario, Canada, 2014 - [j2]David Gosset, Vadym Kliuchnikov, Michele Mosca, Vincent Russo:
An algorithm for the T-count. Quantum Inf. Comput. 14(15-16): 1261-1276 (2014) - 2013
- [j1]Vadym Kliuchnikov, Dmitri Maslov, Michele Mosca:
Fast and efficient exact synthesis of single-qubit unitaries generated by clifford and T gates. Quantum Inf. Comput. 13(7-8): 607-630 (2013) - [i6]Vadym Kliuchnikov, Dmitri Maslov:
Optimization of Clifford Circuits. CoRR abs/1305.0810 (2013) - [i5]Vadym Kliuchnikov:
Synthesis of unitaries with Clifford+T circuits. CoRR abs/1306.3200 (2013) - [i4]Vadym Kliuchnikov, Alex Bocharov, Krysta M. Svore:
Asymptotically Optimal Topological Quantum Compiling. CoRR abs/1310.4150 (2013) - 2012
- [i3]Vadym Kliuchnikov, Dmitri Maslov, Michele Mosca:
Fast and efficient exact synthesis of single qubit unitaries generated by Clifford and T gates. CoRR abs/1206.5236 (2012) - [i2]Vadym Kliuchnikov, Dmitri Maslov, Michele Mosca:
Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits. CoRR abs/1212.0822 (2012) - [i1]Vadym Kliuchnikov, Dmitri Maslov, Michele Mosca:
Practical approximation of single-qubit unitaries by single-qubit quantum Clifford and T circuits. CoRR abs/1212.6964 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-07 19:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
