default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDmitri Maslov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j24]Sergey Bravyi, Andrew W. Cross
, Jay M. Gambetta, Dmitri Maslov, Patrick Rall, Theodore J. Yoder:
High-threshold and low-overhead fault-tolerant quantum memory. Nat. 627(8005): 778-782 (2024)- [i32]Dmitri Maslov, Sergey Bravyi, Felix Tripier, Andrii Maksymov, Joseph A. Latone:
Fast classical simulation of Harvard/QuEra IQP circuits. CoRR abs/2402.03211 (2024) - 2023
- [i31]Sergey Bravyi, Andrew W. Cross, Jay M. Gambetta, Dmitri Maslov, Patrick Rall, Theodore J. Yoder:
High-threshold and low-overhead fault-tolerant quantum memory. CoRR abs/2308.07915 (2023) - 2022
- [j23]Sergey Bravyi, Theodore J. Yoder, Dmitri Maslov:
Efficient Ancilla-Free Reversible and Quantum Circuits for the Hidden Weighted Bit Function. IEEE Trans. Computers 71(5): 1170-1180 (2022) - [i30]Dmitri Maslov, Ben Zindorf:
Depth optimization of CZ, CNOT, and Clifford circuits. CoRR abs/2201.05215 (2022) - [i29]Sergey Bravyi, Dmitri Maslov, Yun Seong Nam:
Constant-cost implementations of Clifford operations and multiply controlled gates using global interactions. CoRR abs/2207.08691 (2022) - [i28]Dmitri Maslov, Willers Yang:
CNOT circuits need little help to implement arbitrary Hadamard-free Clifford transformations they generate. CoRR abs/2210.16195 (2022) - 2021
- [j22]Sergey Bravyi, Ruslan Shaydulin, Shaohan Hu, Dmitri Maslov:
Clifford Circuit Optimization with Templates and Symbolic Pauli Gates. Quantum 5: 580 (2021) - [j21]Sergey Bravyi, Dmitri Maslov:
Hadamard-Free Circuits Expose the Structure of the Clifford Group. IEEE Trans. Inf. Theory 67(7): 4546-4563 (2021) - [i27]Sergey Bravyi, Ruslan Shaydulin, Shaohan Hu, Dmitri Maslov:
Clifford Circuit Optimization with Templates and Symbolic Pauli Gates. CoRR abs/2105.02291 (2021) - 2020
- [i26]Sergey Bravyi, Dmitri Maslov:
Hadamard-free circuits expose the structure of the Clifford group. CoRR abs/2003.09412 (2020) - [i25]Sergey Bravyi, Theodore J. Yoder, Dmitri Maslov:
Efficient ancilla-free reversible and quantum circuits for the Hidden Weighted Bit function. CoRR abs/2007.05469 (2020) - [i24]Dmitri Maslov, Jin-Sung Kim, Sergey Bravyi, Theodore J. Yoder, Sarah Sheldon:
Quantum advantage for computations with limited space. CoRR abs/2008.06478 (2020) - [i23]Sergey Bravyi, Joseph A. Latone, Dmitri Maslov:
6-qubit Optimal Clifford Circuits. CoRR abs/2012.06074 (2020)
2010 – 2019
- 2019
- [j20]Dmitri Maslov, Yun Seong Nam, Jungsang Kim:
An Outlook for Quantum Computing [Point of View]. Proc. IEEE 107(1): 5-10 (2019) - [c12]Shaohan Hu, Dmitri Maslov, Marco Pistoia, Jay M. Gambetta:
Efficient Circuits for Quantum Search over 2D Square Lattice Architecture. DAC 2019: 236 - [i22]Yun Seong Nam, Jwo-Sy Chen, Neal C. Pisenti, Kenneth Wright, Conor Delaney, Dmitri Maslov, Kenneth R. Brown, Stewart Allen, Jason M. Amini, Joel Apisdorf, Kristin M. Beck, Aleksey Blinov, Vandiver Chaplin, Mika Chmielewski, Coleman Collins, Shantanu Debnath, Andrew M. Ducore, Kai M. Hudek, Matthew J. Keesan, Sarah M. Kreikemeier, Jonathan Mizrahi, Phil Solomon, Mike Williams, Jaime David Wong-Campos, Christopher R. Monroe, Jungsang Kim:
Ground-state energy estimation of the water molecule on a trapped ion quantum computer. CoRR abs/1902.10171 (2019) - 2018
- [j19]Andrew M. Childs, Dmitri Maslov, Yun Seong Nam, Neil J. Ross, Yuan Su:
Toward the first quantum simulation with quantum speedup. Proc. Natl. Acad. Sci. USA 115(38): 9456-9461 (2018) - [j18]Dmitri Maslov, Martin Roetteler:
Shorter Stabilizer Circuits via Bruhat Decomposition and Quantum Circuit Transformations. IEEE Trans. Inf. Theory 64(7): 4729-4738 (2018) - [i21]Yun Seong Nam, Yuan Su, Dmitri Maslov:
Approximate Quantum Fourier Transform with O(n log(n)) T gates. CoRR abs/1803.04933 (2018) - [i20]Yun Seong Nam, Dmitri Maslov:
Low cost quantum circuits for classically intractable instances of the Hamiltonian dynamics simulation problem. CoRR abs/1805.04645 (2018) - [i19]Caroline Figgatt, Aaron Ostrander, Norbert Matthias Linke, K. A. Landsman, Daiwei Zhu, Dmitri Maslov, Christopher R. Monroe:
Parallel Entangling Operations on a Universal Ion Trap Quantum Computer. CoRR abs/1810.11948 (2018) - 2017
- [j17]Norbert Matthias Linke, Dmitri Maslov, Martin Roetteler, Shantanu Debnath, Caroline Figgatt, Kevin A. Landsman, Kenneth Wright, Christopher R. Monroe:
Experimental comparison of two quantum computing architectures. Proc. Natl. Acad. Sci. USA 114(13): 3305-3310 (2017) - [i18]Norbert Matthias Linke, Dmitri Maslov, Martin Rötteler, Shantanu Debnath, Caroline Figgatt, K. A. Landsman, Kenneth Wright, Christopher R. Monroe:
Experimental Comparison of Two Quantum Computing Architectures. CoRR abs/1702.01852 (2017) - [i17]Dmitri Maslov:
Optimized Aaronson-Gottesman stabilizer circuit simulation through quantum circuit transformations. CoRR abs/1703.00874 (2017) - [i16]Caroline Figgatt, Dmitri Maslov, K. A. Landsman, Norbert Matthias Linke, Shantanu Debnath, Christopher R. Monroe:
Complete 3-Qubit Grover Search on a Programmable Quantum Computer. CoRR abs/1703.10535 (2017) - [i15]Dmitri Maslov, Martin Roetteler:
Shorter stabilizer circuits via Bruhat decomposition and quantum circuit transformations. CoRR abs/1705.09176 (2017) - [i14]Dmitri Maslov, Yun Seong Nam:
Use of global interactions in efficient quantum circuit constructions. CoRR abs/1707.06356 (2017) - [i13]Yun Seong Nam, Neil J. Ross, Yuan Su, Andrew M. Childs, Dmitri Maslov:
Automated optimization of large quantum circuits with continuous parameters. CoRR abs/1710.07345 (2017) - 2016
- [j16]Dmitri Maslov:
Optimal and asymptotically optimal NCT reversible circuits by the gate types. Quantum Inf. Comput. 16(13&14): 1096-1112 (2016) - [j15]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) - [i12]Dmitri Maslov:
Optimal and asymptotically optimal NCT reversible circuits by the gate types. CoRR abs/1602.02627 (2016) - [i11]Dmitri Maslov:
Basic circuit compilation techniques for an ion-trap quantum machine. CoRR abs/1603.07678 (2016) - 2015
- [i10]Dmitri Maslov:
On the advantages of using relative phase Toffolis with an application to multiple control Toffoli optimization. CoRR abs/1508.03273 (2015) - 2014
- [j14]Matthew Amy, Dmitri Maslov, Michele Mosca:
Polynomial-Time T-Depth Optimization of Clifford+T Circuits Via Matroid Partitioning. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 33(10): 1476-1489 (2014) - 2013
- [j13]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) - [j12]Matthew Amy, Dmitri Maslov, Michele Mosca, Martin Roetteler:
A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 32(6): 818-830 (2013) - [i9]Matthew Amy, Dmitri Maslov, Michele Mosca:
Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning. CoRR abs/1303.2042 (2013) - [i8]Vadym Kliuchnikov, Dmitri Maslov:
Optimization of Clifford Circuits. CoRR abs/1305.0810 (2013) - 2012
- [j11]Oleg Golubitsky, Dmitri Maslov:
A Study of Optimal 4-Bit Reversible Toffoli Circuits and Their Synthesis. IEEE Trans. Computers 61(9): 1341-1353 (2012) - [i7]Matthew Amy, Dmitri Maslov, Michele Mosca, Martin Roetteler:
A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits. CoRR abs/1206.0758 (2012) - [i6]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) - [i5]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) - [i4]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) - 2011
- [j10]Dmitri Maslov, Mehdi Saeedi:
Reversible Circuit Optimization Via Leaving the Boolean Domain. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 30(6): 806-816 (2011) - [i3]Dmitri Maslov, Mehdi Saeedi:
Reversible Circuit Optimization via Leaving the Boolean Domain. CoRR abs/1103.0215 (2011) - [i2]Oleg Golubitsky, Dmitri Maslov:
A Study of Optimal 4-bit Reversible Toffoli Circuits and Their Synthesis. CoRR abs/1103.2686 (2011) - 2010
- [c11]Oleg Golubitsky, Sean M. Falconer, Dmitri Maslov:
Synthesis of the optimal 4-bit reversible circuits. DAC 2010: 653-656
2000 – 2009
- 2009
- [j9]Dmitri Maslov, Jimson Mathew, Donny Cheung, Dhiraj K. Pradhan:
An O(m2)-depth quantum algorithm for the elliptic curve discrete logarithm problem over GF(2m)a. Quantum Inf. Comput. 9(7&8): 610-621 (2009) - 2008
- [j8]Dmitri Maslov, Gerhard W. Dueck, D. Michael Miller, Camille Negrevergne:
Quantum Circuit Simplification and Level Compaction. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 27(3): 436-444 (2008) - [j7]Dmitri Maslov, Sean M. Falconer, Michele Mosca:
Quantum Circuit Placement. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 27(4): 752-763 (2008) - [c10]Donny Cheung, Dmitri Maslov, Jimson Mathew, Dhiraj K. Pradhan:
On the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography. TQC 2008: 96-104 - 2007
- [j6]Dmitri Maslov, D. Michael Miller:
Comparison of the cost metrics through investigation of the relation between optimal NCV and optimal NCT three-qubit reversible circuits. IET Comput. Digit. Tech. 1(2): 98-104 (2007) - [j5]Dmitri Maslov, Gerhard W. Dueck, D. Michael Miller:
Techniques for the synthesis of reversible Toffoli networks. ACM Trans. Design Autom. Electr. Syst. 12(4): 42 (2007) - [c9]Dmitri Maslov, Sean M. Falconer, Michele Mosca:
Quantum Circuit Placement: Optimizing Qubit-to-qubit Interactions through Mapping Quantum Circuits into a Physical Experiment. DAC 2007: 962-965 - 2006
- [j4]D. Michael Miller, Dmitri Maslov, Gerhard W. Dueck:
Synthesis of Quantum Multiple-Valued Circuits. J. Multiple Valued Log. Soft Comput. 12(5-6): 431-450 (2006) - [c8]Dmitri Maslov, Gerhard W. Dueck:
Level Compaction in Quantum Circuits. IEEE Congress on Evolutionary Computation 2006: 2405-2409 - [c7]Sean M. Falconer, Dmitri Maslov, Margaret-Anne D. Storey:
Combining Web-Based Searching with Latent Semantic Analysis to Discover Similarity Between Phrases. OTM Conferences (1) 2006: 1075-1091 - [i1]Sean M. Falconer, Dmitri Maslov:
Weighted hierarchical alignment of directed acyclic graph. CoRR abs/cs/0606124 (2006) - 2005
- [j3]Dmitri Maslov, Gerhard W. Dueck, D. Michael Miller:
Toffoli network synthesis with templates. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 24(6): 807-817 (2005) - [j2]Dmitri Maslov, Gerhard W. Dueck, D. Michael Miller:
Synthesis of Fredkin-Toffoli reversible networks. IEEE Trans. Very Large Scale Integr. Syst. 13(6): 765-769 (2005) - [c6]Igor L. Markov, Dmitri Maslov:
Uniformly-Switching Logic for Cryptographic Hardware. DATE 2005: 432-433 - [c5]Dmitri Maslov, Christina Young, D. Michael Miller, Gerhard W. Dueck:
Quantum Circuit Simplification Using Templates. DATE 2005: 1208-1213 - 2004
- [j1]Dmitri Maslov, Gerhard W. Dueck:
Reversible cascades with minimal garbage. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 23(11): 1497-1509 (2004) - [c4]D. Michael Miller, Gerhard W. Dueck, Dmitri Maslov:
A Synthesis Method for MVL Reversible Logi. ISMVL 2004: 74-80 - 2003
- [c3]D. Michael Miller, Dmitri Maslov, Gerhard W. Dueck:
A transformation based algorithm for reversible logic synthesis. DAC 2003: 318-323 - [c2]Dmitri Maslov, Gerhard W. Dueck, D. Michael Miller:
Fredkin/Toffoli Templates for Reversible Logic Synthesis. ICCAD 2003: 256-261 - [c1]Dmitri Maslov, Gerhard W. Dueck, D. Michael Miller:
Simplification of Toffoli Networks via Templates. SBCCI 2003: 53-
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-10 21:21 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:
