Dmitri Maslov

Orcid: 0000-0001-7381-4556

According to our database1, Dmitri Maslov authored at least 55 papers between 2003 and 2024.

Collaborative distances:



In proceedings 
PhD thesis 




High-threshold and low-overhead fault-tolerant quantum memory.
Nat., 2024

Fast classical simulation of Harvard/QuEra IQP circuits.
CoRR, 2024

Efficient Ancilla-Free Reversible and Quantum Circuits for the Hidden Weighted Bit Function.
IEEE Trans. Computers, 2022

CNOT circuits need little help to implement arbitrary Hadamard-free Clifford transformations they generate.
CoRR, 2022

Constant-cost implementations of Clifford operations and multiply controlled gates using global interactions.
CoRR, 2022

Depth optimization of CZ, CNOT, and Clifford circuits.
CoRR, 2022

Hadamard-Free Circuits Expose the Structure of the Clifford Group.
IEEE Trans. Inf. Theory, 2021

Clifford Circuit Optimization with Templates and Symbolic Pauli Gates.
Quantum, 2021

6-qubit Optimal Clifford Circuits.
CoRR, 2020

Quantum advantage for computations with limited space.
CoRR, 2020

An Outlook for Quantum Computing [Point of View].
Proc. IEEE, 2019

Ground-state energy estimation of the water molecule on a trapped ion quantum computer.
CoRR, 2019

Efficient Circuits for Quantum Search over 2D Square Lattice Architecture.
Proceedings of the 56th Annual Design Automation Conference 2019, 2019

Shorter Stabilizer Circuits via Bruhat Decomposition and Quantum Circuit Transformations.
IEEE Trans. Inf. Theory, 2018

Toward the first quantum simulation with quantum speedup.
Proc. Natl. Acad. Sci. USA, 2018

Parallel Entangling Operations on a Universal Ion Trap Quantum Computer.
CoRR, 2018

Low cost quantum circuits for classically intractable instances of the Hamiltonian dynamics simulation problem.
CoRR, 2018

Approximate Quantum Fourier Transform with O(n log(n)) T gates.
CoRR, 2018

Experimental comparison of two quantum computing architectures.
Proc. Natl. Acad. Sci. USA, 2017

Automated optimization of large quantum circuits with continuous parameters.
CoRR, 2017

Use of global interactions in efficient quantum circuit constructions.
CoRR, 2017

Optimized Aaronson-Gottesman stabilizer circuit simulation through quantum circuit transformations.
CoRR, 2017

Complete 3-Qubit Grover Search on a Programmable Quantum Computer.
CoRR, 2017

Practical Approximation of Single-Qubit Unitaries by Single-Qubit Quantum Clifford and T Circuits.
IEEE Trans. Computers, 2016

Optimal and asymptotically optimal NCT reversible circuits by the gate types.
Quantum Inf. Comput., 2016

Basic circuit compilation techniques for an ion-trap quantum machine.
CoRR, 2016

On the advantages of using relative phase Toffolis with an application to multiple control Toffoli optimization.
CoRR, 2015

Polynomial-Time T-Depth Optimization of Clifford+T Circuits Via Matroid Partitioning.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2014

A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2013

Fast and efficient exact synthesis of single-qubit unitaries generated by clifford and T gates.
Quantum Inf. Comput., 2013

Optimization of Clifford Circuits
CoRR, 2013

A Study of Optimal 4-Bit Reversible Toffoli Circuits and Their Synthesis.
IEEE Trans. Computers, 2012

Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits
CoRR, 2012

Reversible Circuit Optimization Via Leaving the Boolean Domain.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2011

Synthesis of the optimal 4-bit reversible circuits.
Proceedings of the 47th Design Automation Conference, 2010

An O(m<sup>2</sup>)-depth quantum algorithm for the elliptic curve discrete logarithm problem over GF(2<sup>m</sup>)<sup>a</sup>.
Quantum Inf. Comput., 2009

Quantum Circuit Placement.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2008

Quantum Circuit Simplification and Level Compaction.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2008

On the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography.
Proceedings of the Theory of Quantum Computation, 2008

Techniques for the synthesis of reversible Toffoli networks.
ACM Trans. Design Autom. Electr. Syst., 2007

Comparison of the cost metrics through investigation of the relation between optimal NCV and optimal NCT three-qubit reversible circuits.
IET Comput. Digit. Tech., 2007

Quantum Circuit Placement: Optimizing Qubit-to-qubit Interactions through Mapping Quantum Circuits into a Physical Experiment.
Proceedings of the 44th Design Automation Conference, 2007

Synthesis of Quantum Multiple-Valued Circuits.
J. Multiple Valued Log. Soft Comput., 2006

Weighted hierarchical alignment of directed acyclic graph
CoRR, 2006

Combining Web-Based Searching with Latent Semantic Analysis to Discover Similarity Between Phrases.
Proceedings of the On the Move to Meaningful Internet Systems 2006: CoopIS, 2006

Level Compaction in Quantum Circuits.
Proceedings of the IEEE International Conference on Evolutionary Computation, 2006

Synthesis of Fredkin-Toffoli reversible networks.
IEEE Trans. Very Large Scale Integr. Syst., 2005

Toffoli network synthesis with templates.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2005

Quantum Circuit Simplification Using Templates.
Proceedings of the 2005 Design, 2005

Uniformly-Switching Logic for Cryptographic Hardware.
Proceedings of the 2005 Design, 2005

Reversible cascades with minimal garbage.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2004

A Synthesis Method for MVL Reversible Logi.
Proceedings of the 34th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2004), 2004

Simplification of Toffoli Networks via Templates.
Proceedings of the 16th Annual Symposium on Integrated Circuits and Systems Design, 2003

Fredkin/Toffoli Templates for Reversible Logic Synthesis.
Proceedings of the 2003 International Conference on Computer-Aided Design, 2003

A transformation based algorithm for reversible logic synthesis.
Proceedings of the 40th Design Automation Conference, 2003