168 citations · 1.2k across the 31 of their papers we have counts for
31 papers
A square-root speedup for finding the smallest eigenvalue
Alex Kerzner, Vlad Gheorghiu, Michele Mosca +4
We describe a quantum algorithm for finding the smallest eigenvalue of a Hermitian matrix. This algorithm combines Quantum Phase Estimation and Quantum Amplitude Estimation to achi…
Limitations of the Macaulay matrix approach for using the HHL algorithm to solve multivariate polynomial systems
Jintai Ding, Vlad Gheorghiu, András Gilyén +2
Recently Chen and Gao~\cite{ChenGao2017} proposed a new quantum algorithm for Boolean polynomial system solving, motivated by the cryptanalysis of some post-quantum cryptosystems.…
T-count and T-depth of any multi-qubit unitary
Vlad Gheorghiu, Michele Mosca, Priyanka Mukhopadhyay
While implementing a quantum algorithm it is crucial to reduce the quantum resources, in order to obtain the desired computational advantage. For most fault-tolerant quantum error-…
A (quasi-)polynomial time heuristic algorithm for synthesizing T-depth optimal circuits
Vlad Gheorghiu, Michele Mosca, Priyanka Mukhopadhyay
We investigate the problem of synthesizing T-depth optimal quantum circuits over the Clifford+T gate set. First we construct a special subset of T-depth 1 unitaries, such that it i…
Reducing the CNOT count for Clifford+T circuits on NISQ architectures
Vlad Gheorghiu, Jiaxin Huang, Sarah Meng Li +2
While mapping a quantum circuit to the physical layer one has to consider the numerous constraints imposed by the underlying hardware architecture. Connectivity of the physical qub…
staq -- A full-stack quantum processing toolkit
Matthew Amy, Vlad Gheorghiu
We describe 'staq', a full-stack quantum processing toolkit written in standard C++. 'staq' is a quantum compiler toolkit, comprising of tools that range from quantum optimizers an…